On Krylov Subspace Approximations to the Matrix Exponential Operator
Open accessThe DOI matches its Crossref record; 29 of the 30 references it cites were found in a registry or an index, and 1 are not checked yet.
Abstract
Krylov subspace methods for approximating the action of matrix exponentials are analyzed in this paper. We derive error bounds via a functional calculus of Arnoldi and Lanczos methods that reduces the study of Krylov subspace approximations of functions of matrices to that of linear systems of equations. As a side result, we obtain error bounds for Galerkin-type Krylov methods for linear equations, namely, the biconjugate gradient method and the full orthogonalization method. For Krylov approximations to matrix exponentials, we show superlinear error decay from relatively small iteration numbers onwards, depending on the geometry of the numerical range, the spectrum, or the pseudospectrum. The convergence to exp$(\tau A)v$ is faster than that of corresponding Krylov methods for the solution of linear equations $(I-\tau A)x=v$, which usually arise in the numerical solution of stiff ordinary differential equations (ODEs). We therefore propose a new class of time integration methods for large systems of nonlinear differential equations which use Krylov approximations to the exponential function of the Jacobian instead of solving linear or nonlinear systems of equations in every time step.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Analogous to the eigenvalue problem in DMRG, both Eqs. ( 7) and ( 8) can be integrated using a Lanczos scheme [28] in order to keep the computational cost at O(D 3 ).”
From Unifying time evolution and optimization with matrix product states (2016) · cites this paper as [28]
Citations
Cites
Solving Ordinary Differential Equations II
Hairer, E., & Wanner, G. (1996) · Springer Series in Computational Mathematics · doi:10.1007/978-3-642-05221-7 · Cited by 4,342
Solving Ordinary Differential Equations II
Hairer, E., & Wanner, G. (1991) · Springer Series in Computational Mathematics · doi:10.1007/978-3-662-09947-6 · Cited by 1,456
Theory of Functions of a Complex Variable
Markushevich, A. I., Silverman, R. A., & Gillis, J. (1966) · Physics Today · doi:10.1063/1.3048359 · Cited by 1,211
Unitary quantum time evolution by iterative Lanczos reduction
Park, T. J., & Light, J. C. (1986) · The Journal of Chemical Physics · doi:10.1063/1.451548 · Cited by 888
Uniform Numerical Methods for Problems with Initial and Boundary Layers.
Berger, A. E., Doolan, E. P., Miller, J. J. H., & Schilders, W. H. A. (1982) · Mathematics of Computation · doi:10.2307/2007353 · Cited by 754
Analysis of Some Krylov Subspace Approximations to the Matrix Exponential Operator
Saad, Y. (1992) · SIAM Journal on Numerical Analysis · doi:10.1137/0729014 · Cited by 670
Numerical Ranges of Operators on Normed Spaces and of Elements of Normed Algebras
Bonsall, F. F., & Duncan, J. (1971) · Cambridge University Press eBooks · doi:10.1017/cbo9781107359895 · Cited by 614
Propagation Methods for Quantum Molecular Dynamics
Kosloff, R. (1994) · Annual Review of Physical Chemistry · doi:10.1146/annurev.pc.45.100194.001045 · Cited by 602
Krylov subspace methods for solving large unsymmetric linear systems
Saad, Y. (1981) · Mathematics of Computation · doi:10.1090/s0025-5718-1981-0616364-6 · Cited by 449
Generalized Runge-Kutta Processes for Stable Systems with Large Lipschitz Constants
Lawson, J. D. (1967) · SIAM Journal on Numerical Analysis · doi:10.1137/0704033 · Cited by 328
Research works printed but not linked: 5
- A. Friedli, Verallgemeinerte Runge‐Kutta Verfahren zur Lösung steifer Differentialgleichungen , in Lecture Notes in Mathematics 631, Springer‐Verlag, Berlin, 1978, pp. 35–50. · doi:10.1007/bfb0067462
- Hochbruck M., 1997, SIAM J. Sci. Comput., 18
- Knizhnerman L. A., 1991, Comput. Math. and Math. Phys., 31, 1
- Knizhnerman L. A., 1992, Comput. Math. and Math. Phys., 32, 1199
- D. R. Taylor, Analysis of the look‐ahead Lanczos algorithm , Ph.D. thesis, University of California at Berkeley, Berkeley, CA, 1982.
Cited by
Items 401–500 of 810
An Accurate Polynomial Approximation of Exponential Integrators
Suhov, A. (2013) · Journal of Scientific Computing · doi:10.1007/s10915-013-9813-x · Cited by 13
“There are three main approaches to the evaluation: the Krylov subspace method [8,13,14,19,25,28], the rational approximation of φμ(z) in domain , which includes all eigenvalues of A [24] and the polynomial approximation of φμ(z) in domain [4,5,7,22,27].”
Li, S., Wang, Z. J., Ju, L., & Luo, L. (2017) · AIAA Aerospace Sciences Meeting · doi:10.2514/6.2017-0753 · Cited by 12
Brachet, M., Debreu, L., & Eldred, C. (2022) · Applied Numerical Mathematics · doi:10.1016/j.apnum.2022.05.006 · Cited by 12
“The problem is solved thanks to Krylov methods [16, 27, 32] which are based on the projection of the matrix A onto a Krylov subspace using Arnoldi’s algorithm.”
MethodRational Krylov methods in exponential integrators for European option pricing
Ragni, S. (2013) · Numerical Linear Algebra with Applications · doi:10.1002/nla.1894 · Cited by 12
Improving the accuracy of the AVF method
Cieśliński, J. L. (2013) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2013.08.008 · Cited by 12
“y (by diagonalization of the matrix) as any other analytic function. This straightforward method is expensive for large m and then one may use special techniques for computing exponential integrators [14, 19]. We took into account that locally exact modifications are more expensive. Therefore, in numerical experiments…”
Koskela, A. (2014) · Lecture notes in computational science and engineering · doi:10.1007/978-3-319-10705-9_34 · Cited by 12
“[4] and [8].”
A multi-resolution approach to heat kernels on discrete surfaces
Vaxman, A., Ben‐Chen, M., & Gotsman, C. (2010) · ACM SIGGRAPH Conference (SIGGRAPH) · doi:10.1145/1833349.1778858 · Cited by 12
“Furthermore, it is worth mentioning that other algorithms that compute the action of the heat kernel on a vector v [Hochbruck and Lubich 1997] cannot efficiently compute the diagonal of the heat kernel – the HKS, without resorting to the computation of the entire matrix, whereas in our case computing the HKS is a simp…”
MethodInfluentialOn monotonicity of the Lanczos approximation to the matrix exponential
Druskin, V. L. (2008) · Linear Algebra and its Applications · doi:10.1016/j.laa.2008.04.046 · Cited by 12
“A priori SLDM convergence estimates (in exact arithmetic) were obtained in [3], similar results also can be found in [5,6].”
ResultMemory-efficient Krylov subspace techniques for solving large-scale Lyapunov equations
Kreßner, D. (2008) · IEEE International Symposium on Computer-Aided Control System Design (CACSD) · doi:10.1109/cacsd.2008.4627370 · Cited by 12
“For example, error bounds on the matrix exponential [8], [10], [16], [22], [34] can be turned into bounds on ‖X − Xk‖2.”
BackgroundRegularization of nonlinear ill-posed problems by exponential integrators
Hochbruck, M., Honig, M. L., & Ostermann, A. (2009) · ESAIM Mathematical Modelling and Numerical Analysis · doi:10.1051/m2an/2009021 · Cited by 12
“This enables to approximate 3) For a convergence analysis of Krylov approximations to matrix functions we refer to [3,8].”
MethodSelf-citationStochastic Exponential Integrators for a Finite Element Discretization of SPDEsPreprint
Lord, G. J., & Tambue, A. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1005.5315 · Cited by 12
“However, new developments for both L´eja points and Krylov subspace techniques [33, 34, 17, 39, 31, 32] have led to efficient methods for computing matrix exponentials.”
Inner-outer Iterative Methods for Eigenvalue Problems - Convergence and Preconditioning
Freitag, M. A. (2007) · The University of Bath Online Publications Store (The University of Bath) · Cited by 15
Szenes, K., Glaser, N., Eraković, M., Barandun, V., Mörchen, M., Feldmann, R., Battaglia, S., Baiardi, A., & Reiher, M. (2025) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.5c02970 · Cited by 12
Weng, Z., & Zhai, S. (2026) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2026.118968 · Cited by 11
A Note on Krylov Methods for Fractional Evolution Problems
Moret, I. (2013) · Numerical Functional Analysis and Optimization · doi:10.1080/01630563.2012.748669 · Cited by 11
“Concening the SKM, we cite, among the others, the classical papers [13, 19, 20] and the more recent ones [21, 22].”
MethodComputing humps of the matrix exponential
Nechepurenko, Y. M., & Sadkane, M. (2016) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2016.12.031 · Cited by 11
On stochasticity preserving methods for the computation of the matrix pth root
Politi, T., & Popolizio, M. (2014) · Mathematics and Computers in Simulation · doi:10.1016/j.matcom.2014.01.002 · Cited by 11
A short guide to exponential Krylov subspace time integration for Maxwell's equations
Botchev, M. A. (2012) · Memorandum (Institute of Pacific Relations American Council) · Cited by 12
Lu, D., & Zhang, Y. (2017) · Journal of Scientific Computing · doi:10.1007/s10915-017-0398-7 · Cited by 11
“The numerical results are reported in Tables 15, 16 and 17.”
BackgroundMethodLund, K. (2018) · ELPUB (Universitat Wuppertal) · Cited by 11
Solution of nonlinear time-dependent PDEs through componentwise approximation of matrix functions
Cibotarica, A., Lambers, J. V., & Palchak, E. M. (2016) · Journal of Computational Physics · doi:10.1016/j.jcp.2016.06.024 · Cited by 11
“It may seem that KSS methods appear to be prohibitively expensive, due to the computation of a large number of Krylov subspaces, when compared to the Krylov subspace methods such as those in [9, 10, 11, 25].”
MethodResultInfluentialSchweitzer, M. (2023) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/23m1556708 · Cited by 11
Accurate dense output formula for exponential integrators using the scaling and squaring method
Wang, C., Fu, X., Li, P., & Wu, J. (2014) · Applied Mathematics Letters · doi:10.1016/j.aml.2014.12.008 · Cited by 11
Ramachandran, R. K., & Berman, S. (2017) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2017.7963550 · Cited by 11
“There has been a great deal of literature about approximate computation of the matrix exponential [25], [26], which by definition is an infinite matrix series.”
BackgroundHigh order integration factor methods for systems with inhomogeneous boundary conditions
Ahmed, S., & Liu, X. (2018) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2018.08.036 · Cited by 11
Efficient computation of phi-functions in exponential integrators
Jiménez, J. C., de la Cruz, H., & de Maio, P. A. (2020) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2020.112758 · Cited by 14
Error Bounds for Lanczos Approximations of Rational Functions of Matrices
Frommer, A., & Simoncini, V. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-01591-5_13 · Cited by 11
“This is a well-known phenomenon, see [6] and [ 13 ], e.g.”
BackgroundInfluentialBotchev, M. A., Oseledets, I. V., & Tyrtyshnikov, E. E. (2014) · Computers & Mathematics with Applications · doi:10.1016/j.camwa.2014.03.002 · Cited by 11
“, the efficiency does depend on the length of the time interval (typically, the smaller T , the smaller Krylov dimensionm suffices [19,9]).”
Simply improved averaging for coupled oscillators and weakly nonlinear waves
Tao, M. (2018) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2018.11.003 · Cited by 11
“, [79, 90, 53] for the computations of matrix exponential and [99] for exponentiating a sequence of matrices.”
BackgroundPricing High-Dimensional American Options Using Local Consistency ConditionsPreprint
Berridge, S. J., & Schumacher, J. M. (2004) · SSRN Electronic Journal · doi:10.2139/ssrn.557745 · Cited by 11
“The effect of the matrix exponential can be calculated efficiently using Krylov subspace methods, see for example [6] or [10].”
MethodA posteriori error estimates of Krylov subspace approximations to matrix functionsPreprint
Jia, Z., & Lv, H. (2016) · Cited by 11
Large Nc Truncations for SU(Nc) Lattice Yang-Mills Theory with FermionsPreprint
Modi, N. S., Ciavarella, A. N., Halimeh, J. C., & Bauer, C. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2602.02344 · Cited by 11
Solution of time-dependent PDE through rapid estimation of block Gaussian quadrature nodes
Palchak, E. M., Cibotarica, A., & Lambers, J. V. (2014) · Linear Algebra and its Applications · doi:10.1016/j.laa.2014.07.009 · Cited by 10
“The polynomial pn(A) is of degree n in A, the polynomials pj are orthonormal, and wj is a product of a polynomial in A of degree j − 1 and v [11,14,19].”
BackgroundMethodComputing time-periodic steady-state currents via the time evolution of tensor network states
Strand, N. E., Vroylandt, H., & Gingrich, T. R. (2022) · The Journal of Chemical Physics · doi:10.1063/5.0099741 · Cited by 13
Computational Krylov‐based methods for large‐scale differential Sylvester matrix problems
Hached, M., & Jbilou, K. (2018) · Numerical Linear Algebra with Applications · doi:10.1002/nla.2187 · Cited by 10
“(11) If for simplicity, we assume that X(t0) = 0, an approximation to the solution of the differential Sylvester equation (1) can be expressed as the product Xm(t) = mGm(t)mT , t ∈ [t0, Tf ], (12) where”
BackgroundEfficient exponential time integration for simulating nonlinear coupled oscillators
Luân, V. T., & Michels, D. L. (2021) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2021.113429 · Cited by 10
Nonlinear Optical Processes in Centrosymmetric Systems by Cavity-Induced Symmetry Breaking
Welakuh, D. M., & Narang, P. (2024) · ACS Photonics · doi:10.1021/acsphotonics.2c01933 · Cited by 10
Exponential time differencing for the tracer equations appearing in primitive equation ocean models
Calandrini, S., Pieper, K., & Gunzburger, M. (2020) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2020.113002 · Cited by 10
“An alternative to scaling and squaring methods is given by Krylov subspace projections [27, 11].”
MethodLi, X., Ju, L., & Hoang, T. (2020) · BIT Numerical Mathematics · doi:10.1007/s10543-020-00817-0 · Cited by 10
A second-order Magnus-type integrator for quasi-linear parabolic problems
González, C., & Thalhammer, M. (2006) · Mathematics of Computation · doi:10.1090/s0025-5718-06-01883-7 · Cited by 10
“In the last few years, due to the progress of the art and the increasing potentiality for the efficient calculation of the matrix exponential in nondubious ways [22] (see [10, 16] and references cited therein), numerical methods based on the Magnus”
MethodRate of convergence of Local Linearization schemes for random differential equations
Jiménez, J. C., & Carbonell, F. (2009) · BIT Numerical Mathematics · doi:10.1007/s10543-009-0225-0 · Cited by 11
“Nevertheless, depending on the class of the matrix �n and/or the location and shape of its spectrum (see for instance [ 13 ] and references in [21]), such restriction might be discarded.”
BackgroundInfluentialOn the stability of some algorithms for computing the action of the matrix exponential
Fischer, T. M. (2013) · Linear Algebra and its Applications · doi:10.1016/j.laa.2013.11.003 · Cited by 10
Approximation of matrix operators applied to multiple vectors
Hochbruck, M., & Niehoff, J. (2008) · Mathematics and Computers in Simulation · doi:10.1016/j.matcom.2008.03.016 · Cited by 10
“The most popular method for approximating such matrix operators is by Krylov subspace methods [2–4,11–13,15,16,19,23,24,32,34,36].”
MethodSelf-citationAnalysis of inexact Krylov subspace methods for approximating the matrix exponential
Dinh, K. N., & Sidje, R. B. (2017) · Mathematics and Computers in Simulation · doi:10.1016/j.matcom.2017.01.002 · Cited by 11
Complexity Theory for Lie-Group Solvers
Celledoni, E., Iserles, A., Nørsett, S. P., & Orel, B. (2002) · Journal of Complexity · doi:10.1006/jcom.2001.0615 · Cited by 10
“The computational costs of this approach are comparable to polynomial approximants (e.g., Krylov subspace methods (Kosloff et al., 1992; Hochbruck and Lubich, 1997; Gallopoulos and Saad, 1992)), yet, unlike the latter, they are guaranteed to map a Lie-algebraic element to a Lie group.”
BackgroundMethodWang, C., Liu, H., Xue, C., Zhuang, X., Dou, M., Chen, Z., & Guo, G. (2026) · Quantum Science and Technology · doi:10.1088/2058-9565/ae7b7e · Cited by 12
“For an N -dimensional non-Hermitian system where N = 2 n , classical approaches such as exact diagonalization, Krylov subspace methods, or standard finite-difference time-domain algorithms generally incur a computational cost that scales polynomially with the system dimension N [44].”
Nonadiabatic and Time-Resolved Photoelectron Spectroscopy for Molecular Systems
Flick, J., Appel, H., & Rubio, Á. (2014) · Journal of Chemical Theory and Computation · doi:10.1021/ct4010933 · Cited by 9
Adaptive Rational Krylov Methods for Exponential Runge–Kutta Integrators
Bergermann, K., & Stoll, M. (2024) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/23m1559439 · Cited by 12
Computing Functions of Symmetric Hierarchically Semiseparable Matrices
Casulli, A. A., Kreßner, D., & Robol, L. (2024) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/24m1642354 · Cited by 9
Kloster, K., & Gleich, D. F. (2013) · Lecture notes in computer science · doi:10.1007/978-3-319-03536-9_6 · Cited by 16
Integration of chemical stiff ODEs using exponential propagation method
Falati, M., & Hojjati, G. (2011) · Journal of Mathematical Chemistry · doi:10.1007/s10910-011-9881-9 · Cited by 9
“Second, as was shown in [5], the convergence of the Krylov projection method used in an exponential propagation scheme exceeds that of the same Krylov projection technique used to invert a matrix in an implicit method.”
MethodDynamics of multiple atoms in one-dimensional fields
Cascio, C., Halimeh, J. C., McCulloch, I. P., Recati, A., & de Vega, I. (2019) · Physical Review A · doi:10.1103/physreva.99.013845 · Cited by 10
PyTeNet: A concise Python implementation of quantum tensor network algorithms
Mendl, C. B. (2018) · The Journal of Open Source Software · doi:10.21105/joss.00948 · Cited by 14
“Another major feature is the (real and imaginary) time evolution based on the time-dependent variational principle (TDVP) (Haegeman, Lubich, Oseledets, Vandereycken, & Verstraete, 2016), making use of Krylov subspace methods for local operations (Hochbruck & Lubich, 1997).”
MethodFast estimation of matrix exponential spatial models
Yang, Y., Doğan, O., & Taşpınar, S. (2021) · Journal of Spatial Econometrics · doi:10.1007/s43071-021-00015-2 · Cited by 11
3D anisotropic TEM modeling with loop source using model reduction method
Lu, K., Fan, Y., Zhou, J., Li, X., Li, H., & Fan, K. (2022) · Journal of Geophysics and Engineering · doi:10.1093/jge/gxac029 · Cited by 9
Preconditioned Galerkin and minimal residual methods for solving Sylvester equations
Kaabi, A., Toutounian, F., & Kerayechian, A. (2006) · Applied Mathematics and Computation · doi:10.1016/j.amc.2006.02.021 · Cited by 9
A rational Arnoldi process with applications
Pranić, M. S., Reichel, L., Rodriguez, G., Wang, Z., & Yu, X. (2016) · Numerical Linear Algebra with Applications · doi:10.1002/nla.2065 · Cited by 10
“We are interested in the situation when they are rational functions with fixed poles of low enough order so that (1) is an inner product.”
BackgroundInfluentialMukam, J. D., & Tambue, A. (2019) · Computers & Mathematics with Applications · doi:10.1016/j.camwa.2019.01.011 · Cited by 9
MONOTONE CONVERGENCE OF THE LANCZOS APPROXIMATIONS TO MATRIX FUNCTIONS OF HERMITIAN MATRICES
Frommer, A. (2009) · Cited by 9
Sublinear Column-wise Actions of the Matrix Exponential on Social Networks
Gleich, D. F., & Kloster, K. (2014) · Internet Mathematics · doi:10.1080/15427951.2014.971203 · Cited by 11
“Although the Taylor and Krylov approaches are fast and accurate — see references [23, 21, 3] for the numerical analysis — existing implementations depend on repeated matrix-vector products with the matrix A.”
BackgroundArnoldi and Crank-Nicolson methods for integration in time of the transport equation
Pini, G., & Gambolati, G. (2001) · International Journal for Numerical Methods in Fluids · Cited by 9
On the construction of restricted-denominator exponential W-methods
Novati, P. (2007) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2006.11.024 · Cited by 9
“[5]).”
Image--EVI on Metric Quotients for Gradient FlowsPreprint
Takahashi, K. (2025) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.17518571 · Cited by 9
Thermally enhanced Majorana-mediated spin transport in the Kitaev model
Taguchi, H., Murakami, Y., & Koga, A. (2022) · Physical review. B./Physical review. B · doi:10.1103/physrevb.105.125137 · Cited by 8
Stable Spectral Methods for Time-Dependent Problems and the Preservation of Structure
Iserles, A. (2024) · Foundations of Computational Mathematics · doi:10.1007/s10208-024-09647-w · Cited by 8
Bayer, F., Leine, R. I., Thomas, O., & Grolet, A. (2024) · International Journal of Non-Linear Mechanics · doi:10.1016/j.ijnonlinmec.2024.104894 · Cited by 8
A Short Course on Exponential Integrators
Hochbruck, M. (2015) · Series in contemporary applied mathematics · doi:10.1142/9789814675772_0002 · Cited by 8
“In Hochbruck and Lubich (1997) it was shown how to derive error bounds for the approximation of the matrix exponential based on Cauchy’s integral formula by using Faber polynomials for different sets in the complex plane.”
MethodInfluentialSelf-citationLambers, J. V. (2008) · Cited by 8
Blanes, S., Casas, F., & Thalhammer, M. (2017) · IMA Journal of Numerical Analysis · doi:10.1093/imanum/drx012 · Cited by 12
A parallel nearly implicit time-stepping scheme
Botchev, M. A., & van der Vorst, H. A. (2001) · Journal of Computational and Applied Mathematics · doi:10.1016/s0377-0427(01)00358-2 · Cited by 8
Order results for Krylov-W-methods
Weiner, R., & Schmitt, B. A. (1998) · Computing · doi:10.1007/bf02684451 · Cited by 8
“Hochbruck and Lubich [ 10 ], [11] consider exponential W-methods using Krylov approximations to the exponential function of the Jacobian.”
MethodMin, M., & Fischer, P. (2013) · Journal of Scientific Computing · doi:10.1007/s10915-013-9718-8 · Cited by 8
Kang, W., Zhao, S., Zhang, S., Zhang, P., Chen, Q. F., & He, X. T. (2016) · Scientific Reports · doi:10.1038/srep20623 · Cited by 8
Linearly Stabilized Schemes for the Time Integration of Stiff Nonlinear PDEs
Chow, K., & Ruuth, S. J. (2021) · Journal of Scientific Computing · doi:10.1007/s10915-021-01477-0 · Cited by 10
“Amongst these are methods based on scaling and squaring, Padé approximants [20, 14], and Krylov subspace methods [15, 29, 30].”
MethodSteward, J., Román, J. E., Daviña, A. L., & Aksoy, A. (2018) · Monthly Weather Review · doi:10.1175/mwr-d-18-0022.1 · Cited by 8
“3.2 of the AMS LATEX template 1 ABSTRACT Recently, the serial approach to solving the Square-Root Ensemble Kalman Filter (ESRF) equations in the presence of covariance localization was found to depend on the order of observations.”
MethodInfluentialRobust Linear Stability Analysis and a New Method for Computing the Action of the Matrix Exponential
Rostami, M. W., & Xue, F. (2018) · SIAM Journal on Scientific Computing · doi:10.1137/17m1132537 · Cited by 9
“Many algorithms, such as short-term recurrence polynomial approximations [1, 3, 6, 7, 8, 35] and polynomial/rational Krylov-type methods [20, 22, 27, 28, 33, 36], have been developed to approximate ev without constructing e (typically dense even if A is sparse).”
BackgroundComputing the matrix sine and cosine simultaneously with a reduced number of products
Seydaoğlu, M., Bader, P., Blanes, S., & Casas, F. (2021) · Applied Numerical Mathematics · doi:10.1016/j.apnum.2021.01.009 · Cited by 11
An Explicit One-Step Method for Stiff Problems
Novati, P. (2003) · Computing · doi:10.1007/s00607-003-0021-7 · Cited by 8
“…for (1), the so called exponential integrators, based on the polynomial approximation of the evolution operator exp(hA), where h is the step size, by means of a Krylov projection method (see e.g. [2], [3]), a series expansion method ([1], [5], [6], [10]), or an interpolation method ([4], [7]).”
MethodEstimation of u T ƒ( A ) v for large‐scale unsymmetric matrices
Guo, H., & Renaut, R. A. (2003) · Numerical Linear Algebra with Applications · doi:10.1002/nla.334 · Cited by 8
“In Reference [9], which deals with Krylov subspace methods for matrix exponentials, general upper bounds of ‖f(A)v1 − Vf(H)e1‖ were estimated.”
BackgroundMethodapproximation for the linear time-dependent Schrodinger equation
Bader, P., Iserles, A., Kropielnicka, K., & Singh, P. (2012) · Cited by 8
Approximating functions of a large sparse positive definite matrix using a spectral splitting method
Ilić, M., & Turner, I. (2005) · ANZIAM Journal · doi:10.21914/anziamj.v46i0.972 · Cited by 8
“Druskin and Knizhnerman [5] and Hochbruck and Lubich [7] use the approximation f (A)v ≈ Qmf (Hm) e1 , v̂ = Qme1 where AQm = QmHm + βmq̂m+1e T m”
BackgroundMatrix product state based band Lanczos solver for quantum cluster approaches
Paeckel, S., Köhler, T., Manmana, S. R., & Lenz, B. (2025) · Physical review. B./Physical review. B · doi:10.1103/tjnr-kqmk · Cited by 8
“…exponential e − i ˆ Hτ | ψ ⟩ to the Green’s function. the Here, δR D ( τ ) denotes generalized residual introduced by Hochbruck and Lubich 39,69,70 , which bounds the actual approximation error of the action of the operator exponential via δR D ( τ ) ≤ ϵ D , and an estimation for ϵ D is…”
Inexact shift-invert Arnoldi method for evolution equations
Hashimoto, Y., & Nodera, T. (2016) · ANZIAM Journal · doi:10.21914/anziamj.v58i0.10766 · Cited by 7
“Various methods for computing the matrix exponential and φ-functions were introduced [5, 6, 14, 18, 19, 20, 21].”
MethodSixth-order schemes for laser–matter interaction in the Schrödinger equation
Singh, P. (2019) · The Journal of Chemical Physics · doi:10.1063/1.5065902 · Cited by 7
“skew-Hermitian matrix is available[17], ∥eAv − VmemV mv ∥∥ 2 ≤ 12e−‖A‖2/(4m) ( e ‖A‖ 2m )m , m ≥ ‖A‖ .”
BackgroundExponential Time Differencing Method for a Reaction- Diffusion System with Free Boundary
Liu, S., & Liu, X. (2023) · Communications on Applied Mathematics and Computation · doi:10.1007/s42967-023-00261-1 · Cited by 7
“A few state-of-the-art algorithms to efficiently evaluate linear combinations of the matrix function k ( A ) on vectors v k are presented in [1, 11, 22, 27, 45, 48].”
A new approach for determining the time step when propagating with the Lanczos algorithm
Mohankumar, N., & Carrington, T. (2010) · Computer Physics Communications · doi:10.1016/j.cpc.2010.07.020 · Cited by 7
Error bounds for the Arnoldi method: a set of extreme eigenpairs
Knizhnerman, L. (1999) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(99)00122-6 · Cited by 7
Nonlinear response to electric field in extended Hubbard models
Esfahani, D. N., Covaci, L., & Peeters, F. M. (2014) · Physical Review B · doi:10.1103/physrevb.90.205121 · Cited by 7
Exponential Integrators for Semi-linear Parabolic Problems with Linear Constraints
Altmann, R., & Zimmer, C. (2020) · Differential-algebraic equations forum · doi:10.1007/978-3-030-53905-4_5 · Cited by 7
Efficient implementation of partitioned stiff exponential Runge-Kutta methods
Narayanamurthi, M., & Sandu, A. (2020) · Applied Numerical Mathematics · doi:10.1016/j.apnum.2020.01.010 · Cited by 8
Adaptive Exponential Time Integration of the Navier-Stokes Equations
Li, S., Ju, L., & Si, H. (2020) · AIAA SciTech Forum · doi:10.2514/6.2020-2033 · Cited by 7
On the stability of exponential integrators for non-diffusive equations
Buvoli, T., & Minion, M. L. (2022) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2022.114126 · Cited by 7
Fourth Order Conservative Exponential Methods for Linear Evolution Equations
Lu, Y. Y. (2000) · BIT Numerical Mathematics · doi:10.1023/a:1022300720565 · Cited by 7
Karle, C., Schweitzer, J., Hochbruck, M., & Spatschek, K. (2008) · Journal of Computational Physics · doi:10.1016/j.jcp.2008.04.024 · Cited by 7
“An alternative is to use Krylov subspace methods such as the symmetric Lanczos process [18,19].”
MethodSelf-citationSolving the linear semiclassical Schrödinger equation on the real linePreprint
Iserles, A., Kropielnicka, K., Schratz, K., & Webb, M. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2102.00413 · Cited by 7
“As a result, a Krylov subspace with a miniscule dimension can be used (Hochbruck & Lubich 1997).”
Resource Optimization for Quantum Dynamics with Tensor Networks: Quantum and Classical Algorithms
Dwivedi, A., Lopez-Ruiz, M. A., & Iyengar, S. S. (2024) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.4c03407 · Cited by 6
Propagators for Quantum-Classical Models: Commutator-Free Magnus Methods
Pueyo, A. G., Blanes, S., & Castro, A. (2020) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.9b01031 · Cited by 9
Honecker, A., Richter, Schnack, & Wietek (2020) · Condensed Matter Physics · doi:10.5488/cmp.23.43712 · Cited by 6
TimeEvolver: A program for time evolution with improved error bound
Michel, M., & Zell, S. (2022) · Computer Physics Communications · doi:10.1016/j.cpc.2022.108374 · Cited by 8
“A possibly incomplete list of relevant studies includes [3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13], where it is important to mention that these publications have a wider scope than the present paper in that they deal with the exponentiation of a generic sparse matrix.”
BackgroundMartínez, P. A., Vock, T., Kharchi, L. R., Pedroza-Montero, J. N., Wu, X., Hasnaoui, K., & de la Lande, A. (2023) · Computer Physics Communications · doi:10.1016/j.cpc.2023.108946 · Cited by 6
Metadata
- Authors
- Hochbruck, M., & Lubich, C.
- Affiliations
- University of Tübingen (DE)
- Venue
- SIAM Journal on Numerical Analysis
- Published
- 1997-10
- Volume
- 34
- Issue
- 5
- Pages
- 1911-1925
- ISSN
- 0036-1429 (ISSN-L)
- 1095-7170
- OpenAlex
- W1984347942
- Cited by
- 795
- References
- 30
- Citations by year
- 2026: 27 · 2025: 23 · 2024: 19 · 2023: 23 · 2022: 23 · 2021: 37 · 2020: 42 · 2019: 41 · 2018: 46 · 2017: 41 · 2016: 42 · 2015: 32 · 2014: 44 · 2013: 44 · 2012: 30
- FWCI
- 14.18
- Type
- journal article
- Language
- en
- Open access
- green
- doi.org
- Licence
- other-oa
- Locations
- SIAM Journal on Numerical Analysis (publishedVersion)
- Repository KITopen (Karlsruhe Institute of Technology) (publishedVersion)
- KITopen (other-oa)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Matrix Theory and Algorithms
- Physical Sciences › Mathematics › Numerical Analysis › Numerical Solvers for Ordinary Differential Equations
- Physical Sciences › Engineering › Computational Mechanics › Advanced Numerical Methods in Computational Mathematics
- Keywords
- matrix exponential, Krylov subspace methods, Arnoldi method, Lanczos method, functional calculus, error bounds, biconjugate gradient method, numerical range, pseudospectra, superlinear convergence, stiff ordinary differential equations, time integration methods, nonlinear differential equations, Jacobian matrix
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.