Polynomial Approximation of Anisotropic Analytic Functions of Several Variables

Motivated by numerical methods for solving parametric partial differential equations, this paper studies the approximation of multivariate analytic functions by algebraic polynomials. We introduce various anisotropic model classes based on Taylor expansions, and study their approximation by finite d...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Constructive approximation Ročník 53; číslo 2; s. 319 - 348
Hlavní autoři: Bonito, Andrea, DeVore, Ronald, Guignard, Diane, Jantsch, Peter, Petrova, Guergana
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.04.2021
Springer Nature B.V
Témata:
Analysis
Analytic functions
Approximation
Budgets
Mathematics
Mathematics and Statistics
Numerical Analysis
Numerical methods
Partial differential equations
Polynomials
65N15
Anisotropic analyticity
41A58
41A63
Approximations and expansions
41A10
Parametric PDEs
ISSN:0176-4276, 1432-0940
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Motivated by numerical methods for solving parametric partial differential equations, this paper studies the approximation of multivariate analytic functions by algebraic polynomials. We introduce various anisotropic model classes based on Taylor expansions, and study their approximation by finite dimensional polynomial spaces P Λ described by lower sets Λ . Given a budget n for the dimension of P Λ , we prove that certain lower sets Λ n , with cardinality n , provide a certifiable approximation error that is in a certain sense optimal, and that these lower sets have a simple definition in terms of simplices. Our main goal is to obtain approximation results when the number of variables d is large and even infinite, and so we concentrate almost exclusively on the case d = ∞ . We also emphasize obtaining results which hold for the full range n ≥ 1 , rather than asymptotic results that only hold for n sufficiently large. In applications, one typically wants n small to comply with computational budgets.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0176-4276
1432-0940
DOI:10.1007/s00365-020-09511-4