The AZ algorithm for least squares systems with a known incomplete generalized inverse

DOI10.1137/19M1306385zbMATH Open1461.65058arXiv1912.03648MaRDI QIDQ5146697FDOQ5146697

Authors: Vincent Coppé, Daan Huybrechs, Roel Matthysen, Marcus Webb 

Publication date: 26 January 2021

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Abstract: We introduce an algorithm for the least squares solution of a rectangular linear system $Ax=b$, in which $A$ may be arbitrarily ill-conditioned. We assume that a complementary matrix $Z$ is known such that $A-A{Z}^{\ast }A$ is numerically low rank. Loosely speaking, $Z^{\ast }$ acts like a generalized inverse of $A$ up to a numerically low rank error. We give several examples of $(A,Z)$ combinations in function approximation, where we can achieve high-order approximations in a number of non-standard settings: the approximation of functions on domains with irregular shapes, weighted least squares problems with highly skewed weights, and the spectral approximation of functions with localized singularities. The algorithm is most efficient when $A$ and $Z^{\ast }$ have fast matrix-vector multiplication and when the numerical rank of $A-A{Z}^{\ast }A$ is small.

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

Recommendations

• Generalized approximate inverse preconditioners for least squares problems
• Linear least squares problems with additional constraints and an application to scattered data approximation
• Method of minimal pseudoinverse matrix: Theory and numerical realization
• Vector Orthogonal Polynomials and Least Squares Approximation
• Algorithm 853

zbMATH Keywords

least squares problemsrandomized linear algebralow-rank matrix approximationill-conditioned systems

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Randomized algorithms (68W20)

Cites Work

• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
• Prolate Spheroidal Wave Functions, Fourier Analysis, and Uncertainty-V: The Discrete Case
• Frames and bases. An introductory course
• On the Fourier Extension of Nonperiodic Functions
• A comparison of numerical algorithms for Fourier extension of the first, second, and third kinds
• Accurate, high-order representation of complex three-dimensional surfaces via Fourier continuation analysis
• A fast algorithm for Fourier continuation
• The Future Fast Fourier Transform?
• Title not available (Why is that?)
• Fast algorithms for the computation of Fourier extensions of arbitrary length
• Function approximation on arbitrary domains using Fourier extension frames
• Frames and numerical approximation

Cited In (11)

• Frames and numerical approximation. II: Generalized sampling
• 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
• Fast hybrid numerical-asymptotic boundary element methods for high frequency screen and aperture problems based on least-squares collocation
• Frame approximation with bounded coefficients
• Multivariate rational approximation of functions with curves of singularities
• Stable and accurate least squares radial basis function approximations on bounded domains
• On the computation of the SVD of Fourier submatrices
• A least-squares Fourier frame method for nonlocal diffusion models on arbitrary domains
• Fast and stable approximation of analytic functions from equispaced samples via polynomial frames
• Efficient function approximation on general bounded domains using splines on a Cartesian grid

Uses Software

• LSQR
• LSMR
• GitHub
• CRAIG

This page was built for publication: The AZ algorithm for least squares systems with a known incomplete generalized inverse

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