Computational Techniques Based on the Lanczos Representation
From MaRDI portal
Publication:3215723
DOI10.2307/2005818zbMath0271.41006OpenAlexW4253412762MaRDI QIDQ3215723
Publication date: 1974
Full work available at URL: https://doi.org/10.2307/2005818
Trigonometric approximation (42A10) Approximation by polynomials (41A10) Algorithms for approximation of functions (65D15) Euler-Maclaurin formula in numerical analysis (65B15)
Related Items (20)
A circular interpretation of the Euler-Maclaurin formula. ⋮ Running air pollution models on the connection machine ⋮ A united approach to accelerating trigonometric expansions ⋮ Asymptotic behavior of Eckhoff’s method for Fourier series convergence acceleration ⋮ Verallgemeinerte Fourier-Entwicklungen ohne Gibbs'sches Phaenomen am Rand ⋮ Finite Fourier transforms computed by a modified Filon-Euler-Maclaurin method ⋮ Multivariate Modified Fourier Expansions ⋮ Accelerating the convergence of trigonometric series ⋮ Gibbs phenomenon and its removal for a class of orthogonal expansions ⋮ On a high order numerical method for functions with singularities ⋮ Fourier tools are much more powerful than commonly thought ⋮ The calculation of trigonometric Fourier coefficients ⋮ A pseudo-spectral FFT technique for non-periodic problems ⋮ Acceleration of algebraically-converging Fourier series when the coefficients have series in powers of \(1/n\) ⋮ Convergence acceleration of modified Fourier series in one or more dimensions ⋮ Unnamed Item ⋮ Generalized sampling and the stable and accurate reconstruction of piecewise analytic functions from their Fourier coefficients ⋮ Unnamed Item ⋮ Accelerating Convergence of Eigenfunction Expansions ⋮ On the Convergence of the Quasi-Periodic Approximations on a Finite Interval
Uses Software
Cites Work
This page was built for publication: Computational Techniques Based on the Lanczos Representation
