Adaptive cross approximation for ill-posed problems
type: Item
instance of: scholarly article
title: Adaptive cross approximation for ill-posed problems
zbMATH Open document ID: 1416.65565
author: Marc van Barel
author: Thomas Mach
author: Lothar Reichel
author: Raf Vandebril
published in: Journal of Computational and Applied Mathematics
publication date: 2016-04-18T00:00:00Z
Mathematics Subject Classification ID: 65R32
Mathematics Subject Classification ID: 45Q05
Mathematics Subject Classification ID: 65F50
Mathematics Subject Classification ID: 65F15
zbMATH DE Number: 6570186
zbMATH Keywords: ill-posed problem
zbMATH Keywords: inverse problem
zbMATH Keywords: sparse discretization
zbMATH Keywords: regularization
zbMATH Keywords: adaptive cross approximation
describes a project that uses: ErresTools
describes a project that uses: Regularization tools
describes a project that uses: CholeskyQR2
MaRDI profile type: Publication
full work available at URL: j.cam.2016.02.020
OpenAlex ID: W2313715311
cites work: Q4895893
cites work: Q3334886
cites work: Q4917542
cites work: Tikhonov regularization of large linear problems
cites work: On Krylov projection methods and Tikhonov regularization
cites work: Discrete ill-posed least-squares problems with a solution norm constraint
cites work: A modified truncated singular value decomposition method for discrete ill-posed problems
cites work: Error estimates for linear systems with applications to regularization
cites work: Convergence analysis of minimization-based noise level-free parameter choice rules for linear ill-posed problems
cites work: Old and new parameter choice rules for discrete ill-posed problems
cites work: An implicitly restarted block Lanczos bidiagonalization method using Leja shifts
cites work: Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems
cites work: An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition
cites work: Accelerating Galerkin BEM for linear elasticity using adaptive cross approximation
cites work: Adaptive low-rank approximation of collocation matrices
cites work: Solving a large dense linear system by adaptive cross approximation
cites work: A theory of pseudoskeleton approximations
cites work: Incomplete cross approximation in the mosaic-skeleton method
cites work: Approximation of boundary element matrices
cites work: Pseudo-skeleton approximations by matrices of maximal volume
cites work: Q4296888
cites work: A parallel GMRES version for general sparse matrices
cites work: Roundoff error analysis of the CholeskyQR2 algorithm
cites work: Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
cites work: Regularization tools version \(4.0\) for matlab \(7.3\)
cites work: The Use of Auto-correlation for Pseudo-rank Determination in Noisy III-conditioned Linear Least-squares Problems
cites work: Improvement of the resolution of an instrument by numerical solution of an integral equation
cites work: The numerical solution of non-singular linear integral equations
cites work: Deconvolution and regularization with Toeplitz matrices
DOI: 10.1016/J.CAM.2016.02.020
description: scientific article; zbMATH DE number 6570186