Comparing Leja and Krylov approximations of large scale matrix exponentials

15Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We have implemented a numerical code (ReLPM, Real Leja Points Method) for polynomial interpolation of the matrix exponential propagators exp (ΔtA) v and ψ (ΔtA) v, ψ(z) = (exp (z) -1)/z. The ReLPM code is tested and compared with Krylov-based routines, on large scale sparse matrices arising from the spatial discretization of 2D and 3D advection-diffusion equations. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Bergamaschi, L., Caliari, M., Martínez, A., & Vianello, M. (2006). Comparing Leja and Krylov approximations of large scale matrix exponentials. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3994 LNCS-IV, pp. 685–692). Springer Verlag. https://doi.org/10.1007/11758549_93

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free