Efficient Computation of the Matrix Exponential by Generalized Polar Decompositions
From MaRDI portal
Publication:5698741
DOI10.1137/S0036142902415936zbMATH Open1084.65040OpenAlexW1970935533MaRDI QIDQ5698741FDOQ5698741
Authors: Arieh Iserles, Antonella Zanna 
Publication date: 28 October 2005
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0036142902415936
Recommendations
- Generalized polar decompositions for the approximation of the matrix exponential
- Efficient orthogonal matrix polynomial based method for computing matrix exponential
- Stable and efficient computation of generalized polar decompositions
- Fast Polar Decomposition of an Arbitrary Matrix
- Stability of the generalized polar decomposition method for the approximation of the matrix exponential
- Efficient computation of the matrix exponential using Padé approximation
- Efficient computation of the exponential operator for large, sparse, symmetric matrices
- Accurate and efficient matrix exponential computation
- Boosting the computation of the matrix exponential
- Fast computation of the matrix exponential for a Toeplitz matrix
Geometric methods in ordinary differential equations (34A26) Matrix equations and identities (15A24)
Cited In (20)
- Explicit volume-preserving splitting methods for linear and quadratic divergence-free vector fields
- Numerical evaluation of the Evans function by Magnus integration
- A method for approximation of the exponential map in semidirect product of matrix Lie groups and some applications
- Optimizing Halley's Iteration for Computing the Matrix Polar Decomposition
- A Filon-type asymptotic approach to solving highly oscillatory second-order initial value problems
- Grassmannian spectral shooting
- Geometric Euler-Maruyama schemes for stochastic differential equations in \(\mathrm{SO}(n)\) and \(\mathrm{SE}(n)\)
- Topics in structure-preserving discretization
- A structure preserving approximation method for Hamiltonian exponential matrices
- Adaptive decomposition finite difference methods for solving singular problems -- a review
- Interpolation on symmetric spaces via the generalized polar decomposition
- New multiplicative perturbation bounds for the generalized polar decomposition
- Generalized polar decompositions for the approximation of the matrix exponential
- Preserving geometric properties of the exponential matrix by block Krylov subspace methods
- High-Order Retractions on Matrix Manifolds Using Projected Polynomials
- Stability of the generalized polar decomposition method for the approximation of the matrix exponential
- Matrix exponentiation and the Frank-Kamenetskii equation
- Dimension of the intersection of a pair of orthogonal groups
- Symmetric spaces and Lie triple systems in numerical analysis of differential equations
- Recurrence relations and convergence theory of the generalized polar decomposition on Lie groups
This page was built for publication: Efficient Computation of the Matrix Exponential by Generalized Polar Decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5698741)
