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 601–700 of 810
expint A matlab 1 package for exponential integrators
Teknisk-Naturvitenskapelige, N. (2005) · Cited by 3
From Low-Rank Approximation to a Rational Krylov Subspace Method for the Lyapunov Equation
Kolesnikov, D. A., & Oseledets, I. V. (2015) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/140992266 · Cited by 3
Cong, Y., & Li, D.-P. (2016) · Computers & Mathematics with Applications · doi:10.1016/j.camwa.2016.05.031 · Cited by 3
Grimm, V., & Göckler, T. (2017) · SIAM Journal on Numerical Analysis · doi:10.1137/15m104880x · Cited by 3
“Using this approximation space for the numerical solution of the discretized Schrödinger equation, it turns out that the approximation improves with respect to stability, but a substantial error reduction would just begin after nearly ‖τAN‖ iteration steps (see [19]), where ‖τAN‖ becomes large for fine space discretiz…”
Pricing High-Dimensional American Options Using Local Consistency Conditions
Schumacher, J. M., & Berridge, S. J. (2007) · Chapman & Hall/CRC handbooks of modern statistical methods · doi:10.1201/9781584889267.ch2 · Cited by 3
New matrix function approximations and quadrature rules based on the Arnoldi process
Eshghi, N., Mach, T., & Reichel, L. (2021) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2021.113442 · Cited by 3
Learning Linearized Assignment Flows for Image Labeling
Zeilmann, A., Petra, S., & Schnörr, C. (2023) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-022-01132-9 · Cited by 3
“Exponential integration [HL97, NW12], therefore, was used by [ZSPS20] for approximately evaluating (2.24), as sketched next.”
InfluentialSymplectic Runge-Kutta Methods
Feng, K., & Qin, M. (2010) · Springer eBooks · doi:10.1007/978-3-642-01777-3_8 · Cited by 3
Approximation Theory and the Design of Fast AlgorithmsPreprint
Sachdeva, S., & Vishnoi, N. K. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1309.4882 · Cited by 3
“Theorem 3.3 is implicit in the work by Hochbruck and Lubich [23].”
InfluentialKnizhnerman, L. (2008) · Sbornik Mathematics · doi:10.1070/sm2008v199n02abeh003915 · Cited by 3
Jiménez, J. C., & Salam, A. (2009) · Cited by 3
The Effect of Communication Topology on Scalar Field Estimation by Networked Robotic SwarmsPreprint
Ramachandran, R. K., & Berman, S. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1603.02381 · Cited by 3
“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.”
Wigner negativity in Krylov space and emergent semiclassicalityPreprint
Balasubramanian, V., Caputa, P., Parrikar, O., & Singh, V. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2607.01351 · Cited by 5
“At times much smaller than D , the projection onto the truncated Hilbert space does not have a significant effect on the time evolved state | ψ ( t ) ⟩ (see, for instance, theorem 2 in [52] for systems with bounded energy support).”
Integrating factor‐based time integrators for the Cahn–Hilliard equation
Garai, G., & Mandal, B. C. (2024) · Mathematical Methods in the Applied Sciences · doi:10.1002/mma.10113 · Cited by 2
“But nowadays having large scale computing system with emphasis on parallely compute matrix exponential [30, 31], and also Krylov subspace method to compute matrix exponential [32, 33], it is possible to compute matrix exponential for large matrices.”
A second-order dynamical low-rank mass-lumped finite element method for the Allen-Cahn equation
Yang, J., Yi, N., & Yin, P. (2026) · BIT Numerical Mathematics · doi:10.1007/s10543-025-01100-w · Cited by 2
“Several fast algorithms have been developed that reduce the complexity to O ( m γ ) with 2 γ ≤ 3 [26].”
Honecker, A., Zhitomirsky, M. E., Wietek, A., & Richter, J. (2026) · Zeitschrift für Naturforschung A · doi:10.1515/zna-2026-0016 · Cited by 2
“Nevertheless, we observe a clear and consistent enhancement of the m = 1 ∕ 2 step size in the region 0.52 ≲ J 2 ∕ J 1 ≲ 0.7, which we thus take as a first estimate for the stability region of the m = 1 ∕ 2 plateau.”
InfluentialFlexible exponential integration methods for large systems of differential equations
Li, D.-P., Cong, Y., & Xia, K. (2015) · Journal of Applied Mathematics and Computing · doi:10.1007/s12190-015-0919-1 · Cited by 2
A class of explicit one-step methods of order two for stiff problems
Novati, P. (2005) · Journal of Numerical Mathematics · doi:10.1515/156939505774286120 · Cited by 2
“[3], [6], [7]), a series expansion method ([2], [11], [12], [17]), or an”
Krylov Implicit Integration Factor Methods for Semilinear Fourth-Order Equations
Machen, M., & Zhang, Y. (2017) · Mathematics · doi:10.3390/math5040063 · Cited by 2
“For Krylov IIF schemes, by the analysis in [37,40], Krylov approximation errors for computing matrix exponentials decay exponentially with respect to the square of the Krylov subspace dimension M.”
MethodPindza, E., Youbi, F., Maré, E., & Davison, M. (2018) · Discrete and Continuous Dynamical Systems - S · doi:10.3934/dcdss.2019040 · Cited by 2
“Saad [35], and Hochbruck and Lubich [20] introduced Krylov methods to compute φ-functions.”
MethodPreconditioned Iterative Methods for Eigenvalue Counts
Vecharynski, E., & Yang, C. (2017) · Lecture notes in computational science and engineering · doi:10.1007/978-3-319-62426-6_8 · Cited by 2
“Similar to the Hermitian case, the matrix functional v ∗ h ( T ( A − τ I )) v can be viewed as an integral, such that where Γ is a contour that encloses the spectrum of T ( A − τ I ) and the bar denotes complex conjugation; see, e.g., [9].”
A study of defect-based error estimates for the Krylov approximation of φ-functions
Jawecki, T. (2021) · Numerical Algorithms · doi:10.1007/s11075-021-01190-x · Cited by 5
“approximation if the time step t in etAv is sufficiently small or the dimension of the Krylov subspace (i.e., the degree of the approximating matrix polynomial) is sufficiently large, see for instance [26]. The dimension of the Krylov subspace is limited in practice, and large time steps require a restart of the iterati…”
BackgroundQuantifying Uncertainty of Image Labelings Using Assignment Flows
Gonzalez-Alvarado, D., Zeilmann, A., & Schnörr, C. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-92659-5_29 · Cited by 2
“We overcome this numerical problem by using low-rank Krylov subspace approximation [27,14] that has shown to perform very well in connection with the linearized assignment flow [38,37].”
MethodEfficient low rank approximations for parabolic control problems with unknown heat source
Arjmand, D., & Ashyraliyev, M. (2024) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2024.115959 · Cited by 2
Simplified Explicit Exponential Runge-Kutta Methods Without Order Reduction
Moreta, B. C. A. M. J., & Moreta, M. J. (2024) · Journal of Computational Mathematics · doi:10.4208/jcm.2407-m2023-0131 · Cited by 2
Hu, X., Wang, W., & Fang, Y. (2024) · Mathematical Methods in the Applied Sciences · doi:10.1002/mma.10641 · Cited by 3
Restaino, L., Schnappinger, T., & Kowalewski, M. (2025) · The Journal of Chemical Physics · doi:10.1063/5.0250153 · Cited by 2
“The short iterative Lanczos scheme [48– 50] was used to propagate the nuclear wave packet and the Hamiltonian form eq.”
Gelß, P., Matera, S., Klein, R., & Schmidt, B. (2025) · The Journal of Chemical Physics · doi:10.1063/5.0258904 · Cited by 5
Hu, X., Fang, Y., & Wang, B. (2025) · Acta Mathematica Sinica English Series · doi:10.1007/s10114-025-4348-2 · Cited by 2
“Although the product of the matrix exponential and a vector is effectively evaluated by the Krylov subspace method [15, 20] or a Pad´e approximation (see, e.g., [4, 19, 35]), which still needs time-consuming.”
Exploring Exponential Runge-Kutta Methods: A Survey
Andò, A., Cangiotti, N., & Sensi, M. (2026) · Communications in Mathematical Research · doi:10.4208/cmr.2026-0024 · Cited by 2
“This fact was proved the following by Hochbruck and Lubich [42].”
A low cost Arnoldi method for large linear initial value problems
Novati, P. (2004) · International Journal of Computer Mathematics · doi:10.1080/00207160410001708814 · Cited by 2
A rational Krylov method for solving time-periodic differential equations
Moret, I., & Novati, P. (2007) · Applied Numerical Mathematics · doi:10.1016/j.apnum.2006.12.001 · Cited by 2
“Infact it deteriorates as the discretizations are refined, even dealing with entire functions (see [14]).”
BackgroundMethodComputation of matrix functions with deflated restarting
Gu, C., & Zheng, L. (2012) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2012.07.020 · Cited by 2
VUYST, F. D. (2016) · Advanced Modeling and Simulation in Engineering Sciences · doi:10.1186/s40323-016-0063-y · Cited by 2
“through Arnoldi orthogonalization iterations [12].”
Krylov Approximation of Linear ODEs with Polynomial Parameterization
Koskela, A., Elias Jarlebring, A., & Hochstenbach, M. E. (2016) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/15m1032831 · Cited by 2
“, [12, 13] for literature on Krylov approximations of matrix functions.”
Extended and rational Hessenberg methods for the evaluation of matrix functions
Ramezani, Z., & Toutounian, F. (2018) · BIT Numerical Mathematics · doi:10.1007/s10543-018-0742-9 · Cited by 2
“The main idea of this technique is reducing A to a small matrix Hm and evaluating f (Hm) by using one of the techniques discussed in [38]; see also [6,12,13,23,39,44,55].”
MethodHashimoto, Y., & Nodera, T. (2019) · Japan Journal of Industrial and Applied Mathematics · doi:10.1007/s13160-019-00347-5 · Cited by 2
A Comparison of Methods for Determining the Time Step When Propagating with the Lanczos Algorithm
Mohankumar, N., & Carrington, T. (2019) · Mathematics · doi:10.3390/math7111109 · Cited by 2
Wide-Area Monitoring of Large Power Systems Based on Simultaneous Processing of Spatio-Temporal Data
Barocio, E., Romero, J., Betancourt, R., Korba, P., & Sevilla, F. R. S. (2020) · Power systems · doi:10.1007/978-3-030-54275-7_7 · Cited by 2
Exponential Time Integrators for Unsteady Advection–Diffusion Problems on Refined Meshes
Botchev, M. A. (2021) · Lecture notes in computational science and engineering · doi:10.1007/978-3-030-76798-3_25 · Cited by 2
Inexact rational Krylov method for evolution equations
Hashimoto, Y., & Nodera, T. (2021) · BIT Numerical Mathematics · doi:10.1007/s10543-020-00829-w · Cited by 2
“Various methods for computing matrix φ-functions have been developed [3,8,11,21, 26,27,32].”
MethodExponential Rosenbrock Methods and Their Application in Visual Computing
Luân, V. T., & Michels, D. L. (2021) · Mathematics online first collections · doi:10.1007/978-3-030-76810-2_3 · Cited by 2
Global symplectic Lanczos method with application to matrix exponential approximation
Archid, A., & Bentbib, A. H. (2021) · Journal of mathematical modeling · doi:10.22124/jmm.2021.19045.1631 · Cited by 2
Schweitzer, M. (2022) · Linear Algebra and its Applications · doi:10.1016/j.laa.2022.10.005 · Cited by 2
Inexact rational Krylov subspace methods for approximating the action of functions of matrices
Xu, S., & Xue, F. (2023) · ETNA - Electronic Transactions on Numerical Analysis · doi:10.1553/etna_vol58s538 · Cited by 2
“A more reliable alternative stopping criterion is to evaluate upper bounds for the residual norm [21, 43, 63], especially for exponential-type functions.”
BackgroundAdaptive Vector Finite Element Methods for the Maxwell Equations
Harutyunyan, D. (2007) · University of Twente Research Information · doi:10.3990/1.9789036525084 · Cited by 4
“The choice j = 1 (also made in [100]) is appropriate since in most cases the Arnoldi process for matrix function evaluations exhibits a superlinear convergence [58, 100].”
BackgroundMethodAcceleration techniques for approximating the matrix exponential
Popolizio, M. (n.d.) · Cited by 2
Trustworthy Spacecraft Design Using Formal Methods
Nguyen, V. Y. (2013) · RWTH Publications (RWTH Aachen) · Cited by 4
Adaptive propagation of quantum few-body systems with time-dependent HamiltoniansPreprint
Cremon, J. C. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.7596 · Cited by 2
“elow since its main concepts are relevant also for time-dependent Hamiltonians, as discussed in the next section. For a more mathematical perspective on exponential integrators, see for example Refs. [26, 27, 28, 29]. It should be noted here that even if the method below is only applicable for Hamiltonians without an…”
BackgroundWang, B., & Wu, X. (2017) · arXiv (Cornell University) · Cited by 2
Haut, T. S., Babb, T., Martinsson, P., & Wingate, B. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1402.5168 · Cited by 2
“Common approaches for applying the exponential of skew-Hermitian operators include high-order time-stepping methods, scaling-and-squaring coupled with Pad´e approximations (cf. [14]) or Chebyshev polynomials (cf. [1]), and polynomial or rational Krylov methods (cf. [15] and [11]).”
Adaptive residual-time restarting for Krylov subspace matrix exponential evaluationsPreprint
Botchev, M. A., & Knizhnerman, L. (2019) · Keldysh Institute Preprints · doi:10.20948/prepr-2019-127 · Cited by 2
Assyr Abdulle, A., Arjmand, D., & Paganoni, E. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2007.10828 · Cited by 2
“The exponential matrix is not computed exactly, but it is approximated in the Krylov subspace generated by M h Ahg and computed by the Lanczos method (M h Ah is symmetric and positive definite) as proposed in [30].”
MethodPyProp - A Python Framework for Propagating the Time Dependent Schrödinger Equation
Birkeland, T. (2009) · NORA - Norwegian Open Research Archives · Cited by 5
A semiclassical Hilbert space for random matrix theoryPreprint
Bhattacharya, A., Parrikar, O., & Singh, V. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2608.23689 · Cited by 3
Double-shift-invert Arnoldi method for computing the matrix exponential
Hashimoto, Y., & Nodera, T. (2018) · Japan Journal of Industrial and Applied Mathematics · doi:10.1007/s13160-018-0309-9 · Cited by 1
“(2) is represented as: Various methods for computing the matrix exponential have been developed [4,6, 7,9,11,12].”
MethodCommutator-free Cayley methods
Wembe, B., Offen, C., Maslovskaya, S., Ober‐Blöbaum, S., & Singh, P. (2025) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2025.117184 · Cited by 1
Aceto, L., & Durastante, F. (2024) · Advances in Computational Mathematics · doi:10.1007/s10444-024-10202-y · Cited by 1
“Indeed, if A is symmetric one needs to work with a matrix that is similar to a skew-symmetric matrix and, as observed in [3, 4], polynomial Krylov approaches for the matrix exponential have indeed a slower convergence rate than in the symmetric case.”
InfluentialLow-rank exponential integrators for stiff differential Riccati equations
Chen, H., & Borzì, A. (2025) · Advances in Computational Mathematics · doi:10.1007/s10444-025-10228-w · Cited by 2
“For numerical algorithms on products of matrix exponentials with vectors, we mention scaling and squaring methods [3], contour integration methods [42], Krylov subspace methods [21] and we refer to the review [20] for additional references.”
Noniterative localized exponential time differencing methods for hyperbolic conservation laws
Doan, C.-K., Huynh, P.-T., & Hoang, T. (2025) · Advances in Computational Mathematics · doi:10.1007/s10444-025-10240-0 · Cited by 1
Wang, Y., Luo, M., Reumann, M., & Mendl, C. B. (2025) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.5c00525 · Cited by 1
“The combined application and compression procedure is illustrated in Fig.”
Probing the localization effects in Krylov basis
Kannan, J. B., Sreeram, P. G., Paul, S., Tekur, S. H., & Santhanam, M. S. (2025) · Physical review. E · doi:10.1103/kptz-cv7b · Cited by 2
“K-complexity was originally developed as a method for efficiently computing exponentials of matrices [16] but has since become a powerful tool for studying operator growth in quantum systems [6, 17–23].”
Heat operator approach to quantum stochastic thermodynamics in the strong-coupling regime
Mandal, S. P., Pandit, M., Mahadeviya, K., Mitchison, M. T., & Prior, J. (2026) · Physical Review Research · doi:10.1103/8plx-nfvq · Cited by 1
Li, Y., Li, J., & Zhang, Y. (2025) · Journal of Applied Mathematics and Computing · doi:10.1007/s12190-025-02674-y · Cited by 1
“A refined spatial grid is recommended for the high-plasma-frequency regime.”
Should Exponential Integrators Be Used for Advection-Dominated Problems?
Einkemmer, L. D., Hoang, T. T. H., & Ostermann, A. (2025) · Advances in Applied Mathematics and Mechanics · doi:10.4208/aamm.oa-2024-0226 · Cited by 1
Blanes, S. (2025) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2025.117090 · Cited by 2
Liu, Q., Herre, J.-N., Kennes, D. M., & Karrasch, C. (2026) · Physical review. B./Physical review. B · doi:10.1103/q4n3-r8n5 · Cited by 2
Xu, T., Kong, J., Zhou, T., Wang, Y., Tu, J., Azizi, A., Kirk, S. R., & Jenkins, S. (2026) · ACS Omega · doi:10.1021/acsomega.6c02067 · Cited by 1
Xin, Q., & Gu, X. (2026) · Journal of Computational Physics · doi:10.1016/j.jcp.2026.115095 · Cited by 1
An explicit sixth order Runge–Kutta method for simple Lawson integration
Golden, M. (2026) · Journal of Computational Mathematics and Data Science · doi:10.1016/j.jcmds.2026.100137 · Cited by 1
Approximation to Linear Algebraic Transition System
Zhang, Z., Wu, J.-Z., & Yang, H. (2012) · Communications in computer and information science · doi:10.1007/978-3-642-31837-5_49 · Cited by 1
Spectral Methods for Time-Dependent Variable-Coefficient PDE Based on Block Gaussian Quadrature
Lambers, J. V. (2010) · Lecture notes in computational science and engineering · doi:10.1007/978-3-642-15337-2_41 · Cited by 1
“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, [9]) for stiff systems of ODE, and they are also quite stable,…”
MethodApplication of Block Krylov Subspace Spectral Methods to Maxwell’s Equations
Lambers, J. V., Ao, S.-I., Chan, A. H. S., Katagiri, H., & Xu, L. (2009) · AIP conference proceedings · doi:10.1063/1.3256248 · Cited by 1
Adaptive DAE solving algorithm for power system transient simulation via matrix exponential operator
Li, P., Fu, X., Wang, C., Yu, H., Ding, C., Song, G., Zhao, J., Lin, D., & Xing, F. (2014) · Asia-Pacific Power and Energy Engineering Conference (APPEEC) · doi:10.1109/appeec.2014.7066054 · Cited by 1
“In our proposed method, Krylov subspace approximation is utilized to reduce the cost of computation in form of ev [8][9][10][11].”
MethodGlobally stable, highly parallelizable fast transient circuit simulation via faber series
Li, Y., Chen, Q., Weng, S.-H., Cheng, C., & Wong, N. (2012) · IEEE Interregional NEWCAS Conference (NEWCAS) · doi:10.1109/newcas.2012.6328985 · Cited by 1
ON COMPUTATION OF MATRIX LOGARITHM
Sherif, N., & Morsy, E. (2009) · Journal of applied mathematics & informatics · Cited by 1
Matrices, Moments and Quadrature: Applications to Time- Dependent Partial Differential Equations
Lambers, J. V., Cibotarica, A., & Palchak, E. M. (2016) · InTech eBooks · doi:10.5772/62247 · Cited by 1
“After m iterations, we obtain (21), from which we obtain an approximation where, as before, H m is upper Hessenberg (or tridiagonal of A is symmetric), and the columns of V m form an orthonormal basis for the Krylov subspace The accuracy of this approximation is discussed in [9].”
MethodMinimal krylov subspaces for dimension reduction
Lumsdaine, A., & Breuer, A. (2013) · Cited by 1
Li, D.-P., & Cong, Y. (2017) · Journal of Applied Analysis & Computation · doi:10.11948/2017085 · Cited by 2
“, [5, 8, 18, 29, 31] and the references given therein.”
Shi, W., & Wu, X. (2018) · Numerical Algorithms · doi:10.1007/s11075-018-0635-7 · Cited by 1
The matrix of matrices exponential and application
Kishka, Z. M. G., Saleem, M. A., & Elrawy, A. (2019) · International Journal of Mathematical Analysis · doi:10.12988/ijma.2019.9210 · Cited by 1
Nasser, R., & Sadkane, M. (2019) · Computational Methods in Applied Mathematics · doi:10.1515/cmam-2018-0212 · Cited by 1
Large‐scale magnetic resonance simulations: A tutorial
Concilio, M. G. (2020) · Magnetic Resonance in Chemistry · doi:10.1002/mrc.5018 · Cited by 1
Subroto, R. K., Chen, Y., Lian, K. L., & Chu, C. (2020) · IEEE Industry Applications Society Annual Meeting (IAS) · doi:10.1109/ias44978.2020.9334761 · Cited by 1
“Based on the work of [12], the speed of the convergence depends on the norm of Âτ .”
BackgroundSymplectic Exponential Runge–Kutta Methods for Solving Nonlinear Hamiltonian Systems
Wu, X., & Wang, B. (2018) · Springer eBooks · doi:10.1007/978-981-10-9004-2_4 · Cited by 1
A Spectral Time-Domain Method for Computational Electrodynamics
Lambers, J. V. (2010) · Springer eBooks · doi:10.1007/978-3-642-11795-4_60 · Cited by 1
Out-of-Equilibrium Dynamics with Matrix Product States
Wall, M. L. (2015) · Springer theses · doi:10.1007/978-3-319-14252-4_7 · Cited by 5
Computing high dimensional multiple integrals involving matrix exponentials
Naranjo-Noda, F. S., & Jiménez, J. C. (2022) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2022.114844 · Cited by 1
Du, X., Iqbal, K. I. B., Uddin, M. M., Hossain, M. T., & Shuzan, M. N. I. (2023) · Results in Control and Optimization · doi:10.1016/j.rico.2023.100217 · Cited by 1
Field-direction Dependence of Majorana-mediated Spin Transport
Taguchi, H., Koga, A., Murakami, Y., Nasu, J., & Tsuchiura, H. (2023) · International Conference on Low Temperature Physics (LT) · doi:10.7566/jpscp.38.011152 · Cited by 1
Fan, Y., Lu, K., Li, J., & Fu, T. (2025) · Applied Sciences · doi:10.3390/app15105359 · Cited by 1
A Moment-Matching Arnoldi Iteration for Linear Combinations of $\varphi$ Functions
Koskela, A., & Ostermann, A. (2014) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/130945156 · Cited by 1
Exponential Collocation Methods for Conservative or Dissipative Systems
Wu, X., & Wang, B. (2021) · Springer eBooks · doi:10.1007/978-981-16-0147-7_5 · Cited by 1
Arnoldi Algorithms with Structured Orthogonalization
Chen, P., Cheng, C., & Wang, X. (2021) · SIAM Journal on Numerical Analysis · doi:10.1137/20m1336667 · Cited by 1
Botchev, M. A. (2021) · Computational Mathematics and Mathematical Physics · doi:10.1134/s0965542521050031 · Cited by 1
Iterative Solution Methods of the Maxwell Equations Using Staggered Grid Spatial Discretization
Horváth, R., Faragó, I., & Schilders, W. (2004) · Scientific computation · doi:10.1007/978-3-642-18560-1_14 · Cited by 1
“We do not approximate the matrix exponential itself but the product of the matrix exponential and the previous state vector ([1, 2, 10, 12]).”
Application of the operator splitting to the Maxwell equations with the source term
Bochev, M. A., Faragó, I., & Horváth, R. (2007) · University of Twente Research Information · Cited by 1
Krylov subspace methods fortime modeling of photonic crystals
Hack, S. A., Hanse, A. M., & Höcker, S. (2013) · Cited by 1
Forastiere, M. A., & Righini, G. C. (2002) · Optical and Quantum Electronics · doi:10.1007/bf02892617 · Cited by 1
Jiménez, J. C. (2010) · Cited by 1
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.