Double precision is not necessary for LSQR for solving discrete linear ill-posed problems
From MaRDI portal
Publication:6191356
DOI10.1007/s10915-023-02447-4OpenAlexW4391446436WikidataQ128905438 ScholiaQ128905438MaRDI QIDQ6191356
Publication date: 9 February 2024
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-023-02447-4
Ill-posedness and regularization problems in numerical linear algebra (65F22) Iterative numerical methods for linear systems (65F10) Roundoff error (65G50)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inverse problems. Basics, theory and applications in geophysics
- Automatic stopping rule for iterative methods in discrete ill-posed problems
- Simple stopping criteria for the LSQR method applied to discrete ill-posed problems
- A weighted-GCV method for Lanczos-hybrid regularization
- A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations
- Statistical and computational inverse problems.
- On Krylov projection methods and Tikhonov regularization
- IR tools: a MATLAB package of iterative regularization methods and large-scale test problems
- Regularization tools version \(4.0\) for matlab \(7.3\)
- The regularizing effect of the Golub-Kahan iterative bidiagonalization and revealing the noise level in the data
- The Mathematics of Computerized Tomography
- Choosing Regularization Parameters in Iterative Methods for Ill-Posed Problems
- Reservoir Simulation on NVIDIA Tesla GPUs
- Hybrid and Iteratively Reweighted Regularization by Unbiased Predictive Risk and Weighted GCV for Projected Systems
- Mixed Precision Block Fused Multiply-Add: Error Analysis and Application to GPU Tensor Cores
- The Lanczos and conjugate gradient algorithms in finite precision arithmetic
- Deblurring Images
- Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
- Rank-Deficient and Discrete Ill-Posed Problems
- Accuracy and Stability of Numerical Algorithms
- Computational Methods for Inverse Problems
- Rounding Error Analysis of Mixed Precision Block Householder QR Algorithms
- A Note on Inexact Inner Products in GMRES
- Regularization properties of LSQR for linear discrete ill-posed problems in the multiple singular value case and best, near best and general low rank approximations
- Squeezing a Matrix into Half Precision, with an Application to Solving Linear Systems
- Discrete Inverse Problems
- Perturbation bounds in connection with singular value decomposition
- Three-Precision GMRES-Based Iterative Refinement for Least Squares Problems
- Minimizing convex quadratics with variable precision conjugate gradients
- Mixed precision low-rank approximations and their application to block low-rank LU factorization
This page was built for publication: Double precision is not necessary for LSQR for solving discrete linear ill-posed problems
