Top

Calcolo

Published in:

01-09-2019

Conditioning of polynomial Fourier sums

Authors: J. M. Carnicer, Y. Khiar, J. M. Peña

Published in: Calcolo | Issue 3/2019

Activate our intelligent search to find suitable subject content or patents.

search-config

AI-assisted search

Off

Abstract

In order to measure the stability properties of Fourier sums, we introduce a conditioning of a representation of the solution of the least squares problem. We relate the conditioning of the discrete polynomial Fourier sums with the corresponding continuous one. We study the asymptotic growth of the conditioning in terms of the degree n. For Fourier–Legendre sums, it is \(O(n^{3/2})\). In the case of Fourier–Chebyshev sums, it is linear in the degree. For Fourier sums with Chebyshev polynomials of the second kind, it is \(O(n^2)\).

previous article Optimal interpolation formulas in the space

next article Semi-implicit Milstein approximation scheme for non-colliding particle systems

Abramowitz, M., Stegun, I.: Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables, vol. 55. National Bureau of Standards Applied Mathematics Series, Washington (1972)MATH

Beals, R., Wong, R.: Special Functions and Orthogonal Polynomials. Cambridge University Press, Cambridge (2016)CrossRef

Carnicer, J.M., Khiar, Y., Peña, J.M.: Optimal stability of the Lagrange formula and conditioning of the Newton formula. J. Approx. Theory 238, 52–66 (2019)MathSciNetCrossRef

Cheney, E.W.: Introduction to Approximation Theory, 2nd edn. AMS Chelsea Publishing, Providence (1982)MATH

Cheney, E.W., Light, W.: A Course in Approximation Theory. Brooks/Cole Publishing Company, Pacific Groove (2000)MATH

de Boor, C.: Splinefunktionen. Birkhäuser, Basel (1990)CrossRef

Faber, G.: Über die interpolatorische Darstellung stetiger Funktionen. DMV 23, 192–210 (1914)MATH

Lebesgue, H.: Sur les intégrales singulières. Ann. Fac. Sci. Toulouse Sci. Math. Sci. Phys. 1, 25–117 (1909)MathSciNetMATH

Nikolaev, V.F.: Concerning the approximation of continuous functions by polynomials. Doklady Akad. Nauk SSSR 61, 201–204 (1948)MathSciNet

10.

Rivlin, T.J.: Chebyshev Polynomials. From Approximation Theory to Algebra and Number Theory, Pure and Applied Mathematics (New York). Wiley, New York (1990)

11.

Rudin, W.: Real and Complex Analysis. Mac Graw-Hill, London (1970)MATH

Title: Conditioning of polynomial Fourier sums
Authors: J. M. Carnicer
Y. Khiar
J. M. Peña
Publication date: 01-09-2019
Publisher: Springer International Publishing
Published in: Calcolo / Issue 3/2019
Print ISSN: 0008-0624
Electronic ISSN: 1126-5434
DOI: https://doi.org/10.1007/s10092-019-0323-6

Springer Professional

Conditioning of polynomial Fourier sums

Abstract

Premium Partner

Springer Professional

Abstract

Please log in to get access to your license.

Other articles of this Issue 3/2019

Convergence rate of the finite element approximation for extremizers of Sobolev inequalities on 2D convex domains

Semi-implicit Milstein approximation scheme for non-colliding particle systems

A posteriori error estimates for the monodomain model in cardiac electrophysiology

Optimal interpolation formulas in the space

A Riemann solution approximation based on the zero diffusion–dispersion limit of Dafermos reformulation type problem

On Krylov solutions to infinite-dimensional inverse linear problems

Premium Partner