/
orthogonal.py
executable file
·704 lines (598 loc) · 22.8 KB
/
orthogonal.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
"""
A collection of functions to find the weights and abscissas for
Gaussian Quadrature.
These calculations are done by finding the eigenvalues of a
tridiagonal matrix whose entries are dependent on the coefficients
in the recursion formula for the orthogonal polynomials with the
corresponding weighting function over the interval.
Many recursion relations for orthogonal polynomials are given:
.. math::
a1n f_{n+1} (x) = (a2n + a3n x ) f_n (x) - a4n f_{n-1} (x)
The recursion relation of interest is
.. math::
P_{n+1} (x) = (x - A_n) P_n (x) - B_n P_{n-1} (x)
where :math:`P` has a different normalization than :math:`f`.
The coefficients can be found as:
.. math::
A_n = -a2n / a3n
\\qquad
B_n = ( a4n / a3n \\sqrt{h_n-1 / h_n})^2
where
.. math::
h_n = \\int_a^b w(x) f_n(x)^2
assume:
.. math::
P_0 (x) = 1
\\qquad
P_{-1} (x) == 0
For the mathematical background, see [golub.welsch-1969-mathcomp]_ and
[abramowitz.stegun-1965]_.
Functions::
gen_roots_and_weights -- Generic roots and weights.
j_roots -- Jacobi
js_roots -- Shifted Jacobi
la_roots -- Generalized Laguerre
h_roots -- Hermite
he_roots -- Hermite (unit-variance)
cg_roots -- Ultraspherical (Gegenbauer)
t_roots -- Chebyshev of the first kind
u_roots -- Chebyshev of the second kind
c_roots -- Chebyshev of the first kind ([-2,2] interval)
s_roots -- Chebyshev of the second kind ([-2,2] interval)
ts_roots -- Shifted Chebyshev of the first kind.
us_roots -- Shifted Chebyshev of the second kind.
p_roots -- Legendre
ps_roots -- Shifted Legendre
l_roots -- Laguerre
.. [golub.welsch-1969-mathcomp]
Golub, Gene H, and John H Welsch. 1969. Calculation of Gauss
Quadrature Rules. *Mathematics of Computation* 23, 221-230+s1--s10.
.. [abramowitz.stegun-1965]
Abramowitz, Milton, and Irene A Stegun. (1965) *Handbook of
Mathematical Functions: with Formulas, Graphs, and Mathematical
Tables*. Gaithersburg, MD: National Bureau of Standards.
http://www.math.sfu.ca/~cbm/aands/
"""
#
# Author: Travis Oliphant 2000
# Updated Sep. 2003 (fixed bugs --- tested to be accurate)
from __future__ import division, print_function, absolute_import
# Scipy imports.
import numpy as np
from numpy import all, any, exp, inf, pi, sqrt
from numpy.dual import eig
# Local imports.
from . import _ufuncs as cephes
_gam = cephes.gamma
__all__ = ['legendre', 'chebyt', 'chebyu', 'chebyc', 'chebys',
'jacobi', 'laguerre', 'genlaguerre', 'hermite', 'hermitenorm',
'gegenbauer', 'sh_legendre', 'sh_chebyt', 'sh_chebyu', 'sh_jacobi',
'p_roots', 'ps_roots', 'j_roots', 'js_roots', 'l_roots', 'la_roots',
'he_roots', 'ts_roots', 'us_roots', 's_roots', 't_roots', 'u_roots',
'c_roots', 'cg_roots', 'h_roots',
'eval_legendre', 'eval_chebyt', 'eval_chebyu', 'eval_chebyc',
'eval_chebys', 'eval_jacobi', 'eval_laguerre', 'eval_genlaguerre',
'eval_hermite', 'eval_hermitenorm', 'eval_gegenbauer',
'eval_sh_legendre', 'eval_sh_chebyt', 'eval_sh_chebyu',
'eval_sh_jacobi', 'poch', 'binom']
def poch(z, m):
"""Pochhammer symbol (z)_m = (z)(z+1)....(z+m-1) = gamma(z+m)/gamma(z)"""
return _gam(z+m) / _gam(z)
class orthopoly1d(np.poly1d):
def __init__(self, roots, weights=None, hn=1.0, kn=1.0, wfunc=None, limits=None, monic=0,eval_func=None):
np.poly1d.__init__(self, roots, r=1)
equiv_weights = [weights[k] / wfunc(roots[k]) for k in range(len(roots))]
self.__dict__['weights'] = np.array(list(zip(roots,weights,equiv_weights)))
self.__dict__['weight_func'] = wfunc
self.__dict__['limits'] = limits
mu = sqrt(hn)
if monic:
evf = eval_func
if evf:
eval_func = lambda x: evf(x)/kn
mu = mu / abs(kn)
kn = 1.0
self.__dict__['normcoef'] = mu
self.__dict__['coeffs'] *= kn
# Note: eval_func will be discarded on arithmetic
self.__dict__['_eval_func'] = eval_func
def __call__(self, v):
if self._eval_func and not isinstance(v, np.poly1d):
return self._eval_func(v)
else:
return np.poly1d.__call__(self, v)
def _scale(self, p):
if p == 1.0:
return
self.__dict__['coeffs'] *= p
evf = self.__dict__['_eval_func']
if evf:
self.__dict__['_eval_func'] = lambda x: evf(x) * p
self.__dict__['normcoef'] *= p
def gen_roots_and_weights(n, an_func, sqrt_bn_func, mu):
"""[x,w] = gen_roots_and_weights(n,an_func,sqrt_bn_func,mu)
Returns the roots (x) of an nth order orthogonal polynomial,
and weights (w) to use in appropriate Gaussian quadrature with that
orthogonal polynomial.
The polynomials have the recurrence relation
P_n+1(x) = (x - A_n) P_n(x) - B_n P_n-1(x)
an_func(n) should return A_n
sqrt_bn_func(n) should return sqrt(B_n)
mu ( = h_0 ) is the integral of the weight over the orthogonal interval
"""
nn = np.arange(1.0,n)
sqrt_bn = sqrt_bn_func(nn)
an = an_func(np.concatenate(([0], nn)))
x, v = eig((np.diagflat(an) +
np.diagflat(sqrt_bn,1) +
np.diagflat(sqrt_bn,-1)))
answer = []
sortind = x.real.argsort()
answer.append(x[sortind])
answer.append((mu*v[0]**2)[sortind])
return answer
# Jacobi Polynomials 1 P^(alpha,beta)_n(x)
def j_roots(n, alpha, beta, mu=0):
"""[x,w] = j_roots(n,alpha,beta)
Returns the roots (x) of the nth order Jacobi polynomial, P^(alpha,beta)_n(x)
and weights (w) to use in Gaussian Quadrature over [-1,1] with weighting
function (1-x)**alpha (1+x)**beta with alpha,beta > -1.
"""
if any(alpha <= -1) or any(beta <= -1):
raise ValueError("alpha and beta must be greater than -1.")
if n < 1:
raise ValueError("n must be positive.")
olderr = np.seterr(all='ignore')
try:
(p,q) = (alpha,beta)
# from recurrence relations
sbn_J = lambda k: 2.0/(2.0*k+p+q)*sqrt((k+p)*(k+q)/(2*k+q+p+1)) * \
(np.where(k==1,1.0,sqrt(k*(k+p+q)/(2.0*k+p+q-1))))
if any(p == q): # XXX any or all???
an_J = lambda k: 0.0*k
else:
an_J = lambda k: np.where(k==0,(q-p)/(p+q+2.0),
(q*q - p*p)/((2.0*k+p+q)*(2.0*k+p+q+2)))
g = cephes.gamma
mu0 = 2.0**(p+q+1)*g(p+1)*g(q+1)/(g(p+q+2))
val = gen_roots_and_weights(n,an_J,sbn_J,mu0)
finally:
np.seterr(**olderr)
if mu:
return val + [mu0]
else:
return val
def jacobi(n, alpha, beta, monic=0):
"""Returns the nth order Jacobi polynomial, P^(alpha,beta)_n(x)
orthogonal over [-1,1] with weighting function
(1-x)**alpha (1+x)**beta with alpha,beta > -1.
"""
if n < 0:
raise ValueError("n must be nonnegative.")
wfunc = lambda x: (1-x)**alpha * (1+x)**beta
if n==0:
return orthopoly1d([],[],1.0,1.0,wfunc,(-1,1),monic,
eval_func=np.ones_like)
x,w,mu = j_roots(n,alpha,beta,mu=1)
ab1 = alpha+beta+1.0
hn = 2**ab1/(2*n+ab1)*_gam(n+alpha+1)
hn *= _gam(n+beta+1.0) / _gam(n+1) / _gam(n+ab1)
kn = _gam(2*n+ab1)/2.0**n / _gam(n+1) / _gam(n+ab1)
# here kn = coefficient on x^n term
p = orthopoly1d(x,w,hn,kn,wfunc,(-1,1),monic,
lambda x: eval_jacobi(n,alpha,beta,x))
return p
# Jacobi Polynomials shifted G_n(p,q,x)
def js_roots(n, p1, q1, mu=0):
"""[x,w] = js_roots(n,p,q)
Returns the roots (x) of the nth order shifted Jacobi polynomial, G_n(p,q,x),
and weights (w) to use in Gaussian Quadrature over [0,1] with weighting
function (1-x)**(p-q) x**(q-1) with p-q > -1 and q > 0.
"""
# from recurrence relation
if not ( any((p1 - q1) > -1) and any(q1 > 0) ):
raise ValueError("(p - q) > -1 and q > 0 please.")
if n <= 0:
raise ValueError("n must be positive.")
p,q = p1,q1
sbn_Js = lambda k: sqrt(np.where(k==1,q*(p-q+1.0)/(p+2.0), \
k*(k+q-1.0)*(k+p-1.0)*(k+p-q) \
/ ((2.0*k+p-2) * (2.0*k+p))))/(2*k+p-1.0)
an_Js = lambda k: np.where(k==0,q/(p+1.0),(2.0*k*(k+p)+q*(p-1.0)) / ((2.0*k+p+1.0)*(2*k+p-1.0)))
# could also use definition
# Gn(p,q,x) = constant_n * P^(p-q,q-1)_n(2x-1)
# so roots of Gn(p,q,x) are (roots of P^(p-q,q-1)_n + 1) / 2.0
g = _gam
# integral of weight over interval
mu0 = g(q)*g(p-q+1)/g(p+1)
val = gen_roots_and_weights(n,an_Js,sbn_Js,mu0)
if mu:
return val + [mu0]
else:
return val
# What code would look like using jacobi polynomial roots
#if mu:
# [x,w,mut] = j_roots(n,p-q,q-1,mu=1)
# return [(x+1)/2.0,w,mu0]
#else:
# [x,w] = j_roots(n,p-q,q-1,mu=0)
# return [(x+1)/2.0,w]
def sh_jacobi(n, p, q, monic=0):
"""Returns the nth order Jacobi polynomial, G_n(p,q,x)
orthogonal over [0,1] with weighting function
(1-x)**(p-q) (x)**(q-1) with p>q-1 and q > 0.
"""
if n < 0:
raise ValueError("n must be nonnegative.")
wfunc = lambda x: (1.0-x)**(p-q) * (x)**(q-1.)
if n==0:
return orthopoly1d([],[],1.0,1.0,wfunc,(-1,1),monic,
eval_func=np.ones_like)
n1 = n
x,w,mu0 = js_roots(n1,p,q,mu=1)
hn = _gam(n+1)*_gam(n+q)*_gam(n+p)*_gam(n+p-q+1)
hn /= (2*n+p)*(_gam(2*n+p)**2)
# kn = 1.0 in standard form so monic is redundant. Kept for compatibility.
kn = 1.0
pp = orthopoly1d(x,w,hn,kn,wfunc=wfunc,limits=(0,1),monic=monic,
eval_func=lambda x: eval_sh_jacobi(n, p, q, x))
return pp
# Generalized Laguerre L^(alpha)_n(x)
def la_roots(n, alpha, mu=0):
"""[x,w] = la_roots(n,alpha)
Returns the roots (x) of the nth order generalized (associated) Laguerre
polynomial, L^(alpha)_n(x), and weights (w) to use in Gaussian quadrature over
[0,inf] with weighting function exp(-x) x**alpha with alpha > -1.
"""
if not all(alpha > -1):
raise ValueError("alpha > -1")
if n < 1:
raise ValueError("n must be positive.")
(p,q) = (alpha,0.0)
sbn_La = lambda k: -sqrt(k*(k + p)) # from recurrence relation
an_La = lambda k: 2*k + p + 1
mu0 = cephes.gamma(alpha+1) # integral of weight over interval
val = gen_roots_and_weights(n,an_La,sbn_La,mu0)
if mu:
return val + [mu0]
else:
return val
def genlaguerre(n, alpha, monic=0):
"""Returns the nth order generalized (associated) Laguerre polynomial,
L^(alpha)_n(x), orthogonal over [0,inf) with weighting function
exp(-x) x**alpha with alpha > -1
"""
if any(alpha <= -1):
raise ValueError("alpha must be > -1")
if n < 0:
raise ValueError("n must be nonnegative.")
if n==0: n1 = n+1
else: n1 = n
x,w,mu0 = la_roots(n1,alpha,mu=1)
wfunc = lambda x: exp(-x) * x**alpha
if n==0: x,w = [],[]
hn = _gam(n+alpha+1)/_gam(n+1)
kn = (-1)**n / _gam(n+1)
p = orthopoly1d(x,w,hn,kn,wfunc,(0,inf),monic,
lambda x: eval_genlaguerre(n,alpha,x))
return p
# Laguerre L_n(x)
def l_roots(n, mu=0):
"""[x,w] = l_roots(n)
Returns the roots (x) of the nth order Laguerre polynomial, L_n(x),
and weights (w) to use in Gaussian Quadrature over [0,inf] with weighting
function exp(-x).
"""
return la_roots(n,0.0,mu=mu)
def laguerre(n, monic=0):
"""Return the nth order Laguerre polynoimal, L_n(x), orthogonal over
[0,inf) with weighting function exp(-x)
"""
if n < 0:
raise ValueError("n must be nonnegative.")
if n==0: n1 = n+1
else: n1 = n
x,w,mu0 = l_roots(n1,mu=1)
if n==0: x,w = [],[]
hn = 1.0
kn = (-1)**n / _gam(n+1)
p = orthopoly1d(x,w,hn,kn,lambda x: exp(-x),(0,inf),monic,
lambda x: eval_laguerre(n,x))
return p
# Hermite 1 H_n(x)
def h_roots(n, mu=0):
"""[x,w] = h_roots(n)
Returns the roots (x) of the nth order Hermite polynomial,
H_n(x), and weights (w) to use in Gaussian Quadrature over
[-inf,inf] with weighting function exp(-x**2).
"""
if n < 1:
raise ValueError("n must be positive.")
sbn_H = lambda k: sqrt(k/2) # from recurrence relation
an_H = lambda k: 0*k
mu0 = sqrt(pi) # integral of weight over interval
val = gen_roots_and_weights(n,an_H,sbn_H,mu0)
if mu:
return val + [mu0]
else:
return val
def hermite(n, monic=0):
"""Return the nth order Hermite polynomial, H_n(x), orthogonal over
(-inf,inf) with weighting function exp(-x**2)
"""
if n < 0:
raise ValueError("n must be nonnegative.")
if n==0: n1 = n+1
else: n1 = n
x,w,mu0 = h_roots(n1,mu=1)
wfunc = lambda x: exp(-x*x)
if n==0: x,w = [],[]
hn = 2**n * _gam(n+1)*sqrt(pi)
kn = 2**n
p = orthopoly1d(x,w,hn,kn,wfunc,(-inf,inf),monic,
lambda x: eval_hermite(n,x))
return p
# Hermite 2 He_n(x)
def he_roots(n, mu=0):
"""[x,w] = he_roots(n)
Returns the roots (x) of the nth order Hermite polynomial,
He_n(x), and weights (w) to use in Gaussian Quadrature over
[-inf,inf] with weighting function exp(-(x/2)**2).
"""
if n < 1:
raise ValueError("n must be positive.")
sbn_He = lambda k: sqrt(k) # from recurrence relation
an_He = lambda k: 0*k
mu0 = sqrt(2*pi) # integral of weight over interval
val = gen_roots_and_weights(n,an_He,sbn_He,mu0)
if mu:
return val + [mu0]
else:
return val
def hermitenorm(n, monic=0):
"""Return the nth order normalized Hermite polynomial, He_n(x), orthogonal
over (-inf,inf) with weighting function exp(-(x/2)**2)
"""
if n < 0:
raise ValueError("n must be nonnegative.")
if n==0: n1 = n+1
else: n1 = n
x,w,mu0 = he_roots(n1,mu=1)
wfunc = lambda x: exp(-x*x/4.0)
if n==0: x,w = [],[]
hn = sqrt(2*pi)*_gam(n+1)
kn = 1.0
p = orthopoly1d(x,w,hn,kn,wfunc=wfunc,limits=(-inf,inf),monic=monic,
eval_func=lambda x: eval_hermitenorm(n,x))
return p
## The remainder of the polynomials can be derived from the ones above.
# Ultraspherical (Gegenbauer) C^(alpha)_n(x)
def cg_roots(n, alpha, mu=0):
"""[x,w] = cg_roots(n,alpha)
Returns the roots (x) of the nth order Ultraspherical (Gegenbauer)
polynomial, C^(alpha)_n(x), and weights (w) to use in Gaussian Quadrature
over [-1,1] with weighting function (1-x**2)**(alpha-1/2) with alpha>-1/2.
"""
return j_roots(n,alpha-0.5,alpha-0.5,mu=mu)
def gegenbauer(n, alpha, monic=0):
"""Return the nth order Gegenbauer (ultraspherical) polynomial,
C^(alpha)_n(x), orthogonal over [-1,1] with weighting function
(1-x**2)**(alpha-1/2) with alpha > -1/2
"""
base = jacobi(n,alpha-0.5,alpha-0.5,monic=monic)
if monic:
return base
# Abrahmowitz and Stegan 22.5.20
factor = _gam(2*alpha+n)*_gam(alpha+0.5) / _gam(2*alpha) / _gam(alpha+0.5+n)
base._scale(factor)
base.__dict__['_eval_func'] = lambda x: eval_gegenbauer(float(n), alpha, x)
return base
# Chebyshev of the first kind: T_n(x) = n! sqrt(pi) / _gam(n+1./2)* P^(-1/2,-1/2)_n(x)
# Computed anew.
def t_roots(n, mu=0):
"""[x,w] = t_roots(n)
Returns the roots (x) of the nth order Chebyshev (of the first kind)
polynomial, T_n(x), and weights (w) to use in Gaussian Quadrature
over [-1,1] with weighting function (1-x**2)**(-1/2).
"""
if n < 1:
raise ValueError("n must be positive.")
# from recurrence relation
sbn_J = lambda k: np.where(k==1,sqrt(2)/2.0,0.5)
an_J = lambda k: 0.0*k
g = cephes.gamma
mu0 = pi
val = gen_roots_and_weights(n,an_J,sbn_J,mu0)
if mu:
return val + [mu0]
else:
return val
def chebyt(n, monic=0):
"""Return nth order Chebyshev polynomial of first kind, Tn(x). Orthogonal
over [-1,1] with weight function (1-x**2)**(-1/2).
"""
if n < 0:
raise ValueError("n must be nonnegative.")
wfunc = lambda x: 1.0/sqrt(1-x*x)
if n==0:
return orthopoly1d([],[],pi,1.0,wfunc,(-1,1),monic,
lambda x: eval_chebyt(n,x))
n1 = n
x,w,mu = t_roots(n1,mu=1)
hn = pi/2
kn = 2**(n-1)
p = orthopoly1d(x,w,hn,kn,wfunc,(-1,1),monic,
lambda x: eval_chebyt(n,x))
return p
# Chebyshev of the second kind
# U_n(x) = (n+1)! sqrt(pi) / (2*_gam(n+3./2)) * P^(1/2,1/2)_n(x)
def u_roots(n, mu=0):
"""[x,w] = u_roots(n)
Returns the roots (x) of the nth order Chebyshev (of the second kind)
polynomial, U_n(x), and weights (w) to use in Gaussian Quadrature
over [-1,1] with weighting function (1-x**2)**1/2.
"""
return j_roots(n,0.5,0.5,mu=mu)
def chebyu(n, monic=0):
"""Return nth order Chebyshev polynomial of second kind, Un(x). Orthogonal
over [-1,1] with weight function (1-x**2)**(1/2).
"""
base = jacobi(n,0.5,0.5,monic=monic)
if monic:
return base
factor = sqrt(pi)/2.0*_gam(n+2) / _gam(n+1.5)
base._scale(factor)
return base
# Chebyshev of the first kind C_n(x)
def c_roots(n, mu=0):
"""[x,w] = c_roots(n)
Returns the roots (x) of the nth order Chebyshev (of the first kind)
polynomial, C_n(x), and weights (w) to use in Gaussian Quadrature
over [-2,2] with weighting function (1-(x/2)**2)**(-1/2).
"""
if mu:
[x,w,mu0] = j_roots(n,-0.5,-0.5,mu=1)
return [x*2,w,mu0]
else:
[x,w] = j_roots(n,-0.5,-0.5,mu=0)
return [x*2,w]
def chebyc(n, monic=0):
"""Return nth order Chebyshev polynomial of first kind, Cn(x). Orthogonal
over [-2,2] with weight function (1-(x/2)**2)**(-1/2).
"""
if n < 0:
raise ValueError("n must be nonnegative.")
if n==0: n1 = n+1
else: n1 = n
x,w,mu0 = c_roots(n1,mu=1)
if n==0: x,w = [],[]
hn = 4*pi * ((n==0)+1)
kn = 1.0
p = orthopoly1d(x,w,hn,kn,wfunc=lambda x: 1.0/sqrt(1-x*x/4.0),limits=(-2,2),monic=monic)
if not monic:
p._scale(2.0/p(2))
p.__dict__['_eval_func'] = lambda x: eval_chebyc(n,x)
return p
# Chebyshev of the second kind S_n(x)
def s_roots(n, mu=0):
"""[x,w] = s_roots(n)
Returns the roots (x) of the nth order Chebyshev (of the second kind)
polynomial, S_n(x), and weights (w) to use in Gaussian Quadrature
over [-2,2] with weighting function (1-(x/2)**2)**1/2.
"""
if mu:
[x,w,mu0] = j_roots(n,0.5,0.5,mu=1)
return [x*2,w,mu0]
else:
[x,w] = j_roots(n,0.5,0.5,mu=0)
return [x*2,w]
def chebys(n, monic=0):
"""Return nth order Chebyshev polynomial of second kind, Sn(x). Orthogonal
over [-2,2] with weight function (1-(x/)**2)**(1/2).
"""
if n < 0:
raise ValueError("n must be nonnegative.")
if n==0: n1 = n+1
else: n1 = n
x,w,mu0 = s_roots(n1,mu=1)
if n==0: x,w = [],[]
hn = pi
kn = 1.0
p = orthopoly1d(x,w,hn,kn,wfunc=lambda x: sqrt(1-x*x/4.0),limits=(-2,2),monic=monic)
if not monic:
factor = (n+1.0)/p(2)
p._scale(factor)
p.__dict__['_eval_func'] = lambda x: eval_chebys(n,x)
return p
# Shifted Chebyshev of the first kind T^*_n(x)
def ts_roots(n, mu=0):
"""[x,w] = ts_roots(n)
Returns the roots (x) of the nth order shifted Chebyshev (of the first kind)
polynomial, T^*_n(x), and weights (w) to use in Gaussian Quadrature
over [0,1] with weighting function (x-x**2)**(-1/2).
"""
return js_roots(n,0.0,0.5,mu=mu)
def sh_chebyt(n, monic=0):
"""Return nth order shifted Chebyshev polynomial of first kind, Tn(x).
Orthogonal over [0,1] with weight function (x-x**2)**(-1/2).
"""
base = sh_jacobi(n,0.0,0.5,monic=monic)
if monic:
return base
if n > 0:
factor = 4**n / 2.0
else:
factor = 1.0
base._scale(factor)
return base
# Shifted Chebyshev of the second kind U^*_n(x)
def us_roots(n, mu=0):
"""[x,w] = us_roots(n)
Returns the roots (x) of the nth order shifted Chebyshev (of the second kind)
polynomial, U^*_n(x), and weights (w) to use in Gaussian Quadrature
over [0,1] with weighting function (x-x**2)**1/2.
"""
return js_roots(n,2.0,1.5,mu=mu)
def sh_chebyu(n, monic=0):
"""Return nth order shifted Chebyshev polynomial of second kind, Un(x).
Orthogonal over [0,1] with weight function (x-x**2)**(1/2).
"""
base = sh_jacobi(n,2.0,1.5,monic=monic)
if monic: return base
factor = 4**n
base._scale(factor)
return base
# Legendre
def p_roots(n, mu=0):
"""[x,w] = p_roots(n)
Returns the roots (x) of the nth order Legendre polynomial, P_n(x),
and weights (w) to use in Gaussian Quadrature over [-1,1] with weighting
function 1.
"""
return j_roots(n,0.0,0.0,mu=mu)
def legendre(n, monic=0):
"""Returns the nth order Legendre polynomial, P_n(x), orthogonal over
[-1,1] with weight function 1.
"""
if n < 0:
raise ValueError("n must be nonnegative.")
if n==0: n1 = n+1
else: n1 = n
x,w,mu0 = p_roots(n1,mu=1)
if n==0: x,w = [],[]
hn = 2.0/(2*n+1)
kn = _gam(2*n+1)/_gam(n+1)**2 / 2.0**n
p = orthopoly1d(x,w,hn,kn,wfunc=lambda x: 1.0,limits=(-1,1),monic=monic,
eval_func=lambda x: eval_legendre(n,x))
return p
# Shifted Legendre P^*_n(x)
def ps_roots(n, mu=0):
"""[x,w] = ps_roots(n)
Returns the roots (x) of the nth order shifted Legendre polynomial, P^*_n(x),
and weights (w) to use in Gaussian Quadrature over [0,1] with weighting
function 1.
"""
return js_roots(n,1.0,1.0,mu=mu)
def sh_legendre(n, monic=0):
"""Returns the nth order shifted Legendre polynomial, P^*_n(x), orthogonal
over [0,1] with weighting function 1.
"""
if n < 0:
raise ValueError("n must be nonnegative.")
wfunc = lambda x: 0.0*x + 1.0
if n==0: return orthopoly1d([],[],1.0,1.0,wfunc,(0,1),monic,
lambda x: eval_sh_legendre(n,x))
x,w,mu0 = ps_roots(n,mu=1)
hn = 1.0/(2*n+1.0)
kn = _gam(2*n+1)/_gam(n+1)**2
p = orthopoly1d(x,w,hn,kn,wfunc,limits=(0,1),monic=monic,
eval_func=lambda x: eval_sh_legendre(n,x))
return p
#------------------------------------------------------------------------------
# Vectorized functions for evaluation
#------------------------------------------------------------------------------
from ._ufuncs import \
binom, eval_jacobi, eval_sh_jacobi, eval_gegenbauer, eval_chebyt, \
eval_chebyu, eval_chebys, eval_chebyc, eval_sh_chebyt, eval_sh_chebyu, \
eval_legendre, eval_sh_legendre, eval_genlaguerre, eval_laguerre, \
eval_hermite, eval_hermitenorm