Randomized core reduction for discrete ill-posed problem
From MaRDI portal
Publication:2309262
DOI10.1016/j.cam.2020.112797zbMath1487.65045arXiv1808.02654OpenAlexW3008521353MaRDI QIDQ2309262
Publication date: 30 March 2020
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.02654
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Ill-posedness and regularization problems in numerical linear algebra (65F22) Randomized algorithms (68W20)
Related Items (4)
Krylov Subspace Approach to Core Problems within Multilinear Approximation Problems: A Unifying Framework ⋮ Randomized Quaternion Singular Value Decomposition for Low-Rank Matrix Approximation ⋮ Single-pass randomized QLP decomposition for low-rank approximation ⋮ Multidimensional Total Least Squares Problem with Linear Equality Constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Modulus-based iterative methods for constrained Tikhonov regularization
- A randomized algorithm for the decomposition of matrices
- A fast randomized algorithm for the approximation of matrices
- Solving regularized total least squares problems based on eigenproblems
- TLS formulation and core reduction for problems with structured right-hand sides
- A randomized method for solving discrete ill-posed problems
- IR tools: a MATLAB package of iterative regularization methods and large-scale test problems
- Regularization tools version \(4.0\) for matlab \(7.3\)
- Principal submatrices. IX: Interlacing inequalities for singular values of submatrices
- Methods for Large Scale Total Least Squares Problems
- Tikhonov Regularization and Randomized GSVD
- Regularization with randomized SVD for large-scale discrete inverse problems
- The Core Problem within a Linear Approximation Problem $AX\approx B$ with Multiple Right-Hand Sides
- LSRN: A Parallel Iterative Solver for Strongly Over- or Underdetermined Systems
- Total least squares problem with the arbitrary unitarily invariant norms
- A fast randomized algorithm for overdetermined linear least-squares regression
- A Fast Randomized Algorithm for Orthogonal Projection
- A Contribution to the Conditioning of the Total Least-Squares Problem
- The Total Least Squares Problem in AX≈B: A New Classification with the Relationship to the Classical Works
- Randomized algorithms for total least squares problems
- Blendenpik: Supercharging LAPACK's Least-Squares Solver
- Solvability of the Core Problem with Multiple Right-Hand Sides in the TLS Sense
- Deblurring Images
- Randomized algorithms for large-scale inverse problems with general Tikhonov regularizations
- Collinearity and Total Least Squares
- Regularization by Truncated Total Least Squares
- Blind Deconvolution Using a Regularized Structured Total Least Norm Algorithm
- Modified truncated randomized singular value decomposition (MTRSVD) algorithms for large scale discrete ill-posed problems with general-form regularization
- Band Generalization of the Golub--Kahan Bidiagonalization, Generalized Jacobi Matrices, and the Core Problem
- Subspace Iteration Randomization and Singular Value Problems
- Condition Numbers of the Multidimensional Total Least Squares Problem
- Core Problems in Linear Algebraic Systems
- Perturbation theory for pseudo-inverses
- Randomized algorithms for generalized Hermitian eigenvalue problems with application to computing Karhunen–Loève expansion
This page was built for publication: Randomized core reduction for discrete ill-posed problem
