Best uniform rational approximation of 𝑥^{𝛼} on [0,1]

Stahl, Herbert

doi:10.1090/s0273-0979-1993-00351-3

Cited by 58 publications

(52 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Fortran 90 multiple precision package [5] was incorporated into our Fortran program realizing the Remez method. An error estimate is presented by formula (1.10); it follows from [21]. The actual distribution of the error for k = 10 is plotted in Figure 3; similarly to the Zolotarjov's error it exhibits Chebyshev alternating properties according to Proposition 3.2.…”

Section: Approximation On [0 1]mentioning

confidence: 93%

On Optimal Finite-Difference Approximation of PML

Asvadurov¹,

Druskin²,

Guddati³

et al. 2003

SIAM J. Numer. Anal.

View full text Add to dashboard Cite

Abstract.A technique derived from two related methods suggested earlier by some of the authors for optimization of finite-difference grids and absorbing boundary conditions is applied to discretization of perfectly matched layer (PML) absorbing boundary conditions for wave equations in Cartesian coordinates. We formulate simple sufficient conditions for optimality and implement them. It is found that the minimal error can be achieved using pure imaginary coordinate stretching. As such, the PML discretization is algebraically equivalent to the rational approximation of the square root on [0, 1] conventionally used for approximate absorbing boundary conditions. We present optimal solutions for two cost functions, with exponential (and exponential of the square root) rates of convergence with respect to the number of the discrete PML layers using a second order finitedifference scheme with optimal grids. Results of numerical calculations are presented.Key words. absorbing boundary conditions, exponential convergence, finite differences, hyperbolic problems, perfectly matched layers, wave propagation, optimal rational approximations AMS subject classifications. 65N06, 73C02PII. S00361429013914511. Introduction. This paper is a sequel to a number of papers on so-called optimal finite-difference grids or finite-difference Gaussian rules [11,12,3,4,18,13], where exponential superconvergence of standard second order finite-difference schemes at a priori given points was obtained due to a special grid optimization procedure. This approach was successfully applied to the approximation of many nontrivial practically important problems, including elliptic PDEs for both bounded and unbounded domains. For the latter, in [18] the optimal finite-difference grid was obtained, which can be considered as the boundary condition requiring minimal arithmetic work for a given spectral interval. For hyperbolic problems, however, optimal grids were introduced only for the approximation in the interior part of the domain. Here we consider exterior hyperbolic problems. For this kind of problem a closely related method of continued fraction boundary conditions was suggested in [16], where absorbing boundary conditions were reduced to a three-term equations resembling finite-difference relations. Combining the approaches of [18] and [16] we obtain frequency independent finite-difference discretization of Berenger's perfectly matched layer (PML) absorbing boundary conditions (ABCs) [7], which produces the minimal possible impedance error for a given number of discrete layers. Similarly to the optimal grid for the Laplace equation with a solution from a Sobolev space considered in [18], the obtained discretizations show the exponential of the square root rates of convergence, though they use only the three-point stencil for second derivatives. Our solution exhibits much smaller reflection coefficients compared to examples of optimized PMLs (for the same

show abstract

Section: Approximation On [0 1]mentioning

confidence: 93%

On Optimal Finite-Difference Approximation of PML

Asvadurov¹,

Druskin²,

Guddati³

et al. 2003

SIAM J. Numer. Anal.

View full text Add to dashboard Cite

show abstract

“…Since polynomials can never do better than O(n −1 ), this established that rational functions can be far more powerful than polynomials in certain applications, a theme implicit in a number of parts of this article. Later, Stahl found the precise asymptotic behavior [155]:…”

mentioning

confidence: 99%

The Exponentially Convergent Trapezoidal Rule

Trefethen¹,

Weideman²

2014

SIAM Rev.

462

362

View full text Add to dashboard Cite

Abstract.It is well known that the trapezoidal rule converges geometrically when applied to analytic functions on periodic intervals or the real line. The mathematics and history of this phenomenon are reviewed, and it is shown that far from being a curiosity, it is linked with computational methods all across scientific computing, including algorithms related to inverse Laplace transforms, special functions, complex analysis, rational approximation, integral equations, and the computation of functions and eigenvalues of matrices and operators.

show abstract

“…Hence, |X| ≡ 1 on ∆. Statement (19) results immediately from the symmetry of the functions R n , n = 1, 2, . .…”

Section: Proofsmentioning

confidence: 96%