The use of Leja points is suggested by the fact that they guarantee maximal (and thus superlinear) convergence of the inter- polant on every ellipse of the ...

Comparing Leja and Krylov Approximations of Large Scale Matrix Exponentials. Conference paper. pp 685–692; Cite this conference paper. Download book PDF.

For a large sparse matrix A, f (A) is usually fully dense and infeasible to form explicitly. Numerical methods for approximating the action of f (A) to a vector ...

Comparing leja and krylov approximations of large scale matrix exponentials. Authors: L. Bergamaschi, M. Caliari, A. Martínez, M. VianelloAuthors Info ...

We have implemented a numerical code (ReLPM, Real Leja Points Method) for polynomial interpolation of the matrix exponential propagators exp (

Comparing Leja and Krylov approximations of large scale matrix exponentials. BERGAMASCHI, LUCA;Caliari M.;MARTINEZ CALOMARDO, ANGELES;VIANELLO, MARCO.

Nov 16, 2022 · We analyse the performance of the state-of-the-art Krylov algorithm, KIOPS, and the method of polynomial interpolation at Leja points for a ...

Comparing Leja and Krylov approximations of large scale matrix exponentials, L. Bergamaschi, M. Caliari, A. Martínez, and M. Vianello; Lecture Notes in ...

The interpolation method at Leja points have recently been shown to be competitive with the traditionally-used Krylov subspace method. The developed framework ...

In this note a theoretical analysis of some Krylov subspace approximations to the matrix exponential operation is presented, and a priori and a posteriors ...