Frames and numerical approximation. II: Generalized sampling
From MaRDI portal
Abstract: In a previous paper [Adcock & Huybrechs, 2019] we described the numerical approximation of functions using redundant sets and frames. Redundancy in the function representation offers enormous flexibility compared to using a basis, but ill-conditioning often prevents the numerical computation of best approximations. We showed that, in spite of said ill-conditioning, approximations with regularization may still provide accuracy up to order , where is a small truncation threshold. When using frames, i.e. complete systems that are generally redundant but which provide infinite representations with coefficients of bounded norm, this accuracy can actually be achieved for all functions in a space. Here, we generalize that setting in two ways. We assume information or samples from from a wide class of linear operators acting on , rather than inner products associated with the best approximation projection. This enables the analysis of fully discrete approximations based, for instance, on function values only. Next, we allow oversampling, leading to least-squares approximations. We show that this leads to much improved accuracy on the order of rather than . Overall, we demonstrate that numerical function approximation using redundant representations may lead to highly accurate approximations in spite of having to solve ill-conditioned systems of equations.
Recommendations
- Frames and numerical approximation
- Approximating the inverse frame operator from localized frames
- Generalized sampling: extension to frames and inverse and ill-posed problems
- Multivariate generalized sampling in shift-invariant spaces and its approximation properties
- Sampling and recovery of multidimensional bandlimited functions via frames
Cites work
- A fast algorithm for Fourier continuation
- A generalized sampling theorem for stable reconstructions in arbitrary bases
- A pseudo-spectral FFT technique for non-periodic problems
- A sharp-interface active penalty method for the incompressible Navier-Stokes equations
- An introduction to frames and Riesz bases
- An oversampled collocation approach of the wave based method for Helmholtz problems
- Analysis of fictitious domain approximations of hard scatterers
- Beyond consistent reconstructions: optimality and sharp bounds for generalized sampling, and application to the uniform resampling problem
- Convergence and Numerics of a Multisection Method for Scattering by Three-Dimensional Rough Surfaces
- Fast algorithms for the computation of Fourier extensions of arbitrary length
- Frames and numerical approximation
- Function approximation on arbitrary domains using Fourier extension frames
- scientific article; zbMATH DE number 1150002 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Infinite matrices and their finite sections. An introduction to the limit operator method.
- On the Fourier Extension of Nonperiodic Functions
- On the numerical stability of Fourier extensions
- On the solvability complexity index, the n-pseudospectrum and approximations of spectra of operators
- On the use of singular functions with finite element approximations
- Sampling, Marcinkiewicz-Zygmund inequalities, approximation, and quadrature rules
- Stable reconstructions in Hilbert spaces and the resolution of the Gibbs phenomenon
- The AZ algorithm for least squares systems with a known incomplete generalized inverse
- The finite element immersed boundary method with distributed Lagrange multiplier
Cited in
(27)- Efficient function approximation on general bounded domains using splines on a Cartesian grid
- CAS4DL: Christoffel adaptive sampling for function approximation via deep learning
- Convergence analysis of oversampled collocation boundary element methods in 2D
- An analysis of least-squares oversampled collocation methods for compactly perturbed boundary integral equations in two dimensions
- AAA interpolation of equispaced data
- Fast and stable approximation of analytic functions from equispaced samples via polynomial frames
- On the adaptive spectral approximation of functions using redundant sets and frames
- Near-optimal sampling strategies for multivariate function approximation on general domains
- Frames and numerical approximation
- Localization of the generalized sampling series and its numerical application
- On the computation of Gaussian quadrature rules for Chebyshev sets of linearly independent functions
- Resolution of Singularities by Rational Functions
- Stable approximation of Helmholtz solutions in the disk by evanescent plane waves
- Oversampled collocation approximation method of functions via Jacobi frames
- Efficient least squares approximation and collocation methods using radial basis functions
- An efficient frequency-independent numerical method for computing the far-field pattern induced by polygonal obstacles
- Multivariate rational approximation of functions with curves of singularities
- Stable and accurate least squares radial basis function approximations on bounded domains
- A least-squares Fourier frame method for nonlocal diffusion models on arbitrary domains
- A local Fourier extension method for function approximation
- Optimal sampling for least-squares approximation
- Deflation techniques for finding multiple local minima of a nonlinear least squares problem
- Efficient function approximation in enriched approximation spaces
- Stable approximation of Helmholtz solutions in the 3D ball using evanescent plane waves
- New iterative algorithms for signal approximation by using frames in a Hilbert space
- A biharmonic solver based on Fourier extension with oversampling technique for arbitrary domain
- On polynomial interpolation in the monomial basis
This page was built for publication: Frames and numerical approximation. II: Generalized sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2226990)
