• Non ci sono risultati.

Polynomial interpolation and quadrature on subregions of the sphere

N/A
N/A
Protected

Academic year: 2021

Condividi "Polynomial interpolation and quadrature on subregions of the sphere"

Copied!
1
0
0

Testo completo

(1)

SIAM Conference on Mathematical and Computational Issues in the Geosciences (SIAM GS13) Padova (Italy) June 17-20 2013

Polynomial interpolation and quadrature on subregions of the sphere

M. G ENTILE a , A. S OMMARIVA b AND M. V IANELLO b

a email: gentimar@hotmail.it b Department of Mathematics, University of Padua, Italy

Abstract

Using some recent results on trigonometric interpolation and quadrature on subintervals of the period, we present a rule for numerical integration over some regions of the sphere, that include spherical caps and zones.

The rule has positive weights and is exact for all spherical polynomials of degree less or equal than n.

We also construct Weakly Admissible Meshes and approxi- mate Fekete points for polynomial interpolation on such re- gions of the sphere.

All the algorithms have been implemented in Matlab.

Weakly Admissible Meshes

WAM [4]: sequence of discrete subsets A n ⊂ K, with K com- pact set or manifold in R d , with the polynomial inequality

kpk K ≤ C(A n )kpk A

n

, ∀p ∈ P d n (K), dim(P d n (K)) = N where card( A n ) ≥ N and C(A n ) grow polynomially with n;

when C( A n ) ≡ C we have an Admissible Mesh (AM) Some properties:

• unisolvent interpolation sets with polynomially growing Lebesgue constant are WAMs with C( A n ) = Λ n

• finite unions or products of (W)AMs are (W)AMs

Approximate Fekete Points

K ⊂ R d compact set or manifold, p = {p j } 1≤j≤N polynomial basis,

ξ = {ξ 1 , . . . , ξ N } ⊂ K interpolation points

V (ξ, p) = [p j (ξ i )] Vandermonde matrix, det(V ) 6= 0 Π n f (x) = P N

j=1 f (ξ j ) ℓ j (x) determinantal Lagrange formula ℓ j (x) = det(V (ξ 1 , . . . , ξ j−1 , x, ξ j+1 , . . . , ξ N ))

det(V (ξ 1 , . . . , ξ j−1 , ξ j , ξ j+1 , . . . , ξ N )) , ℓ j (ξ i ) = δ ij

Fekete points: |det(V (ξ 1 , . . . , ξ N ))| is max in K N

=⇒ Lebesgue constant = Λ n = max

x∈K N

X

j=1

|ℓ j (x)| ≤ N

Fekete points are analytically known only in a few cases [3]:

interval, complex circle, cube (for tensor-product interpola- tion)

• IDEA: extract Fekete points from a discretization of K:

Approximate Fekete Points!

• Fekete points extracted from a WAM have a Lebesgue constant Λ n ≤ NC(A n ) (but often much smaller!)

• It is possible to extract Approximate Fekete points with simple instruments of numerical linear algebra [1]

Subperiodic Trigonometric Formulas

T n ([−ω, ω]) := span{1, cos(kθ), sin(kθ), 1 ≤ k ≤ n, θ ∈ [−ω, ω]}

Trigonometric interpolation Let ξ j = cos  (2j−1)π

2(2n+1)

 ∈ (−1, 1), j = 1, 2, . . . , 2n + 1 zeros of T 2n+1 , then the zeros of T 2n+1 (sin(θ/2)/ sin(ω/2))

θ j = 2 arcsin(sin(ω/2)ξ j ) ∈ (−ω, ω), j = 1, 2, . . . , 2n + 1 are unisolvent for interpolation in T n ([−ω, ω]) [2]

with Λ n = O(log(n)) [6]

(they are a trigonometric WAM) Gaussian quadrature

Let w : ( −ω, ω) → R symmetric weight function

j , λ j } j=1,...,n+1 nodes and weights of an algebraic gaussian rule relatively to the symmetric weight function

s(x) := w(2 arcsin(sin(ω/2)x)) · 2 sin(ω/2)

p1 − sin 2 (ω/2)x 2 , x ∈ (−1, 1) Then [5], [7]

Z ω

−ω

f (θ)w(θ)dθ =

n+1

X

j=1

λ j f (θ j ), f ∈ T n ([−ω, ω])

where θ j := 2 arcsin(sin(ω/2)ξ j ) ∈ (−ω, ω), j = 1, 2, . . . , n + 1

Regions of interests R

P n (S 2 ) := {p(x) ∈ P n (R 3 ) | x ∈ S 2 } Spherical Coordinates

φ ∈ [0, 2π]

θ ∈ [0, π]

x 1 = cos(φ) sin(θ) x 2 = sin(φ) sin(θ) x 3 = cos(θ)

Geographic Rectangle

(in colatitude and longitude)

R γ

s

f

s

f

= R = {x ∈ S 2 : τ s ≤ θ ≤ τ f , γ s ≤ φ ≤ γ f }

special cases: spherical caps, zones, slices

Algebraic Quadrature

T HEOREM 1 Let

• p ∈ P n (R), R ⊂ S 2

• {λ h , θ h }, {λ j , φ j } weights and angular nodes of subperiodic Gaussian quadrature

degree respectively n + 1 and n weight function w := 1 intervals [τ s , τ f ] and [γ s , γ f ]

• points with spherical coordinates ξ h,j := ξ(θ h , φ j ) Then the quadrature formula:

Q R ,n (p) :=

n+2

X

h=1 n+1

X

j=1

λ h,j p(ξ h,j )

with (n + 1) × (n + 2) = n 2 + O(n) nodes and where the weights are defined as

λ h,j := λ h λ j sin(θ h ) has algebraic degree of precision n

F IGURE 1. Algebraic degree of precision N = 15 (272 nodes) on the left and N = 35 (1332 nodes) on the right.

Particular Cases

In some particular cases, thanks to some symmetries of the domain, we are able to halve the number of nodes

Caps

if n odd: (n + 1) × (n + 1)/2 = n 2 /2 + O(n) nodes if n even: (n + 1) × (n + 2)/2 − (n/2) = n 2 /2 + O(n) nodes Zones

if n odd: (n + 1) × (n + 1)/2 = n 2 /2 + O(n) nodes if n even: (n + 2) × (n + 2)/2 = n 2 /2 + O(n) nodes

F IGURE 2. Cap and Zone with algebraic degree of precision even N = 14 with respectively 113 and 128 nodes.

Quadrature tests

R = {x ∈ S

2

: π/6 ≤ θ ≤ π/3, 0 ≤ φ ≤ π/2}

f

1

(x) = exp (−x

2

− 100 y

2

− 0.5 z

2

), f

2

(x) = sin (−x

2

− 100 y

2

− 0.5 z

2

), f

3

(x) = max(1/4 − ((x − 1/ √

5)

2

+ (y − 2/ √

5)

2

+ (z − 2/ √ 5)

2

), 0))

3

Deg. f

1

f

2

f

3

5 1.50e − 02 1.57e + 00 2.49e − 02 15 4.10e − 07 1.09e − 01 2.23e − 04 35 1.56e − 15 5.50e − 04 1.28e − 05 50 9.36e − 16 2.83e − 11 3.01e − 07

T ABLE 1. Relative errors for degrees 5, . . . , 50, w.r.t. some test functions.

Interpolation

First Step: Construction of a WAM T HEOREM 2 The following grid of points

S n := (φ j , θ k ) j=1,...,2n+1, k=1,...,2n+1 =

 2 arcsin



sin  (γ f − γ s )/2 2



cos  (2j − 1)π 2(2n + 1)



+ γ s + γ f

2



j

×

 2 arcsin



sin  (τ f − τ s )/2 2



cos  (2k − 1)π 2(2n + 1)



+ τ s + τ f

2



k

is a WAM on R with cardinality (2n + 1) 2 = 4n 2 + O(n) and constant C( S n ) = O(log 2 (n))

Second Step: Extract from the WAM the Approximate Fekete Points

F IGURE 4. Points of a WAM of degree 5 (121 points) and the correspond- ing Approximate Fekete Points (36 points).

Interpolation over a Cap

As in the quadrature, also here we have some symmetries that let us halve the number of WAM’s points

Caps

card(S n ): (2n + 1) × (n + 1) − n = 2n 2 + O(n) points C(S n ) = O(log 2 (n))

F IGURE 5. Points of a WAM of degree 7 (113 points) and the related Ap- proximate Fekete Points (64 points).

Numerical Experiments over a Cap

R = {x ∈ S

2

: 0 ≤ θ ≤ π/3, 0 ≤ φ ≤ 2π}

Deg. WAM Card AFP Card Λ

(AF P )n

5 61 36 9.9

10 221 121 27.5

15 481 256 51.1

20 841 441 103.7

25 1301 676 191.3

30 1861 961 314.1

T ABLE 2. WAM and AFP cardinality, and Lebesgue constants Λ

(AF P )n

of extracted pointset for degrees 5, 10, . . . , 30.

References

[1] L. B OS , S. D E M ARCHI , A. S OMMARIVA AND M. V IANELLO , Computing mul- tivariate Fekete and Leja points by numerical linear algebra, SIAM J. Numer. Anal.

48 (2010), 1984–1999.

[2] L. B OS AND M. V IANELLO , Subperiodic trigonometric interpolation and quadra- ture, Appl. Math. Comput. 218 (2012), 10630–10638.

[3] M. B RIANI , A. S OMMARIVA AND M. V IANELLO , Computing Fekete and Lebesgue points: simplex, square, disk, J. Comput. Appl. Math. 236 (2012), 2477–

2486.

[4] J.P. C ALVI AND N. L EVENBERG , Uniform approximation by discrete least squares polynomials, J. Approx. Theory 152 (2008).

[5] G. D A F IES AND M. V IANELLO , Trigonometric Gaussian quadrature on subinter- vals of the period, Electron. Trans. Numer. Anal. 39 (2012), 102–112.

[6] G. D A F IES AND M. V IANELLO , On the Lebesgue constant of subperiodic trigono- metric interpolation, J. Approx. Theory 167 (2013), 59–64.

[7] M. G ENTILE , A. S OMMARIVA AND M. V IANELLO , Polynomial approximation and quadrature on geographic rectangles, in preparation.

[8] K. H ESSE AND R. S. W OMERSLEY , Numerical integration with polynomial exact- ness over a spherical cap, Adv. Comput. Math. 36 (2012), 451–483.

[9] I. H. S LOAN AND R. S. W OMERSLEY , Constructive Polynomial Approximation

on the Sphere, J. Approx. Theory 103 (2000), 91–118.

Riferimenti

Documenti correlati

The Padua points are the first known example of optimal points for total degree polynomial interpolation in two variables, with a Lebesgue constant increasing like log 2 of the

Moreover, similarly to the one-dimensional case, they generate a (nontensorial) Clenshaw-Curtis-like quadrature formula that turns out to be competitive with the

The Padua points, recently studied during an international collaboration at the University of Padua, are the first known example of near-optimal point set for bivariate polynomial

We study theoretically and numerically trigonometric interpolation on symmetric subintervals of [−π, π], based on a family of Chebyshev- like angular nodes (subperiodic

Find the coefficients of the polynomial interpolating x = (−2, 1, 3) and y = (−2, 11, 17) via the polyfit command on a script named. Esercizio2 and

We provide an algorithm that computes algebraic quadrature formulas with cardinality not exceeding the dimension of the exactness polynomial space, on the intersection of any number

reduce the number of integration points required for the polyhedral quadrature

Using some recent results on subperiodic trigonometric interpolation and quadra- ture, and the theory of admissible meshes for multivariate polynomial approxima- tion, we study