Paolo Novati

Silvia Gazzola, Silvia Noschese, Paolo Novati et al.

GMRES is one of the most popular iterative methods for the solution of large linear systems of equations that arise from the discretization of linear well-posed problems, such as Dirichlet boundary value problems for elliptic partial differential equations. The method is also applied to iteratively solve linear systems of equations that are obtained by discretizing linear ill-posed problems, such as many inverse problems. However, GMRES does not always perform well when applied to the latter kind of problems. This paper seeks to shed some light on reasons for the poor performance of GMRES in certain situations, and discusses some remedies based on specific kinds of preconditioning. The standard implementation of GMRES is based on the Arnoldi process, which also can be used to define a solution subspace for Tikhonov or TSVD regularization, giving rise to the Arnoldi-Tikhonov and Arnoldi-TSVD methods, respectively. The performance of the GMRES, the Arnoldi-Tikhonov, and the Arnoldi-TSVD methods is discussed. Numerical examples illustrate properties of these methods.

Claude Brezinski, Paolo Novati, Michela Redivo-Zaglia

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 a right hand side contaminated by noise.

Lidia Aceto, Paolo Novati

This paper provides a new numerical strategy to solve fractional in space reaction-diffusion equations on bounded domains under homogeneous Dirichlet boundary conditions. Using the matrix transform method the fractional Laplacian operator is replaced by a matrix which, in general, is dense. The approach here presented is based on the approximation of this matrix by the product of two suitable banded matrices. This leads to a semi-linear initial value problem in which the matrices involved are sparse. Numerical results are presented to verify the effectiveness of the proposed solution strategy.

Paolo Novati, Maria Rosaria Russo

For the solution of linear discrete ill-posed problems, in this paper we consider the Arnoldi-Tikhonov method coupled with the Generalized Cross Validation for the computation of the regularization parameter at each iteration. We study the convergence behavior of the Arnoldi method and its properties for the approximation of the (generalized) singular values, under the hypothesis that Picard condition is satisfied. Numerical experiments on classical test problems and on image restoration are presented.

Lidia Aceto, Paolo Novati

We investigate the rational approximation of fractional powers of unbounded positive operators attainable with a specific integral representation of the operator function. We provide accurate error bounds by exploiting classical results in approximation theory involving Padé approximants. The analysis improves some existing results and the numerical experiments proves its accuracy.

Paolo Novati, Michela Redivo-Zaglia, Maria Rosaria Russo

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.

Paolo Novati

In this paper we investigate some practical aspects concerning the use of the Restricted-Denominator (RD) rational Arnoldi method for the computation of the core functions of exponential integrators for parabolic problems. We derive some useful a-posteriori bounds together with some hints for a suitable implementation inside the integrators. Numerical ex- periments arising from the discretization of sectorial operators are pre- sented.

Lidia Aceto, Paolo Novati

We study a reliable pole selection for the rational approximation of the resolvent of fractional powers of operators in both the finite and infinite dimensional setting. The analysis exploits the representation in terms of hypergeometric functions of the error of the Padé approximation of the fractional power. We provide quantitatively accurate error estimates that can be used fruitfully for practical computations. We present some numerical examples to corroborate the theoretical results. The behavior of the rational Krylov methods based on this theory is also presented.

Silvia Gazzola, Paolo Novati

This paper introduces and analyzes an original class of Krylov subspace methods that provide an efficient alternative to many well-known conjugate-gradient-like (CG-like) Krylov solvers for square nonsymmetric linear systems arising from discretizations of inverse ill-posed problems. The main idea underlying the new methods is to consider some rank-deficient approximations of the transpose of the system matrix, obtained by running the (transpose-free) Arnoldi algorithm, and then apply some Krylov solvers to a formally right-preconditioned system of equations. Theoretical insight is given, and many numerical tests show that the new solvers outperform classical Arnoldi-based or CG-like methods in a variety of situations.