The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
A Schur-Parlett Algorithm for Computing Matrix Functions
Abstract
An algorithm for computing matrix functions is presented. It employs a Schur decomposition with reordering and blocking followed by the block form of a recurrence of Parlett, with functions of the nontrivial diagonal blocks evaluated via a Taylor series. A parameter is used to balance the conflicting requirements of producing small diagonal blocks and keeping the separations of the blocks large. The algorithm is intended primarily for functions having a Taylor series with an infinite radius of convergence, but it can be adapted for certain other functions, such as the logarithm. Novel features introduced here include a convergence test that avoids premature termination of the Taylor series evaluation and an algorithm for reordering and blocking the Schur form. Numerical experiments show that the algorithm is competitive with existing special-purpose algorithms for the matrix exponential, logarithm, and cosine. Nevertheless, the algorithm can be numerically unstable with the default choice of its blocking parameter (or in certain cases for all choices), and we explain why determining the optimal parameter appears to be a very difficult problem. A MATLAB implementation is available that is much more reliable than the function funm in MATLAB 6.5 (R13).
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Accuracy and Stability of Numerical Algorithms: Second Edition
Higham, N. J. (2002) · doi:10.1137/1.9780898718027 · Cited by 3,803
Self-citationNineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later
Moler, C., & Van Loan, C. (2003) · SIAM Review · doi:10.1137/s00361445024180 · Cited by 2,357
Cited by
The Scaling and Squaring Method for the Matrix Exponential Revisited
Higham, N. J. (2005) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/04061101x · Cited by 538
Self-citationSemantic Segmentation with Second-Order Pooling
Carreira, J., Caseiro, R., Batista, J., & Sminchisescu, C. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-33786-4_32 · Cited by 458
A New Scaling and Squaring Algorithm for the Matrix Exponential
Al-Mohy, A. H., & Higham, N. J. (2010) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/09074721x · Cited by 355
Self-citationHigham, N. J. (2006) · Handbook of Linear Algebra · doi:10.1201/9781420010572-11 · Cited by 258
Self-citation
Metadata
- Authors
- Davies, P. I., & Higham, N. J.
- Venue
- SIAM Journal on Matrix Analysis and Applications
- Published
- 2003-01
- Volume
- 25
- Issue
- 2
- Pages
- 464-485
- ISSN
- 0895-4798 (ISSN-L)
- 1095-7162
- OpenAlex
- W2082465767
- Cited by
- 167
- References
- 2
- FWCI
- 6.92
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Schur-Parlett Algorithm for Computing Matrix Functions. https://app.cochat.ai/papers/10.1137/s0895479802410815
- The paper
- Davies, P. I., & Higham, N. J. (2003). A Schur-Parlett Algorithm for Computing Matrix Functions. SIAM Journal on Matrix Analysis and Applications. https://doi.org/10.1137/s0895479802410815
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.