Analysis of some Krylov subspace approximations to the matrix exponential operator
SIAM Journal on Numerical Analysis
Matrix computations (3rd ed.)
Rank-deficient and discrete ill-posed problems: numerical aspects of linear inversion
Rank-deficient and discrete ill-posed problems: numerical aspects of linear inversion
Error Estimates for the Solution of Linear Systems
SIAM Journal on Scientific Computing
Preconditioning Lanczos Approximations to the Matrix Exponential
SIAM Journal on Scientific Computing
Functions of Matrices: Theory and Computation (Other Titles in Applied Mathematics)
Functions of Matrices: Theory and Computation (Other Titles in Applied Mathematics)
Meshfree Approximation Methods with MATLAB
Meshfree Approximation Methods with MATLAB
Error Estimates and Evaluation of Matrix Functions via the Faber Transform
SIAM Journal on Numerical Analysis
Preconditioning linear systems via matrix function evaluation
Applied Numerical Mathematics
Hi-index | 7.29 |
For the solution of full-rank ill-posed linear systems a new approach based on the Arnoldi algorithm is presented. Working with regularized systems, the method theoretically reconstructs the true solution by means of the computation of a suitable function of matrix. In this sense, the method can be referred to as an iterative refinement process. Numerical experiments arising from integral equations and interpolation theory are presented. Finally, the method is extended to work in connection with the standard Tikhonov regularization with the right-hand side contaminated by noise.