Papers
Topics
Authors
Recent
Search
2000 character limit reached

Computing the matrix exponential and the Cholesky factor of a related finite horizon Gramian

Published 20 Oct 2023 in math.NA, cs.NA, and math.OC | (2310.13462v3)

Abstract: In this article, an efficient numerical method for computing both the matrix exponential and a finite horizon controllability Gramian in Cholesky-factored form is proposed. The method is applicable to general dense matrices of moderate size and produces a Cholesky factor of the Gramian without computing the full product. It is a generalization of the scaling-and-squaring approach for approximating the matrix exponential and exploits a similar doubling formula for the Gramian to compute both at once. The required computational effort is thereby kept modest. Most importantly, a rigorous backward error analysis is provided, which guarantees that the approximation is accurate to the round-off error level in double precision. This accuracy is illustrated in practice on a large number of standard test examples. The method has been implemented in the Julia package FiniteHorizonGramians.jl, which is available online under the MIT license. Code for reproducing the experimental results is included in this package, as well as code for determining the optimal method parameters. The analysis can thus easily be adapted to a different finite-precision arithmetic.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (43)
  1. Matrix Riccati Equations in Control and Systems Theory. Birkhäuser.
  2. Computing the Fréchet derivative of the matrix exponential, with an application to condition number estimation. SIAM J. Matrix Anal. Appl., 30(4):1639–1657.
  3. A new scaling and squaring algorithm for the matrix exponential. SIAM J. Matrix Anal. Appl., 31(3):970–989.
  4. Computing the action of the matrix exponential, with an application to exponential integrators. SIAM journal on Scientific Computing, 33(2):488–511.
  5. Optimal Control: Linear Quadratic Methods. Courier Corporation.
  6. Optimal Filtering. Courier Corporation.
  7. Antoulas, A. C. (2005). Approximation of Large-scale Dynamical Systems. SIAM.
  8. Discrete-time solutions to the continuous-time differential Lyapunov equation with applications to Kalman filtering. IEEE Transactions on Automatic Control, 60(3):632–643.
  9. Algorithm 432: Solution of the matrix equation AX + XB = C. Commun. ACM, 15(9):820–826.
  10. Solution formulas for differential Sylvester and Lyapunov equations. Calcolo, 56:51.
  11. TaylorSeries.jl: Taylor expansions in one and several variables in Julia. J. Open Source Softw., 4(36):1043.
  12. Numerical solution of large-scale Lyapunov equations, Riccati equations, and linear-quadratic optimal control problems. Numer. Linear Algebra Appl., 15(9):755–777.
  13. Numerical solution of the infinite-dimensional LQR problem and the associated Riccati differential equations. J. Numer. Math., 26(1):1–20.
  14. Numerical solution of large and sparse continuous time algebraic matrix Riccati and Lyapunov equations: a state of the art survey. GAMM-Mitt., 36(1):32–52.
  15. Julia: A fresh approach to numerical computing. SIAM Rev., 59(1):65–98.
  16. A modified Cholesky algorithm based on a symmetric indefinite factorization. SIAM J. Matrix Anal. Appl., 19(4):1097–1110.
  17. Ehle, B. L. (1969). On Padé approximations to the exponential function and A-stable methods for the numerical solution of initial value problems. PhD thesis, University of Waterloo Waterloo, Ontario.
  18. Modified Cholesky algorithms: a catalog with new approaches. Math. Program., 115(2):319–349.
  19. Exact calculations of discrete-time process noise statistics for hybrid continuous/discrete time applications. In Proceedings of 32nd IEEE Conference on Decision and Control, pages 857–858. IEEE.
  20. MPFR: A multiple-precision binary floating-point library with correct rounding. ACM Trans. Math. Softw., 33(2):13–es.
  21. High-performance symbolic-numerics via multiple dispatch. ACM Commun. Comput. Algebra, 55(3):92–96.
  22. Scaled and squared subdiagonal Padé approximation for the matrix exponential. SIAM J. Matrix Anal. Appl., 37(1):145–170.
  23. Hammarling, S. J. (1982). Numerical solution of the stable, non-negative definite Lyapunov equation. IMA J. Numer. Anal., 2(3):303–323.
  24. Higham, N. J. (1996). Accuracy and stability of numerical algorithms. SIAM.
  25. Higham, N. J. (2005). The scaling and squaring method for the matrix exponential revisited. SIAM J. Matrix Anal. Appl., 26(4):1179–1193.
  26. Higham, N. J. (2008). Functions of matrices: theory and computation. SIAM.
  27. Topics in Matrix Analysis. Cambridge University Press.
  28. Linear estimation. Prentice Hall.
  29. Order reduction methods for solving large-scale differential matrix Riccati equations. SIAM J. Sci. Comput., 42(4):A2182–A2205.
  30. Analysis of Krylov subspace approximation to large-scale differential Riccati equations. Electron. Trans. Numer. Anal., 52:431–454.
  31. Exponential integrators for large-scale stiff Riccati differential equations. J. Comput. Appl. Math., 389:113360.
  32. Low rank solution of Lyapunov equations. SIAM J. Matrix Anal. Appl., 24(1):260–280.
  33. Mena, H. (2007). Numerical Solution of Differential Riccati Equations Arising in Optimal Control of Partial Differential Equations. PhD thesis, Escuela Politécnica Nacional, Quito, Ecuador. Available as ISBN: 978-9978-383-09-4.
  34. Nineteen dubious ways to compute the exponential of a matrix. SIAM Rev., 20(4):801–836.
  35. Nineteen dubious ways to compute the exponential of a matrix, twenty-five years later. SIAM Rev., 45(1):3–49.
  36. Moore, G. (2011). Orthogonal polynomial expansions for the matrix exponential. Linear algebra appl., 435(3):537–559.
  37. Convergence of a low-rank Lie-Trotter splitting for stiff matrix differential equations. SIAM J. Numer. Anal., 57(4):1947–1966.
  38. DifferentialEquations.jl – A performant and feature-rich ecosystem for solving differential equations in Julia. The Journal of Open Research Software, 5(1).
  39. Simoncini, V. (2016). Computational methods for linear matrix equations. SIAM Rev., 58(3):377–441.
  40. Stillfjord, T. (2015). Low-rank second-order splitting of large-scale differential Riccati equations. IEEE Trans. Automat. Control, 60(10):2791–2796.
  41. Stillfjord, T. (2018). Adaptive high-order splitting schemes for large-scale differential Riccati equations. Numer. Algorithms, 78(4):1129–1151.
  42. Van Loan, C. (1978). Computing integrals involving the matrix exponential. IEEE Trans. Automat. Contr, 23(3):395 – 404.
  43. Matrix Depot: an extensible test matrix collection for Julia. PeerJ Computer Science, 2.
Citations (1)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (2)

  1. Tony Stillfjord 
  2. Filip Tronarp 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up