Preconditioning linear systems via matrix function evaluation
From MaRDI portal
Abstract: For the solution of discrete ill-posed problems, in this paper a novel preconditioned iterative method based on the Arnoldi algorithm for matrix functions is presented. The method is also extended to work in connection with Tikhonov regularization. Numerical experiments arising from the solution of integral equations and image restoration are presented.
Recommendations
- An Arnoldi-based preconditioner for iterated Tikhonov regularization
- scientific article; zbMATH DE number 592770
- A rational Arnoldi approach for ill-conditioned linear systems
- Invertible smoothing preconditioners for linear discrete ill-posed problems
- Pivoted Cauchy-Like Preconditioners for Regularized Solution of Ill-Posed Problems
Cites work
- A Projection‐Based Approach to General‐Form Tikhonov Regularization
- A rational Arnoldi approach for ill-conditioned linear systems
- A Restarted Krylov Subspace Method for the Evaluation of Matrix Functions
- An interpolatory approximation of the matrix exponential based on Faber polynomials
- Error Estimates and Evaluation of Matrix Functions via the Faber Transform
- Error Estimates for Polynomial Krylov Approximations to Matrix Functions
- Functions of Matrices
- Further analysis of the Arnoldi process for eigenvalue problems
- scientific article; zbMATH DE number 556557 (Why is no real title available?)
- scientific article; zbMATH DE number 1012640 (Why is no real title available?)
- scientific article; zbMATH DE number 2166298 (Why is no real title available?)
- Krylov solvers for linear algebraic systems.
- Meshfree approximation methods with Matlab. With CD-ROM.
- Minimum Principles for Ill-Posed Problems
- Numerical range and functional calculus in Hilbert space
- Numerical solution of saddle point problems
- RD-rational approximations of the matrix exponential
- Regularization methods for large-scale problems
- Regularization tools version 4.0 for matlab 7.3
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- Solving Ill-Conditioned and Singular Linear Systems: A Tutorial on Regularization
Cited in
(11)- Bounds for the entries of matrix functions with applications to preconditioning
- Efficient matrix preconditioners for black box linear algebra
- Numerical linear algebra for reconstruction inverse problems.
- An efficient method to set up a Lanczos based preconditioner for discrete ill-posed problems
- Regularization of inverse problems by an approximate matrix-function technique
- Approximate Schur-block ILU preconditioners for regularized solution of discrete ill-posed problems
- Preconditioned iterative methods for linear discrete ill-posed problems from a Bayesian inversion perspective
- An Arnoldi-based preconditioner for iterated Tikhonov regularization
- Analysis of a Classical Matrix Preconditioning Algorithm
- Pivoted Cauchy-Like Preconditioners for Regularized Solution of Ill-Posed Problems
- Invertible smoothing preconditioners for linear discrete ill-posed problems
This page was built for publication: Preconditioning linear systems via matrix function evaluation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1760115)
