Frame approximation with bounded coefficients

DOI10.1007/S10444-020-09820-ZMaRDI QIDQ2026136zbMATH OpenOpenAlexFDO

Authors Ben Adcock, Mohsen Seifi

Publication date 18 May 2021

Published in Advances in Computational Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2001.00983

zbMATH Keywords

singular value decompositionframesfunction approximationill-conditioning

Mathematics Subject Classification ID

Numerical methods for trigonometric approximation and interpolation (65T40) Approximation by polynomials (41A10) General harmonic expansions, frames (42C15) Completeness of sets of functions in nontrigonometric harmonic analysis (42C30)

Abstract: Due to their flexibility, frames of Hilbert spaces are attractive alternatives to bases in approximation schemes for problems where identifying a basis is not straightforward or even feasible. Computing a best approximation using frames, however, can be challenging since it requires solving an ill-conditioned linear system. One consequence of this ill-conditioning is that the coefficients of such a frame approximation can grow large. In this paper we resolve this issue by introducing two methods for frame approximation that possess bounded coefficients. As we show, these methods typically lead to little or no deterioration in the approximation accuracy, but successfully avoid the large coefficients inherent to previous approaches, thus making them attractive in situations where large coefficients are undesirable. We also present theoretical analysis to support these conclusions.

Recommendations

• Frames and the projection method
• Frames and numerical approximation
• scientific article; zbMATH DE number 1281710
• The finite section method and problems in frame theory
• scientific article; zbMATH DE number 1303648

Cites work

• A fast algorithm for Fourier continuation
• A sharp-interface active penalty method for the incompressible Navier-Stokes equations
• A spectral embedding method applied to the advection-diffusion equation
• APPROXIMATING SMOOTH, MULTIVARIATE FUNCTIONS ON IRREGULAR DOMAINS
• An introduction to frames and Riesz bases
• Analysis of fictitious domain approximations of hard scatterers
• Fast algorithms for the computation of Fourier extensions of arbitrary length
• Fourier embedded domain methods: Extending a function defined on an irregular region to a rectangle so that the extension is spatially periodic and \(C^{\infty}\)
• Frames and numerical approximation
• Function approximation on arbitrary domains using Fourier extension frames
• Infinite matrices and their finite sections. An introduction to the limit operator method.
• Spectral domain embedding for elliptic PDEs in complex domains
• 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

(5)

• Frames and numerical approximation
• On the adaptive spectral approximation of functions using redundant sets and frames
• Estimation of the frame bounds based on the mutual-coherence of a matrix
• Multivariate rational approximation of functions with curves of singularities
• Stable and accurate least squares radial basis function approximations on bounded domains

This page was built for publication: Frame approximation with bounded coefficients

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2026136)