Approximation error in regularized SVD-based Fourier continuations (Q1760113)

From MaRDI portal

Revision as of 21:22, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Approximation error in regularized SVD-based Fourier continuations	scientific article

Statements

scholarly article

0 references

Approximation error in regularized SVD-based Fourier continuations (English)

0 references

zbMATH Open document ID

0 references

10.1016/j.apnum.2012.06.032

0 references

0 references

Applied Numerical Mathematics

0 references

publication date

12 November 2012

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

Fourier series

0 references

Fourier continuation

0 references

Fourier extension

0 references

numerical examples

0 references

convergence

0 references

singular value decomposition

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.apnum.2012.06.032

0 references

0 references

On the resolution power of Fourier extensions for oscillatory functions

0 references

On the numerical stability of Fourier extensions

0 references

A spectral FC solver for the compressible Navier-Stokes equations in general domains. I: Explicit time-stepping

0 references

A comparison of numerical algorithms for Fourier extension of the first, second, and third kinds

0 references

0 references

0 references

Accurate, high-order representation of complex three-dimensional surfaces via Fourier continuation analysis

0 references

High-order unconditionally stable FC-AD solvers for general smooth domains. I: Basic elements

0 references

Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information

0 references

Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?

0 references

0 references

Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix

0 references

Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition

0 references

A Padé-based algorithm for overcoming the Gibbs phenomenon

0 references

Fitting a \(C^m\)-smooth function to data. III.

0 references

Whitney’s extension problems and interpolation of data

0 references

Fast monte-carlo algorithms for finding low-rank approximations

0 references

Rational trigonometric approximations using Fourier series partial sums

0 references

Robust reprojection methods for the resolution of the Gibbs phenomenon

0 references

On the Gibbs phenomenon. I: Recovering exponential accuracy from the Fourier partial sum of a nonperiodic analytic function

0 references

Extension of the range of a differentiable function

0 references

On the Fourier Extension of Nonperiodic Functions

0 references

Randomized algorithms for the low-rank approximation of matrices

0 references

A Fast Algorithm for Fourier Continuation

0 references

High-order unconditionally stable FC-AD solvers for general smooth domains. II: Elliptic, parabolic and hyperbolic PDEs; theoretical considerations

0 references

Impossibility of Fast Stable Approximation of Analytic Functions from Equispaced Samples

0 references

Optimal filter and mollifier for piecewise smooth spectral data

0 references

0 references

A fast randomized algorithm for the approximation of matrices

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1760113

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1760113&oldid=35306939"