A comparison of numerical algorithms for Fourier extension of the first, second, and third kinds (Q1601548)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1760854
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A comparison of numerical algorithms for Fourier extension of the first, second, and third kinds |
scientific article; zbMATH DE number 1760854 |
Statements
A comparison of numerical algorithms for Fourier extension of the first, second, and third kinds (English)
0 references
26 November 2002
0 references
The author compares in a fairly suggestive way several methods which work when one tries to extend a given nonperiodic function to a periodic one on a larger interval. The best extension requires a singular value decomposition with iterative refinements. This achieves accuracy close to machine precision.
0 references
local Fourier basis
0 references
wavelets
0 references
pseudospectral algorithms
0 references
Fourier extension
0 references
inhomogeneous Poisson equation
0 references
homogeneous boundary value problem
0 references
singular value decomposition
0 references
iterative refinements
0 references
0 references
0 references
0.8430497646331787
0 references
0.8178085684776306
0 references
0.816320538520813
0 references
0.8150259852409363
0 references
