View on GitHub

memo

Gausiaan Quadrature

Gausiaan Quadrature

Assumption

(1)k=0,1,,μk:=abxkω(x) dx<0. abω(x)s(x) dx=0s(x)0.
(2)I(f):=abω(x)f(x) dx, (3)I~(f):=i=1nwif(xi). Π¯j:={pp(x)=xj+a1xj1++aj,akR}Πj:={pdegree(p)j}. (f,g):=abω(x)f(x)g(x) dx(4)(f,f)=abω(x)f(x)2 dx.

Let h be function.

(hf,g)=abω(x)h(x)f(x)g(x) dx=abω(x)f(x)h(x)g(x) dx=(f,hg).

Theorem 3.6.3

There exists pjΠ¯j for j=0,1,, such that

(5)ik, (pi,pk)=0.

These polynomials are uniquely defined by the recursions

(6)p0(x)1(7)pi+1(x)=(xδi+1)pi(x)γi+12pi1(x) i0,δi+1=(xpi,pi)(pi,pi)i0,(8)γi+12={1i=0(pi,pi)(pi1,pi1)i1.

proof

We prove by induction. If i=0, the statements are true. Let us assume that the statments holds true up to ji. We’ll show there exists a unique polynomials pi+1Π¯i+1 with

(9)(pi+1,pj)=0 ji.

Let pi+1Π¯i+1. There exist constants δ,c0,,ci1 such that

pi+1(x)=xpi(x)δpi(x)+k=0i1ckpk(x).

We have

(10)(pi+1,pj)=(xpi,pj)δ(pi,pj)+k=0i1ck(pk,pj).

The constants must satisfy

(11)(pi+1,pi)=(xpi,pj)δ(pi,pj)=0(12)j<i, (pi+1,pj)=(xpi,pj)+cj(pj,pj)=0.

From (???), (pk,pk)0. In fact, suppose that (pk,pk)=0.

(13)ji, (pj,pj)=abω(x)pj2(x) dx=0.

Hence pj0. This contradicts to the assumption of the induction.

The euqation (11) can be solved uniquely

δ=(xpi,pi)(pi,pi).

By the induction hypothesis, for j<i,

pj(x)=(xδj)pj1(x)γj2pj2(x)(14)xpj1(x)=pj(x)+γj2pj2(x)+δjpj1(x) cj=(xpj,pi)(pj,pj)=(pj+1,pi)+γj+12(pj1,pi)+δj+1(pj,pi)(pj,pj)=(pj+1,pi)(pj,pj)={0(j<i1)(pj,pi)(pj,pj)(j=i1).

Corollary 3.6.9

(p,pn)=0pΠn1.

proof

Since pjΠj for all j, p is representable as a linear combination of the polynomials.

Theorem 3.6.10

The roots are real and simple. xi(a,b).

proof

Assume that a<x1,,xl<b are distinct roots of pn and l<n. Let

q(x):=j=1l(xxj)Π¯l.

Apparently, qpn0. That implies

0=(pn,q)(l<n and Theorem 3.6.3)

On the other hands,

(pn,q)=abω(x)pn(x)q(x) dx(15)0(Assumption (c)).

Theorem 3.6.11

A:=(p0(t1)p0(tn)pn1(t1)pn1(tn)).

A is nonsingular.

proof

Assume that A is singular. There exists a vector cT=(c0,,cn1)0 such that

cTA=0.

Let

q(x):=i=0n1cipi(x).

Since

cTA=(i=0n1cipi(t1),,i=0n1cipi(t1))=(q(t1),q(tn))=(0,,0),

t1,,tn are distinct roots of q. Since degree(pi)<n for all i=0,,n1, degree(q)<n. Thus, q0. However, {pi} is linearly independet, so ci=0 for all i.

Definition Haar condition

{pi} is said to satisfy Haar condition if for all distincts t1,,tn,

(p0(t1)p0(tn)pn1(t1)pn1(tn))

is nonsingular. Such {pi} is said to be Chebychev system.

Theorem 3.6.12

(a)

(16)(p0(x1)p0(xn)pn1(x1)pn1(xn))w=((p0,p0)00)

Then wi>0 for all i=1,,n and for all pΠ2n1

(17)abω(x)p(x) dx=i=1nwip(xi).

(b)

Conversely, if wi,xi satisfy (17), then xi are the roots of pn and the weights wi satisfy (16).

(c)

There is no xi,wi,i=1,,n such that (17) holds for all pΠ2n.

proof

(a)

By Theorem 3.6.10, the roots xi,i=1,,n of pn are real and mutually distinct numbers in (a,b). The matrix

(18)A:=(p0(x1)p0(xn)pn1(x1)pn1(xn))

is nonsingular by Theorem 3.6.11. Hence (16) has a unique solution. Let p2n1. There exist q,rΠn1 such that

p(x)=pn(x)q(x)+r(x).

p,q can be written in

q(x)=k=0n1αkpk(x)(19)r(x)=k=0n1αkpk(x).

Since p01,

abω(x)p(x) dx=abω(x)(pn(x)q(x)+r(x)p0(x)) dx=(pn,q)+(r,p0)=(pn,k=0n1αkpk)+(k=0n1βkpk,p0)=β0(p0,p0).

On the other hand,

k=1nwip(xi)=i=1nwi(pn(xi)q(xi)+r(xi))=k=0n1βki=1nwipk(xi)=β0i=1nwip0(xi)=β0(p0,p0)

We claim that if wi,xi, i=1,,n are such that (17) holds for all pΠ2n1, then wi>0 for i=1,,n. Let

p¯j(x):=h=1,hjn(xxh)2Π2n2, (j=1,,n).

Since p¯j0, we have by assumption (c),

0<abw(x)p¯j(x) dx=i=1nwip¯j(xi)=wjh=1,hjn(xjxj)2.

Thus, wj>0.

(c)

Assume that wi,xi,i=1,,n satisfy (17) for all pΠ2n. Let

p¯(x):=j=1n(xxj)2Π2n. 0<abω(x)p¯(x) dx(Assumption (c))=i=1nwip¯(xi)=0.

(b)

Suppose that wi,xi are such that (17) for all pΠ2n1. xi must be xixj ij. Indeed, let us assume xn1=xn.

p(x):=i=1n1(xxi)2Π2n1.

Hence this contradicts

0<abω(x)p(x) dx=i=1nwip(xi)=0.

For all k=0,,n1,

i=1nwipk(xi)=abω(x)pk(x) dx=(pk,p0)={(p0,p0)k=001kn1.

Thus, wi satisfy (16).

Next we will show xi are roots of pn. Applying (17) we will have

0=(pk,pn)(orthonormal)=abω(x)pk(x)pn(x) dx(20)=i=1nwipk(xi)pn(x)((17)).

In other word,

A(w1pn(x1)wnpn(xn))=0.

By theorem 3.6.11, A is nonsingular. Hence c=0, that is, for all i=1,,n,

wipn(xi)=0.

Since wi>0, we have pn(xi)=0.

Theorem 3.6.20

Jj:=(δ1γ20γ2δ2γ30γjδj1γj0γjδj).

Then x1,,xn are the eigenvalues of the Jn.

proof

pj(x):=det(JjxI).

Theorem 3.6.24

abω(x)f(x) dxi=1nwif(xi)=f(2n)(ξ)(2n)!(pn,pn).

proof

Type of Gaussian quadrature

Gauss-Legendre

(21)pk(x):=k!(2k)1dkdxk(x1)k, k=0,1,,.

Gauss-Chebyshev

Gauss-Laguerre

Gauss-Hermite

1σ2πh(y)exp((yμ)22σ2) dy=1σ2πh(2σx+μ)exp(x2)2σ dy(x=(yμ)/2σ2)=1πh(2σx+μ)exp(x2) dy.

Gauss-Jacobi

Gauss-Radau

Gauss-Lobatto

Gauss-Kronrod

Reference