• Aucun résultat trouvé

On a generalization of the Lebesgue's constant

N/A
N/A
Protected

Academic year: 2021

Partager "On a generalization of the Lebesgue's constant"

Copied!
7
0
0

Texte intégral

(1)

HAL Id: hal-02946321

https://hal.archives-ouvertes.fr/hal-02946321

Submitted on 8 Oct 2020

HAL is a multi-disciplinary open access

archive for the deposit and dissemination of

sci-entific research documents, whether they are

pub-lished or not. The documents may come from

teaching and research institutions in France or

abroad, or from public or private research centers.

L’archive ouverte pluridisciplinaire HAL, est

destinée au dépôt et à la diffusion de documents

scientifiques de niveau recherche, publiés ou non,

émanant des établissements d’enseignement et de

recherche français ou étrangers, des laboratoires

publics ou privés.

On a generalization of the Lebesgue’s constant

Ana Alonso Rodríguez, Francesca Rapetti

To cite this version:

Ana Alonso Rodríguez, Francesca Rapetti. On a generalization of the Lebesgue’s constant. Journal

of Computational Physics, Elsevier, 2020, �10.1016/j.jcp.2020.109964�. �hal-02946321�

(2)

On a generalization of the Lebesgue’s constant

?

Ana Alonso Rodr´ıgueza, Francesca Rapettib

aDip. di Matematica, Universit`a degli Studi di Trento, 38123 Localit`a Povo, Trento, Italy bUniversit´e Cˆote d’Azur, Inria, CNRS, LJAD, Parc Valrose, 06108 Nice Cedex 02, France

Abstract

In this work we generalize the definition of the Lebesgue’s constant to the case of field interpolation by high-order Whitney’s forms on simplices. We underline the important theoretical concepts at play.

Keywords: High-order Whitney’s forms, weights on subsimplices, Lebesgue’s constant, Vandermonde’s matrix

2020 MSC: 65N30, 65D05

1. Introduction

The polynomial interpolation of a field f over a domain Ω ⊂ Rd, d ≥ 1, consists in the construction of a polynomial of degree r ≥ 0 which has a finite number of degrees of freedom (dofs) concident with those of f . This problem is a classical topic in approximation theory and matters because the high quality

5

polynomial interpolation of fields plays an essential role in finite elements (FEs). Standard dofs for the interpolation of a scalar field f in Ω are the values of f at some chosen nodes in the domain and the quality of this approximaton is evaluated on the basis of the well-known Lebesgue’s constant associated with the set of nodes (see, e.g, [5], [7]). In many areas of physics, FEs should be able

10

to represent vector fields from a finite number of physical coefficients, the nature of which, fluxes, circulations, etc., associate them with geometric mesh objects other than nodes [4]. In electromagnetism, for example, fields are invisible and forces act without contact. The perturbations, caused to the surrounding by the presence of the field, are observed via quantities, such as electromotive forces,

15

intensities, etc., which correspond to weights on manifolds, namely line integrals (circulations), surface integrals (fluxes), etc., other than simply pointwise eval-uations. The entity of physical significance is thus the k-form, i.e. the mapping curve→circulation (k = 1), surface→flux (k = 2), etc., and not the field itself, i.e. the electric field, the magnetic induction, etc., as a vector. The form w

20

?Finantial support from French MathIT program ANR-15-IDEX-01 and Italian PRIN’17

project NA-FROM-PDEs.

Email addresses: ana.alonso@unitn.it (Ana Alonso Rodr´ıguez), Francesca.Rapetti@univ-cotedazur.fr (Francesca Rapetti)

(3)

models the field; manifolds S are probes that one locates in Ω to measure the field. The value of the mesure,RSw, is the weight of the form w on the mani-fold S. In FEs, these weights can be considered as dofs. They reflect the nature (and, if properly chosen, global regularity properties) of the field they represent and are the right objects to produce accurate high-order interpolation formulae.

25

They are the key to extend the concepts of Lebesgue’s function and constant to the interpolation of any field over a domain Ω. This generalization is a novelty, resulting from adopting in FEs a point of view typical of differential geometry, thus weights as dofs.

2. The classical framework

30

Let T be a d-simplex of Rd, Pr(T ) the space of polynomials of degree r in T and Nr = (d+rd ) = dim(Pr(T )). Given Xr(T ) = {x1, ..., xNr}, a set of

Nr distinct nodes in T , the Lagrange interpolation problem for a given scalar function f ∈ C0(T ) consists in finding a polynomial Irf ∈ Pr(T ), such that

Irf (xi) = f (xi), ∀ i = 1, ..., Nr. (1) Chosen a basis B = {ψj}Nr

j=1 for the space Pr(T ), the interpolation problem is

35

well-defined if the Nr× Nrgeneralized Vandermonde matrix VB,Xr with entries (VXr,B)ij = ψj(xi), i, j = 1, ..., Nr, is invertible. The name of Vandermonde

matrix is given to VXr,B in recognition of the fact that, for d = 1, if the

cho-sen basis is the canonical one {xj−1}Nr

j=1, then det (VXr,B) coincides with the

Vandermonde determinant Π1≤j<i≤Nr(xi− xj). The solution Irf of the

in-40

terpolation problem (1) can be written in terms of the basis functions in B as Irf (x) =PNr

j=1cjψj(x) , for x ∈ T , where the vector c = (c1, ..., cNr)

> is the solution of the linear algebraic system

VXr,Bc = f , f = (f (x1), ..., f (xNr))

>. (2) Inverting the matrix VXr,B is necessary to compute the dual basis {φ

Xr

j } Nr

j=1⊂ Pr(T ) such that φXr

j (xi) = δij, for 1 ≤ i, j ≤ Nr, being δ.. the Kronecker’s

45

symbol. The set of points Xr(T ) = {x1, ..., xNr} is called unisolvent for the space Pr(T ) if the Lagrange interpolation problem (1) is well-defined, namely if for a given basis B of Pr(T ) the Vadermonde matrix VXr,B is invertible.

Definition 1. Given a d-simplex T and a set Xr(T ) of Nr points in T , uni-solvent for the space Pr(T ), the Lebesgue’s function LXr : T → R+ is defined

50 as LXr(x) = Nr X j=1 |φXr j (x)| with {φXr j } Nr

j=1⊂ Pr(T ) the Lagrange basis associated with Xr(T ). The Lebesgue’s constant in T is denoted by ΛXr(T ) and defined as the maximum of the Lebesgue’s function LXr(·) over T , namely

ΛXr(T ) = kLXrkC0(T ):= max

x∈T |LXr(x)| . 2

(4)

To ensure the stability of the interpolating problem when increasing the

55

polynomial degree, it is crucial to keep under control the growth of ΛXr(T ) with respect to r. The Lebesgue’s constant appears in the comparison between the interpolation error ||f − Irf ||C0(T ) in the maximum norm and the best-fit

error ||f − fr∗||C0(T ) in the same norm. Indeed, for any function f ∈ C0(T ), we

have

60

||f − Irf ||C0(T )≤ (1 + ΛXr)||f − fr∗||C0(T ) (3)

where fr∗ is the best-fit polynomial of degree r of the function f with re-spect to the maximum norm in T , namely, fr∗ ∈ Pr(T ) and kf − f∗

rkC0(T )

kf − pkC0(T ) for all p ∈ Pr(T ), so ||f − fr∗||C0(T ) = infp∈Pr(T )||f − p||C0(T ) =

infp∈Pr(T )maxx∈T|f (x) − p(x)|. The magnitude of the Lebesgue’s constant ΛXr(T ) depends heavily on the distribution of the points xi ∈ X [7]. In the 65

bound (3), the growth of the Lebesgue’s constant ΛXr determines the

con-vergence in the maximum norm. Indeed, we have the indeterminate form limr→+∞((1 + ΛXr)||f − f

r||C0(T )) = ∞ · 0. If ΛXr grows faster in r than

the best-fit error dies away, convergence in r is impossible to attain. The inde-termination is solved when it grows up slowly with respect to the interpolation

70

degree r, that is for example when it satisfies the condition limr→+∞Λ 1/r Xr = 1,

as proved in [3]. Moreover, the inequality (3) suggests that, when the Lebesgue’s constant does not grow too fast, we can find an approximation of a function f on T that is almost as good as the best-fit fr∗, by just taking the polynomial interpolant Irf , which is generally much easier to compute than fr∗.

75

3. Whitney’s forms

For any integer k, with 0 ≤ k ≤ d a k-simplex σ is the convex hull of k + 1 linear independent vectors or vertices in Rd, with orientation induced by the ordering of the vertices σ = [n0, . . . , nk]. The mass |σ|0 of a k-simplex σ is its k-dimensional Hausdorff’s measure. (In particular the mass of any 0-simplex

80

is 1.) A simplicial k-chain c is a formal (finite) sum of k-simplices with real coefficients. The mass |c|0 of a simplicial chain c = PIi=1aiσi is defined as |c|0 = PIi=1|ai||σi|0. We denote by Ck (resp. Ck(T )) the space of simplicial k-chains in Rn (resp. supported in T ).

We denote ∆k(T ) the set of k-subsimplices of T . If d = 3 then ∆0(T ) is

85

the set of the four vertices of T , ∆1(T ) of its edges, ∆2(T ) of its faces, and ∆3(T ) ≡ T . Note that we will consider also other k-simplices supported in T .

Whitney’s k-forms of degree one [9] are associated with the k-subsimplices of T . For each n ∈ ∆0(T ) the Whitney’s 0-forms wn is the barycentric func-tion λn associated with n. For each σ = [n0, . . . , nk] ∈ ∆k(T ) we have wσ =

90

Pk j=0(−1)

jλn

jdw

σ−nj being wσ−nj the Whitney’s (k − 1)-form associated with

the (k − 1)-subsimplex of T obtained by eliminating the vertex nj from σ, and d the exterior derivative. In particular wT = |T |−1

0 . Whitney’s k-forms are element of the dual basis for the weights on the k-subsimplices of T , namely, R

σ0wσ = δσ,σ0 for σ, σ0 ∈ ∆k(T ). Note that Whitney’s k-forms have proxies 95

(5)

Whitney’s k-forms of degree r > 1 [8] are the elements of the space Pr−λk(T ) = Span{λαws: s ∈ ∆k(T ) and α ∈ I(d, r − 1)}

being I(d, r − 1) = {(α0, ..., αd), αi ∈ N, Piαi = r − 1} and λα = λα00...λ αd

d . We denote C0Λk

(Rd) the Banach’s space of continuous k-differential forms w with bounded C0 norm: kwk

C0 < ∞ and C0Λk(T ) the space of restrictions of 100

C0Λk

(Rd) to T . The norm kwk

C0 has to be intended as the maximum norm of

the proxy of w.

4. Polynomial interpolation of forms

Given a set Xk,r= {s1, ..., sNk,r} of Nk,r= dim(P

rΛk(T )) distint k-simplices in T (not necessarily subsimplices of T ), the interpolation problem for a given

105

differential k-form w ∈ C0Λk(T ) consists in finding a Whitney’s differential k-form, Irw ∈ Pr−Λk(T ), such that

R

siIrw =

R

siw for all si ∈ Xk,r. As in

the case of Lagrange’s interpolation, chosen a basis B = {wj}Nk,r

j=1 for the space P−

rΛk(T ) the interpolation problem is well-defined if the generalized Vander-monde’s matrix VXk,r,B with entries (VXk,r,B)i,j =

R

siwj, i, j = 1, . . . , Nk,r, 110

is invertible. We say that the set Xk,r of Nk,r k-simplices supported in T is unisolvent for the space Pr−Λk

(Rn) if the interpolation problem is well-defined. With any unisolvent set Xk,r, it is possible to associated a dual basis {wXk,r

j } Nk,r

j=1 of Pr−Λk(Rn) (namely, such that

R siw

Xk,r

j = δi,j). Examples of unisolvent sets of k-simplices for the space Pr−Λk(Rn) are given in [8] and [1].

115

Definition 2. Given a set Xk,r= {s1, ..., sNk,r} of Nk,r k-simplices supported in the d-simplex T that is unisolvent for the space Pr−Λk(T ), the Lebesgue’s function LXk,r(T ): Ck(T ) → R + is defined as Lk Xk,r(c) = Nk,r X j=1 |sj|0 Z c wXjk,r with {wXk,r j } Nk,r

j=1 ⊂ Pr−Λk(T ) the dual basis associated with Xk,r. The Lebesgue’s constant is then ΛkX k,r = supc∈Ck(T ) Lk Xk,r(c) |c|0 . 120

Proposition 1. If k = 0 then Definition 2 coincides with Definition 1. Proof: To prove that ΛX0,r ≤ Λ

0

X0,r, we recall that the 0-simplices supported

in T are points x of T , |x|0 = 1, and φ X0,r j (x) = R xφ X0,r j . Being ΛX0,r = maxx∈T PN0,r j=1 |φ X0,r j (x)|, we have ΛX0,r = max x∈T 1 |x|0 N0,r X j=1 |φX0,r j (x)| = max x∈T 1 |x|0 N0,r X j=1 Z x φX0,r j 4

(6)

so 125 ΛX0,r≤ sup c∈C0(T ) 1 |c|0 N0,r X j=1 Z c φX0,r j = sup c∈C0(T ) L0 X0,r(c) |c|0 = Λ 0 X0,r,

where we have used that φX0,r

j = w X0,r

j .

On the other hand, if c =PIi=1aixi∈ C0(T ) then, taking into account that |si|0= 1 for each si∈ X0,r, one has

L0 X0,r(c) = N0,r X j=1 Z c φX0,r j = N0,r X j=1 I X i=1 aiφX0,r j (xi) ≤ N0,r X j=1 I X i=1  |ai||φX0,r j (xi)|  = I X i=1  |ai| N0,r X j=1 |φX0,r j (xi)|   ≤PIi=1|ai| maxx∈TPN0,r

j=1 |φ X0,r

j (x)| 

= |c|0ΛXr,

because for a chain c =PIi=1aixi ∈ C0(T ) one has |c|0=PIi=1|ai|. Therefore Λ0X 0,r = supc∈C0(T ) L0 X0,r(c) |c|0 ≤ ΛX0,r.  130

For any L1-differential k-form w we define kwk0 := sup σ6=0

|R

σw|

|σ|0 , where

the supremum is taken over all k-subsimplices of T . If w ∈ C0Λk(T ) then kwk0= kwkC0. (See, e.g., [6].)

Proposition 2. Let Xk,r(T ) = {s1, ..., sNk,r} be a unisolvent set of Nk,r k-simplices supported in the d-simplex T that is unisolvent for the space Pr−Λk(T ).

135

For each differential k-form w ∈ C0Λk(T ) it holds kw − Irwk0≤ (1 + ΛXk,r)kw − w

k0 (4)

where w∗ is the best-fit reconstruction of w for the given norm k · k0, namely w∗∈ P

r Λk(T ) and it verifies kw − w∗k0≤ kw − zk0 for all z ∈ Pr−Λk(T ). Proof: First we notice that Irw∗= w∗ and

kw − Irwk0≤ kw − w∗k0+ kIr(w∗− w)k0≤ (1 + kIrk0)kw − w∗k0 (5) being kIrk0:= supw∈C0Λk(T )kIr wk0 kwk0 . Recalling that Irw = PNk,r j=1  R sjw  wXjk,r 140 we have R cIrw = PNk,r j=1 R sjw R cw Xk,r j ≤ PNk,r j=1 R sjw |sj|0 |sj|0 R cw X j ≤ max1≤j≤Nk,r R sjw |sj|0 PNk,r j=1 |sj|0 R cw Xk,r j ≤ kwk0L k Xk,r(c) .

It is easy to check that kwk0= supc∈Ck

|R cw| |c|0 , so kIrwk0= sup c∈Ck R cIrw |c|0 ≤ kwk0c∈Csupk Lk Xk,r(c) |c|0 = kwk0Λ k Xk,r and kIrk0:= supw∈C0Λk(T )kIr wk0 kwk0 ≤ Λ k Xk,r. Replacing in (5) we obtain (4). 

(7)

5. Some remarks and conclusions

We have generalized the definition of the Lebesgue’s function and constant to the case of k-form interpolation in Pr−Λk, the space of ”trimmed” polynomial

145

differential forms widely used in the finite elements exterior calculus (see [2]). This extension is very natural when using the weights on subsimplices as degrees of freedom due to their clear physical meaning. For r > 1, the subsimplices have to be viewed as an enrichment of the geometrical description of the weights’ support, as if we were computing a more accurate approximation of circulations

150

(k=1), fluxes (k=2), etc.

As in the classical setting of Lagrange’s polynomial interpolation (that in fact correponds to the case k = 0), the Lebesgue’s constant is a quality indica-tor when selecting among unisolvent sets of degrees of freedom, the ones that minimize the local interpolation error in the maximum norm. Applications are

155

postponed to future works.

References

[1] Alonso Rodr´ıguez, A., Bruni Bruno, L., Rapetti, F.: Minimal sets of uni-solvent weights for high order Whitney forms on simplices. Enumath 2019 procs., LNCSE 139 (2020) in press.

160

[2] Arnold, D. N., Falk, R. S., Ragnar Winther, R.: Finite element exterior cal-culus, homological techniques, and applications. Acta Numerica, 15 (2006), 1–155.

[3] Bloom, T.: The Lebesgue constant for Lagrange interpolation in the sim-plex. Journal of the Atmospheric Sciences, 54 (1988), 338–353.

165

[4] Bossavit, A.: Computational Electromagnetism, New York, NY, USA: Aca-demic, 1998.

[5] Chung, K.C., Yao, T.H.: On lattices admitting unique Lagrange interpo-lations. SIAM J. Numer. Anal., 14, 735–743 (1977).

[6] Harrison, J.: Continuity of the integral as a function of the domain. J.

170

Geom. Anal. 8 (1998) 769–795.

[7] Pasquetti, R., Rapetti, F.: Spectral element methods on unstructured meshes: Which interpolation points ?, Numerical Algorithms, 55/2 (2010) 349–366.

[8] Rapetti, F., Bossavit, A.: Whitney forms of higher degree, SIAM J. Numer.

175

Anal., 47/3 (2009) 2369–2386.

[9] Whitney, H.: Geometric Integration Theory, Princeton, NJ, USA: Prince-ton Univ. Press, 1957.

Références

Documents relatifs

Not every asylum seeker will ultimately be recognized as a refugee, but every refugee is initially an asylum seeker (3). An irregular migrant is a person whose current

␪. 共 2 兲 can be interpreted, again, as pro- duction by mean gradients 共 the first to fourth term on the rhs 兲 , production by stretching and destruction by molecular dissipation

No calculators are to be used on this exam. Note: This examination consists of ten questions on one page. Give the first three terms only. a) What is an orthogonal matrix?

Numerous authors have derived results about the Lebesgue function and constant associated with Lagrange interpolation at various kinds of nodes; see [5, 6, 18] and the

The numerical results in Section 3 further indicate that the Lebesgue constant of Berrut’s rational in- terpolant at equidistant nodes is even smaller than the Lebesgue constant

In this work, we construct an example of this type; more precisely, by solving a quasilinear elliptic boundary-value prob- lem we define a nonlinear operator on the space of

l’utilisation d’un remède autre que le médicament, le mélange de miel et citron était le remède le plus utilisé, ce remède était efficace dans 75% des cas, le

This simple example illustrates the fact that the use of a weighted or a non weighted graph for the join count statistics can have a strong influence on the result, depending on