Exploiting compression in solving discretized linear systems

DOI10.1553/etna_vol55s341zbMath1487.65034OpenAlexW2969911967MaRDI QIDQ2672181

Erin Carrier, Michael T. Heath

Publication date: 8 June 2022

Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1553/etna_vol55s341

zbMATH Keywords

linear systemsregularizationprojection methodcompressed solutioncompression basisdiscretized linear system

Mathematics Subject Classification ID

Ill-posedness and regularization problems in numerical linear algebra (65F22) Iterative numerical methods for linear systems (65F10) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Uses Software

• Python

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Adaptive cross approximation for ill-posed problems
• R\(^3\)GMRES: including prior information in GMRES-type methods for discrete inverse problems
• Subspace-restricted singular value decompositions for linear discrete ill-posed problems
• A truncated projected SVD method for linear discrete ill-posed problems
• A new \(L\)-curve for ill-posed problems
• Interpolation and approximation by polynomials
• Enriched Krylov subspace methods for ill-posed problems
• Solving PDEs in Python
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
• The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
• Analysis of Augmented Krylov Subspace Methods
• Model Reduction and Approximation
• An Introduction to Compressed Sensing
• Discrete Inverse Problems