Exponentials of symmetric matrices through tridiagonal reductions

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

6 Citations (Scopus)

Abstract

A simple and efficient numerical algorithm for computing the exponential of a symmetric matrix is developed in this paper. For an n × n matrix, the required number of operations is around 10/3 n3. It is based on the orthogonal reduction to a tridiagonal form and the Chebyshev uniform approximation of e-x on [0, ∞). ©1998 Elsevier Science Inc. All rights reserved.
Original languageEnglish
Pages (from-to)317-324
JournalLinear Algebra and Its Applications
Volume279
Issue number1-3
DOIs
Publication statusPublished - 15 Aug 1998

Research Keywords

  • Chebyshev approximation
  • Matrix exponential
  • Tridiagonal reduction

Fingerprint

Dive into the research topics of 'Exponentials of symmetric matrices through tridiagonal reductions'. Together they form a unique fingerprint.

Cite this