The scaling, splitting, and squaring method for the exponential of perturbed matrices
From MaRDI portal
(Redirected from Publication:5254396)
Abstract: We propose splitting methods for the computation of the exponential of perturbed matrices which can be written as the sum of a sparse and efficiently exponentiable matrix with sparse exponential and a dense matrix which is of small norm in comparison with . The predominant algorithm is based on scaling the large matrix by a small number , which is then exponentiated by efficient Pad'e or Taylor methods and finally squared in order to obtain an approximation for the full exponential. In this setting, the main portion of the computational cost arises from dense-matrix multiplications and we present a modified squaring which takes advantage of the smallness of the perturbed matrix in order to reduce the number of squarings necessary. Theoretical results on local error and error propagation for splitting methods are complemented with numerical experiments and show a clear improvement over existing methods when medium precision is sought.
Recommendations
- Scaled and squared subdiagonal Padé approximation for the matrix exponential
- The scaling and squaring method for the matrix exponential revisited
- The Scaling and Squaring Method for the Matrix Exponential Revisited
- New scaling-squaring Taylor algorithms for computing the matrix exponential
- A new scaling and squaring algorithm for the matrix exponential
Cites work
- A new scaling and squaring algorithm for the matrix exponential
- Accurate and efficient matrix exponential computation
- An efficient algorithm for computing the Baker-Campbell-Hausdorff series and some of its applications
- Approximating the exponential from a Lie algebra to a Lie group
- Composition methods in the presence of small parameters
- Computing matrix functions
- Expokit
- Functions of Matrices
- High-order symplectic integrators for perturbed Hamiltonian systems
- scientific article; zbMATH DE number 1795895 (Why is no real title available?)
- Methods for the approximation of the matrix exponential in a Lie-algebraic setting
- Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later
- Norm Inequalities for Commutators of Normal Operators
- Numerical integrators for quantum dynamics close to the adiabatic limit
- On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
- Splitting methods with complex times for parabolic equations
- The scaling and squaring method for the matrix exponential revisited
- The Scaling and Squaring Method for the Matrix Exponential Revisited
Cited in
(12)- Exponential dichotomy on the real line: SVD and QR methods
- Scaling technique for partition-Nekrasov matrices
- A new efficient and accurate spline algorithm for the matrix exponential computation
- Computing the matrix sine and cosine simultaneously with a reduced number of products
- An efficient Strang splitting technique combined with the multiquadric-radial basis function for the Burgers' equation
- Efficient implementation of partitioned stiff exponential Runge-Kutta methods
- scientific article; zbMATH DE number 687752 (Why is no real title available?)
- High-performance computation of the exponential of a large sparse matrix
- An Arbitrary Precision Scaling and Squaring Algorithm for the Matrix Exponential
- Computing exponential for iterative splitting methods: algorithms and applications
- Efficient scaling and squaring method for the matrix exponential
- An accurate approximation algorithm for Burgers' equation in the presence of small viscosity
This page was built for publication: The scaling, splitting, and squaring method for the exponential of perturbed matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5254396)