Adaptive cross approximation for ill-posed problems

DOI10.1016/j.cam.2016.02.020zbMath1416.65565OpenAlexW2313715311MaRDI QIDQ269387

Marc Van Barel, Thomas Mach, Lothar Reichel, Raf Vandebril

Publication date: 18 April 2016

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2016.02.020

zbMATH Keywords

inverse problemregularizationill-posed problemadaptive cross approximationsparse discretization

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical methods for inverse problems for integral equations (65R32) Inverse problems for integral equations (45Q05)

Related Items

Partially pivoted ACA based acceleration of the energetic BEM for time-domain acoustic and elastic waves exterior problems, Numerical investigation of Fredholm integral equation of the first kind with noisy data, Exploiting compression in solving discretized linear systems, Using low-rank approximations of gridded data for spline surface fitting, Adaptive cross approximation for Tikhonov regularization in general form, Solution of ill-posed problems with Chebfun, Functions and eigenvectors of partially known matrices with applications to network analysis, Remote sensing images destriping using unidirectional hybrid total variation and nonconvex low-rank regularization

Uses Software

• Regularization tools
• CholeskyQR2
• ErresTools

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discrete ill-posed least-squares problems with a solution norm constraint
• Roundoff error analysis of the CholeskyQR2 algorithm
• Solving a large dense linear system by adaptive cross approximation
• Error estimates for linear systems with applications to regularization
• Pseudo-skeleton approximations by matrices of maximal volume
• A theory of pseudoskeleton approximations
• Adaptive low-rank approximation of collocation matrices
• Tikhonov regularization of large linear problems
• Incomplete cross approximation in the mosaic-skeleton method
• Approximation of boundary element matrices
• Deconvolution and regularization with Toeplitz matrices
• A parallel GMRES version for general sparse matrices
• Old and new parameter choice rules for discrete ill-posed problems
• On Krylov projection methods and Tikhonov regularization
• An implicitly restarted block Lanczos bidiagonalization method using Leja shifts
• Convergence analysis of minimization-based noise level-free parameter choice rules for linear ill-posed problems
• Regularization tools version \(4.0\) for matlab \(7.3\)
• Improvement of the resolution of an instrument by numerical solution of an integral equation
• Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems
• A modified truncated singular value decomposition method for discrete ill-posed problems
• Accelerating Galerkin BEM for linear elasticity using adaptive cross approximation
• The Use of Auto-correlation for Pseudo-rank Determination in Noisy III-conditioned Linear Least-squares Problems
• Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
• An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition
• The numerical solution of non-singular linear integral equations