REVIEW 1 cited by
Inner Product Free Krylov Methods for Large-Scale Inverse Problems
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
In this study, we introduce two new Krylov subspace methods for solving rectangular large-scale linear inverse problems. The first approach is a modification of the Hessenberg iterative algorithm that is based off an LU factorization and is therefore referred to as the least squares LU (LSLU) method. The second approach incorporates Tikhonov regularization in an efficient manner; we call this the Hybrid LSLU method. Both methods are inner-product free, making them advantageous for high performance computing and mixed precision arithmetic. Theoretical findings and numerical results show that Hybrid LSLU can be effective in solving large-scale inverse problems and has comparable performance with existing iterative projection methods.
Forward citations
Cited by 1 Pith paper
-
Randomized and Inner-product Free Krylov Methods for Large-scale Inverse Problems
New inner-product-free Krylov methods, sCMRH and sLSLU, combine Hessenberg basis construction with randomized sketch-and-solve to produce residual norms close to minimal residual methods.
Discussion (0). Continue with ORCID to comment.