Subspace preconditioned LSQR for discrete ill-posed problems
From MaRDI portal
Publication:1431648
DOI10.1023/B:BITN.0000014547.88978.05zbMath1046.65030OpenAlexW2001427384MaRDI QIDQ1431648
Publication date: 11 June 2004
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:bitn.0000014547.88978.05
regularizationnumerical experimentspreconditioningconjugate gradient algorithmill-posed problemsleast squares regularization methodSchur complement CG methodtwo-level iterative methods
Ill-posedness and regularization problems in numerical linear algebra (65F22) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)
Related Items
An improved preconditioned LSQR for discrete ill-posed problems, Operator-theoretic and regularization approaches to ill-posed problems, LSQR algorithm with structured preconditioner for the least squares problem in quaternionic quantum theory, An iterative method for Tikhonov regularization with a general linear regularization operator, Matrix LSQR algorithm for structured solutions to quaternionic least squares problem, Wavelet-based multilevel methods for linear ill-posed problems, Efficient GOCE satellite gravity field recovery based on least-squares using QR decomposition, Regularization tools version \(4.0\) for matlab \(7.3\), Moment discretization for ill-posed problems with discrete weakly bounded noise, Cascadic multilevel methods for fast nonsymmetric blur- and noise-removal, Fast multilevel augmentation methods with compression technique for solving ill-posed integral equations, Cascadic multilevel methods for ill-posed problems, Extension of GKB‐FP algorithm to large‐scale general‐form Tikhonov regularization, Ill-Posed Problems: Operator Methodologies of Resolution and Regularization
Uses Software
