A New Algorithm for Computing the Exponential of a Block Triangular Matrix
Awad H. Al-Mohy

TL;DR
This paper introduces a novel, efficient algorithm for computing the exponential of block triangular matrices by exploiting their structure, improving accuracy and efficiency over existing methods.
Contribution
The paper generalizes existing methods to compute matrix exponentials of block triangular matrices using a new linear operator framework and a structure-exploiting algorithm.
Findings
Outperforms existing algorithms in accuracy and efficiency
Uses a scaling and squaring method with Padé approximants
Selection of scaling parameter depends only on diagonal blocks
Abstract
The exponential of block triangular matrices arises in a wide range of scientific computing applications, including exponential integrators for solving systems of ordinary differential equations, Hamiltonian systems in control theory, sensitivity analysis, and option pricing in finance. We propose a novel algorithm exploiting the block triangular structure for simultaneously computing the exponentials of the diagonal blocks and the off-diagonal block of the matrix exponential without direct involvement of the full block matrix in the computations. This approach generalizes the work of Al-Mohy and Higham on the Fr\'echet derivative of the matrix exponential. The generalization is established through a linear operator framework, facilitating efficient evaluation schemes and rigorous backward error analysis. The algorithm employs the scaling and squaring method using diagonal Pad\'e…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms
