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 501–600 of 810
Image denoising by random walk with restart Kernel and non-subsampled contourlet transform
Liu, G., Zeng, X., & Liu, Y. (2012) · IET Signal Processing · doi:10.1049/iet-spr.2010.0265 · Cited by 6
Mandt, S., Feiguin, A. E., & Manmana, S. R. (2013) · Physical Review A · doi:10.1103/physreva.88.043643 · Cited by 6
Fischer, T. M. (2017) · Linear Algebra and its Applications · doi:10.1016/j.laa.2017.05.042 · Cited by 8
Reduced Order Modeling for Time-Dependent Optimization Problems with Initial Value Controls
Heinkenschloss, M., & Jando, D. (2018) · SIAM Journal on Scientific Computing · doi:10.1137/16m1109084 · Cited by 6
“Finally, since the solution of dynamical systems (1.1b), (1.1c) is related to the matrix exponential, one could think about using approximation techniques for the matrix exponential, such as those described, e.g., in Caliari et al. [10], Frommer and Simoncini [13], or Hochbruck and Lubich [22].”
BackgroundLiu, S., & Liu, X. (2019) · Discrete and Continuous Dynamical Systems - B · doi:10.3934/dcdsb.2019176 · Cited by 6
“The flexibility of representation of IIF method allows either direct calculation of the exponentials of matrices, or the use of Krylov subspace [8, 22, 24, 25, 30, 41] for non-constant diffusion coefficients or/with moving boundaries”
MethodPartitioned exponential methods for coupled multiphysics systems
Narayanamurthi, M., & Sandu, A. (2020) · Applied Numerical Mathematics · doi:10.1016/j.apnum.2020.10.020 · Cited by 6
Nonoverlapping Localized Exponential Time Differencing Methods for Diffusion Problems
Hoang, T., Ju, L., & Wang, Z. (2020) · Journal of Scientific Computing · doi:10.1007/s10915-020-01136-w · Cited by 7
Krylov Subspace Residual and Restarting for Certain Second Order Differential Equations
Botchev, M. A., Knizhnerman, L., & Schweitzer, M. (2023) · SIAM Journal on Scientific Computing · doi:10.1137/22m1503300 · Cited by 7
Zhang, R., Zhu, J., Li, X., Loula, A. F. D., & Yu, X. (2015) · Applied Mathematical Modelling · doi:10.1016/j.apm.2015.12.038 · Cited by 6
Solution of f(A)x = b with Projection Methods for the Matrix A
van der Vorst, H. A. (2000) · Lecture notes in computational science and engineering · doi:10.1007/978-3-642-58333-9_2 · Cited by 6
Locally exact modifications of numerical integratorsPreprint
Cieśliński, J. L. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1101.0578 · Cited by 6
Geometric Integrators for Schrödinger Equations
Bader, P. (2014) · RiuNet (Universitat Politècnica de València) · doi:10.4995/thesis/10251/38716 · Cited by 9
“In a refinement of the results by Hochbruck & Lubich [71], cf.”
ResultOn convergence of waveform relaxation for nonlinear systems of ordinary differential equations
Botchev, M. A. (2024) · CALCOLO · doi:10.1007/s10092-024-00578-0 · Cited by 5
“Typically matrix function evaluations within exponential integrators are carried out by special linear algebra iterative procedures (often these are Krylov subspace or Chebyshev polynomial methods) [14, 31–36].”
Paeckel, S. (2026) · Physical Review Letters · doi:10.1103/bx76-hps4 · Cited by 8
Resource Assessment of Classical and Quantum Hardware for Post-Quench Dynamics
Vovrosh, J., Mendes-Santos, T., Mamann, H., Bidzhiev, K., Hayes, F. J., Alves, B. X. R., Béguin, L., Dalyac, C., & Dauphin, A. (2026) · PRX Energy · doi:10.1103/kfy5-q531 · Cited by 6
Approximate Exponential Integrators for Time-Dependent Equation-of-Motion Coupled Cluster Theory
Williams‐Young, D. B., Yuwono, S. H., DePrince, A. E., & Yang, C. (2023) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.3c00911 · Cited by 5
“Although tighter bounds can be found, 40 the bound given in (23) is more instructive.”
BackgroundMethodInfluentialEnergy-based approximation of linear systems with polynomial outputs
Balicki, L., & Gugercin, S. (2025) · Systems & Control Letters · doi:10.1016/j.sysconle.2025.106145 · Cited by 5
“If, on the other hand, the dimension of the problem does not allow for computing a full decomposition of A , one typically re-sorts to Krylov subspace methods to compute the application of the matrix exponential to a vector [26].”
Grigori, L., Kreßner, D., Shao, N., & Simunec, I. (2026) · SIAM Journal on Scientific Computing · doi:10.1137/26m1841641 · Cited by 5
Li, P., Fu, X., Wang, C., Yu, H., Lin, D., & Xing, F. (2015) · IEEE Power Engineering Society General Meeting · doi:10.1109/pesgm.2015.7285811 · Cited by 5
“Operator action on arbitrary vector can then be approximated as [7][8]: h ≈ ‖ ‖ h , = 0,1,2, .”
BackgroundMethodPindza, E., & Maré, E. (2013) · Journal of Applied Mathematics and Physics · doi:10.4236/jamp.2013.17002 · Cited by 5
“Saad [28], and Hochbruck and Lubich [29] introduced Kyrlov methods to compute -functions.”
MethodInfluentialNew efficient substepping methods for exponential timestepping
Lord, G. J., & Stone, D. (2017) · Applied Mathematics and Computation · doi:10.1016/j.amc.2017.02.052 · Cited by 5
“Bounds on K m n +1 can be found in for example [20,21] .”
A shifted block FOM algorithm with deflated restarting for matrix exponential computations
Wu, G., Pang, H., & Sun, J.-L. (2018) · Applied Numerical Mathematics · doi:10.1016/j.apnum.2018.01.015 · Cited by 6
Learning Linear Assignment Flows for Image Labeling via Exponential Integration
Zeilmann, A., Petra, S., & Schnörr, C. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-75549-2_31 · Cited by 5
Rester, B., Lambers, J. V., & Jordan, P. M. (2023) · International Journal of Non-Linear Mechanics · doi:10.1016/j.ijnonlinmec.2023.104506 · Cited by 5
Exponentiation of parametric Hamiltonians via unitary interpolation
Schilling, M., Preti, F., Müller, M. M., Calarco, T., & Motzoi, F. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.043278 · Cited by 5
“In the case of quantum state propagation, one often turns to Krylov subspace methods [14].”
Semi-Lagrangian multistep exponential integrators for index 2 differential–algebraic systems
Celledoni, E., & Kometa, B. K. (2011) · Journal of Computational Physics · doi:10.1016/j.jcp.2011.01.036 · Cited by 7
Dual diffusion model of spreading activation for content-based image retrieval
Kosinov, S., Marchand‐Maillet, S., Kozintsev, I. V., Dulong, C., & Pun, T. (2006) · Multimedia Information Retrieval · doi:10.1145/1178677.1178686 · Cited by 6
Approximation of the matrix exponential operator by a structure-preserving block Arnoldi-type method
Archid, A., & Bentbib, A. H. (2013) · Applied Numerical Mathematics · doi:10.1016/j.apnum.2012.11.008 · Cited by 5
Mora, C. M., Fernandez, J. C., & Biscay, R. (2018) · Journal of Computational Physics · doi:10.1016/j.jcp.2018.03.045 · Cited by 5
Efficient approximation of functions of some large matrices by partial fraction expansions
Bertaccini, D., Popolizio, M., & Durastante, F. (2018) · International Journal of Computer Mathematics · doi:10.1080/00207160.2018.1533123 · Cited by 6
A new Krylov subspace method based on rational approximation to solve stiff burnup equation
Li, X., & Cai, J. (2018) · Annals of Nuclear Energy · doi:10.1016/j.anucene.2018.04.005 · Cited by 5
A hybrid method for stiff reaction–diffusion equations
Qiu, Y., Chen, W., & Nie, Q. H. (2019) · Discrete and Continuous Dynamical Systems - B · doi:10.3934/dcdsb.2019144 · Cited by 5
“For non-constant diffusion coefficients, Krylov-ETD and Krylov-IIF methods [39, 3, 19, 20, 30] were developed to reduce the computational cost and storage associated with exponential matrices by utilizing Krylov subspace approximation [38, 9, 13].”
MethodNumerical methods for differential linear matrix equations via Krylov subspace methods
Hached, M., & Jbilou, K. (2019) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2019.112674 · Cited by 5
An Elliptic Local Problem with Exponential Decay of the Resonance Error for Numerical Homogenization
Assyr Abdulle, A., Arjmand, D., & Paganoni, E. (2023) · Multiscale Modeling and Simulation · doi:10.1137/21m1452123 · Cited by 5
Orbitally selective resonant photodoping to enhance superconductivity
Tang, T., Wang, Y., Moritz, B., & Devereaux, T. (2021) · Physical review. B./Physical review. B · doi:10.1103/physrevb.104.174516 · Cited by 7
Jiang, W., Ederer, M., Donsa, S., Feist, J., Březinová, I., Lemell, C., & Burgdörfer, J. (2023) · Physical Review A · doi:10.1103/physreva.108.023102 · Cited by 5
Wu, G., Zhang, L., & Xu, T.-T. (2015) · Advances in Computational Mathematics · doi:10.1007/s10444-015-9433-0 · Cited by 7
“1 that the residual is [11, 12, 31]: rk(t) = −Ayk(t) − y′k(t) = −hk+1,k [ ek exp(−tHk)βe1 ] vk+1, (2.”
BackgroundMethodInfluentialSolution of Time-Dependent PDE Through Component-wise Approximation of Matrix Functions
Lambers, J. V. (2011) · Aquila Digital Community (University of Southern Mississippi) · Cited by 5
EXPODE -- Advanced Exponential Time Integration Toolbox for MATLABPreprint
Jansing, G. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1404.4580 · Cited by 5
“This can be approximated within a Krylov subspace with respect to J and v , see [4, 9].”
Rational Krylov subspace methods for phi-functions in exponential integrators
Göckler, T. (2014) · Repository KITopen (Karlsruhe Institute of Technology) · doi:10.5445/ir/1000043647 · Cited by 13
Wang, Q. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2509.03496 · Cited by 12
“Polynomial approximations of the exponential functions e x and e − x and their applications were studied in [HL97, OSV12, SV14, AA22].”
Generalized Averaged Gauss Quadrature Rules: A Survey
Djukić, D. L., Djukić, R. M. M., Reichel, L., & Spalević, M. M. (2025) · Mathematics · doi:10.3390/math13193145 · Cited by 4
Analysis of a Chebyshev-type pseudo-spectral scheme for the nonlinear Schrödinger equation
Shindin, S., Parumasur, N., & Govinder, S. (2017) · Applied Mathematics and Computation · doi:10.1016/j.amc.2017.03.005 · Cited by 4
Randomized block-Krylov subspace methods for low-rank approximation of matrix functions
Persson, D., Chen, T., & Musco, C. (2026) · Linear Algebra and its Applications · doi:10.1016/j.laa.2026.03.029 · Cited by 4
Lambers, J. V. (2012) · Numerical Linear Algebra with Applications · doi:10.1002/nla.1831 · Cited by 4
“Similarly, Krylov subspace methods based on exponential in tegrators, such as those described in [16, 17] yield approximate solutions that are equal to a polynomial of A times a vector.”
MethodSolving parameter estimation problems with discrete adjoint exponential integrators
Römer, U., Narayanamurthi, M., & Sandu, A. (2018) · Optimization methods & software · doi:10.1080/10556788.2018.1448087 · Cited by 7
“It has been shown that for certain kinds of problems, Krylov-based approximation of matrix exponential products converge faster than the corresponding Krylovbased linear system solves [26].”
BackgroundMethodOptical absorption spectroscopy in hybrid systems of plasmons and excitons
Lai, C.-Y., Trugman, S. A., & Zhu, J. (2019) · Nanoscale · doi:10.1039/c8nr02310g · Cited by 4
Parallel exponential time differencing methods for geophysical flow simulations
Lan, R., Leng, W., Wang, Z., Ju, L., & Gunzburger, M. (2021) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2021.114151 · Cited by 4
“Thanks to the progress in computer science and numerical linear algebra [7, 29, 15, 31, 22, 16], this method has received a renewed interest in solving various large systems of stiff semilinear or nonlinear systems [4, 17, 37].”
MethodExponential Runge-Kutta Parareal for non-diffusive equations
Buvoli, T., & Minion, M. L. (2023) · Journal of Computational Physics · doi:10.1016/j.jcp.2023.112623 · Cited by 4
A New Rational Approximation Algorithm via the Empirical Interpolation Method
Li, A., & Li, Y. (2025) · SIAM Journal on Scientific Computing · doi:10.1137/24m1674832 · Cited by 4
A block Krylov subspace time-exact solution method for linear ODE systems
Botchev, M. A. (2012) · Memorandum / Department of Applied Mathematics · Cited by 4
A structure preserving approximation method for Hamiltonian exponential matrices
Agoujil, S., Bentbib, A. H., & Kanber, A. (2011) · Applied Numerical Mathematics · doi:10.1016/j.apnum.2011.03.006 · Cited by 4
Wang, C., Fu, X., Li, P., Yu, H., Ding, C., Song, G., & Peng, F. (2014) · IEEE Power Engineering Society General Meeting · doi:10.1109/pesgm.2014.6939291 · Cited by 4
“The computation cost of ev can be reduced using Krylov subspace approximations [9][10][11][12].”
MethodOn Stochastic Confidence of Information Spread in Opportunistic Networks
Kim, Y., Lee, K., & Shroff, N. B. (2015) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2015.2431711 · Cited by 5
“Its substantial performance gain has been justified by theoretical characterizations as well as practical studies [21], [22], [25].”
BackgroundMethodObserving electron-correlation features in two-photon double ionization of helium
Jiang, W., Nagele, S., & Burgdörfer, J. (2017) · Physical Review A · doi:10.1103/physreva.96.053422 · Cited by 4
Enhanced matrix function approximation
Eshghi, N., Reichel, L., & Spalević, M. M. (2018) · ETNA - Electronic Transactions on Numerical Analysis · doi:10.1553/etna_vol47s197 · Cited by 4
“1) include the solution of systems of ordinary differential equations [5, 10], network analysis [2, 12], and the solution of ill-posed problems [3].”
BackgroundImproved Krylov Precise Time Integration Algorithm for Structural Dynamic Equations
Chen, Z. L. (2019) · AIAA Journal · doi:10.2514/1.j058121 · Cited by 4
Why Improving the Accuracy of Exponential Integrators Can Decrease Their Computational Cost?
Cano, B., & Reguera, N. (2021) · Mathematics · doi:10.3390/math9091008 · Cited by 5
“More precisely, in [3,5,6] it is stated that, for symmetric matrices, only when m ≥ √ τ‖B‖ superlinear convergence is guaranteed.”
BackgroundEstimating the error in matrix function approximations
Eshghi, N., & Reichel, L. (2021) · Advances in Computational Mathematics · doi:10.1007/s10444-021-09882-7 · Cited by 4
Schweitzer, M. (2022) · ETNA - Electronic Transactions on Numerical Analysis · doi:10.1553/etna_vol55s438 · Cited by 4
An Extended-Rational Arnoldi Method for Large Matrix Exponential Evaluations
Bentbib, A. H., Ghomari, M. E., & Jbilou, K. (2022) · Journal of Scientific Computing · doi:10.1007/s10915-022-01808-9 · Cited by 4
“In the context of approximating the action of a matrix function f (A) on some vector v ∈ Rn , several polynomial methods [15, 20, 29] based on the standard Arnoldi and Lanczos Krylov methods have been proposed.”
MethodLoschmidt-echo approach to error estimation in Krylov-subspace approximation
Ruffinelli, J., Fortes, E. M., Wisniacki, D. A., & Larocca, M. (2022) · Physical Review A · doi:10.1103/physreva.106.042423 · Cited by 4
Hu, X., Wang, W., Mao, M., & Cao, J. (2024) · Numerical Algorithms · doi:10.1007/s11075-024-01940-7 · Cited by 4
“…non-exponential ones for stiff systems and highly oscillatory problems, and its implementation depends on the computing the product of an exponential function with a vector, with the new methods for evaluating it (see, e.g., [7, 8]), exponential integrators have been received more attention [9–20].”
BackgroundMethodIterative Methods for Computing Eigenvalues and Exponentials of Large Matrices
Zhang, P. (2009) · UKnowledge (University of Kentucky) · Cited by 4
Chen, Q., Zhao, W., & Wong, N. (2014) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1109/aspdac.2014.6742900 · Cited by 4
“It is computed by the Krylov subspace method [5, 9] using the Krylov subspace Km (A, v) in (1) constructed by the Arnoldi process”
MethodApproximate inverse preconditioner by computing approximate solution of Sylvester equation
Kaabi, A., Kerayechian, A., & Toutounian, F. (2005) · Applied Mathematics and Computation · doi:10.1016/j.amc.2005.01.006 · Cited by 4
The Krylov Subspace Methods for the Computation of Matrix Exponentials
Wang, H. (2015) · UKnowledge (University of Kentucky) · Cited by 4
The Joy and Pain of Skew Symmetry
Iserles, A. (2016) · Foundations of Computational Mathematics · doi:10.1007/s10208-016-9321-0 · Cited by 4
Krylov integrators for Hamiltonian systems
Eirola, T., & Koskela, A. (2018) · BIT Numerical Mathematics · doi:10.1007/s10543-018-0732-y · Cited by 4
Sidje, R. B., Burrage, K., & Philippe, B. (2003) · Lecture notes in computer science · doi:10.1007/3-540-44863-2_68 · Cited by 4
The infinite Arnoldi exponential integrator for linear inhomogeneous ODEsPreprint
Koskela, A., & Elias Jarlebring, A. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1502.01613 · Cited by 4
“Algorithms for (3.1) based on Krylov methods are typically constructed as follows, see [11] and references therein for further details.”
InfluentialLocal Exponential Methods: a domain decomposition approach to exponential time integration of PDEsPreprint
Bonaventura, L. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1505.02248 · Cited by 4
“In all the tests, the exponential Euler-Rosenbrock methods proposed in [14] have been employed, which reduce in the linear case to the exponential Euler method.”
MethodKnizhnerman, L. (2008) · Математический сборник · doi:10.4213/sm3777 · Cited by 4
Explicit Exponential Rosenbrock Methods and their Application in Visual ComputingPreprint
Luân, V. T., & Michels, D. L. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1805.08337 · Cited by 4
“At the time while solving linear systems (I−αhJ)x= v with some Jacobian matrix J (required when using implicit methods) is generally only linear convergence, it was realized that Krylov subspace methods for approximating the action of a matrix exponential on a vector, ehJv, offer superlinear convergence (see [21]).”
Bhatt, H., & Chowdhury, A. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1911.12183 · Cited by 4
“searchers have proposed different techniques to compute these phi functions. Some of the well-known techniques include (i) the rational approximation of ’ (kL) [7, 8] (ii) the Krylov subspace method [16, 39], and (iii) polynomial approximation of ’ (kL) [9, 38]. This study focuses on the rational approximation of ’ (k…”
MethodA family of high-order accurate contour integral methods for strongly continuous semigroupsPreprint
Horning, A. J., & Gerlach, A. R. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2408.07691 · Cited by 4
Positivity Preserving Exponential Integrators for Differential Riccati Equations
Chen, H., & Borzì, A. (2023) · Journal of Scientific Computing · doi:10.1007/s10915-023-02275-6 · Cited by 3
“For computing matrix exponential or evaluating products of matrix exponential with vectors, there exist a number of efficient algorithms including contour integration methods [31], scaling and squaring methods [2] and Krylov subspace methods [15].”
MethodEfficient exponential Rosenbrock methods till order four
Cano, B., & Moreta, M. J. (2024) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2024.116158 · Cited by 3
Nobari, E., & Hosseini, S. M. (2010) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2009.12.027 · Cited by 3
“So the computation of (exp A) · v or (exp A) · B, (where A and B are matrices and v is a vector), as an important step, has been investigated by many authors (see [1,3,10]).”
BackgroundThe improved Hagedorn wavepacket method for semiclassical Schrödinger equation
Li, X., & Xiao, A. (2014) · Advances in Complex Systems · doi:10.1142/s1793962314500135 · Cited by 3
Convergence rates for inverse-free rational approximation of matrix functions
Jagels, C., Mach, T., Reichel, L., & Vandebril, R. (2016) · Linear Algebra and its Applications · doi:10.1016/j.laa.2016.08.029 · Cited by 5
Time-dependent nonequilibrium soft x-ray response during a spin crossover
van Veenendaal, M. (2018) · Physical review. B./Physical review. B · doi:10.1103/physrevb.97.125108 · Cited by 3
Time adaptive Zassenhaus splittings for the Schrödinger equation in the semiclassical regime
Auzinger, W., Hofstätter, H., Koch, O., Kropielnicka, K., & Singh, P. (2019) · Applied Mathematics and Computation · doi:10.1016/j.amc.2019.06.064 · Cited by 3
“The number of Lanczos iterations are chosen automatically to meet the accuracy requirements using the a priori error bounds of [21].”
MethodA block J-Lanczos method for Hamiltonian matrices
Archid, A., Bentbib, A. H., & Agoujil, S. (2020) · ETNA - Electronic Transactions on Numerical Analysis · doi:10.1553/etna_vol52s26 · Cited by 3
“The use of Krylov subspace approaches in this context has been proposed in the literature; see [9], [10], [12], [13], [16], [17] [20].”
MethodA center compact scheme for the Shallow Water equations on the sphere
Brachet, M., & Croisille, J. (2022) · Computers & Fluids · doi:10.1016/j.compfluid.2021.105286 · Cited by 3
Bhatt, H. (2022) · International Journal of Computer Mathematics · doi:10.1080/00207160.2022.2079081 · Cited by 3
“These techniques include the explicit computation of φμ(kA) proposed by Kassam and Trefethen [24] by using contour integration and the computation of the matrix–vector product φμ(kA)u without the explicit computation of φμ(kA) by utilizing the rational approximation of φμ(kA) [5,6,25], the Krylov subspace method [20,4…”
MethodKrylov subspace methods to accelerate kernel machines on graphs
Erb, W. (2023) · Advances in Computational Science and Engineering · doi:10.3934/acse.2023003 · Cited by 3
Geng, L., Liang, H., Lin, Z.-Y., & Peng, L.-Y. (2022) · Physical Review A · doi:10.1103/physreva.107.053115 · Cited by 4
Wang, B., Hu, X., & Wu, X. (2023) · International Journal of Computer Mathematics · doi:10.1080/00207160.2023.2294432 · Cited by 3
“The main theme of this paper is two new classes of exponential Runge–Kutta (ERK) in-tegrators and we will focus on explicit methods.”
Cost-reduction implicit exponential Runge–Kutta methods for highly oscillatory systems
Hu, X., Wang, W., Wang, B., & Fang, Y. (2024) · Journal of Mathematical Chemistry · doi:10.1007/s10910-024-01646-0 · Cited by 3
“Exponential Runge–Kutta methods have the relatively complete theory and wide applications [11, 16–20, 22–25, 28, 33].”
MethodExponential time propagators for elastodynamics
Pari, P., Kanungo, B., & Gavini, V. (2024) · Journal of the Mechanics and Physics of Solids · doi:10.1016/j.jmps.2024.105871 · Cited by 3
A Low-Memory Lanczos Method with Rational Krylov Compression for Matrix Functions
Casulli, A. A., & Simunec, I. (2025) · SIAM Journal on Scientific Computing · doi:10.1137/24m1644699 · Cited by 3
A Multigrid Block Krylov Subspace Spectral Method for Variable-Coefficient Elliptic PDE
Lambers, J. V., & Korsunsky, A. M. (2010) · AIP conference proceedings · doi:10.1063/1.3366505 · Cited by 3
“edu It has been shown in these references that KSS methods, by employing different approximations of the solution operator for each Fourier coefficient of the solution, achieve higher-order accuracy in time than other Krylov subspace methods (see, for example, [10]) for stiff systems of ODE, and, as shown in [12], the…”
MethodRahrovani, S., Abrahamsson, T. J. S., & Modin, K. (2014) · Conference proceedings of the Society for Experimental Mechanics · doi:10.1007/978-3-319-04522-1_25 · Cited by 3
Numerical analysis of the Caughley model from ecology
Shindin, S., & Parumasur, N. (2010) · Mathematical communications · Cited by 3
Model Checking Markov Chains Using Krylov Subspace Methods: An Experience Report
Dulat, F., Katoen, J.-P., & Nguyen, V. Y. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15784-4_8 · Cited by 3
“Attempts to explain this behavior have led to advances in determining stricter error bounds [23, 13].”
BackgroundDimensional Reductions for the Computation of Time–Dependent Quantum Expectations
Mazzi, G., & Leimkuhler, B. (2011) · SIAM Journal on Scientific Computing · doi:10.1137/100788148 · Cited by 3
“Examples of such methods are those based on expansion of the exponential in Krylov subspace [15, 16, 17, 18, 19].”
BackgroundMethodLocally exact modifications of discrete gradient schemes
Cieśliński, J. L. (2013) · Physics Letters A · doi:10.1016/j.physleta.2013.01.005 · Cited by 3
“Bf MSC 2000: 65P10; 65L12; 34K28 Key words and phrases: geometric numerical integration, exact discretization, locally exact methods, linearization-preserving integrators, exponential integrators, discrete gradient method, Hamiltonian systems”
MethodZhu, X., Li, C., & Gu, C. (2011) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2011.11.018 · Cited by 3
A Spectral Time-Domain Method for Computational Electrodynamics
Lambers, J. V., Simos, T. E., Psihoyios, G., & Tsitouras, C. (2009) · AIP conference proceedings · doi:10.1063/1.3241277 · Cited by 3
“It has been shown in these references that KSS methods, by employing different approximations of the solution operator for each Fourier component of the solution, achieve higher-order accuracy in time than other Krylov subspace methods (see, for example, [10]) for stiff systems of ODE, and, as shown in [11], they are…”
Method
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.