The DOI matches its Crossref record.
Functions of Matrices: Theory and Computation
Abstract
A thorough and elegant treatment of the theory of matrix functions and numerical methods for computing them, including an overview of applications, new and unpublished research results, and improved algorithms. Key features include a detailed treatment of the matrix sign function and matrix roots; a development of the theory of conditioning and properties of the Frechet derivative; Schur decomposition; block Parlett recurrence; a thorough analysis of the accuracy, stability, and computational cost of numerical methods; general results on convergence and stability of matrix iterations; and a chapter devoted to the f(A)b problem. Ideal for advanced courses and for self-study, its broad content, references and appendix also make this book a convenient general reference. Contains an extensive collection of problems with solutions and MATLAB implementations of key algorithms.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“With the help of the Kronecker product, a problem like (49) may be solved by factoring out X in the form of a column vector from the l.h.s. turning the equation into (see for example [35, 36])”
From Fundamentals of quantum mechanics in Liouville space (2020) · cites this paper as [36]
Citations
Cites
Still being checked.
Cited by
Sorted by citations
A Singular Value Thresholding Algorithm for Matrix Completion
Cai, J., Candès, E. J., & Shen, Z. (2010) · SIAM Journal on Optimization · doi:10.1137/080738970 · Cited by 5,878
Kühne, T. D., Iannuzzi, M., Del Ben, M., Rybkin, V. V., Seewald, P., Stein, F., Laino, T., Khaliullin, R. Z., Schütt, O., Schiffmann, F., et al. (2020) · The Journal of Chemical Physics · doi:10.1063/5.0007045 · Cited by 4,468
Second-Order Attention Network for Single Image Super-Resolution
Dai, T., Cai, J., Zhang, Y., Xia, S.-T., & Zhang, L. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.01132 · Cited by 2,010
Moment Tensor Potentials: A Class of Systematically Improvable Interatomic Potentials
Shapeev, A. V. (2016) · Multiscale Modeling and Simulation · doi:10.1137/15m1054183 · Cited by 1,506
User-Friendly Tail Bounds for Sums of Random Matrices
Tropp, J. A. (2011) · Foundations of Computational Mathematics · doi:10.1007/s10208-011-9099-z · Cited by 1,319
Metadata
- Authors
- Higham, N. J.
- Affiliations
- University of Manchester (GB)
- Corresponding author
- Higham, Nicholas J.
- ORCID
- Higham, Nicholas J.
- Venue
- Society for Industrial and Applied Mathematics eBooks
- Published
- 2008-01-01
- OpenAlex
- W1483804921
- Cited by
- 2,113
- References
- 0
- Citations by year
- 2026: 133 · 2025: 114 · 2024: 124 · 2023: 115 · 2022: 121 · 2021: 171 · 2020: 177 · 2019: 152 · 2018: 140 · 2017: 125 · 2016: 132 · 2015: 126 · 2014: 120 · 2013: 100 · 2012: 76
- FWCI
- 19.22
- Type
- book
- Language
- en
- Open access
- closed
- Locations
- Society for Industrial and Applied Mathematics eBooks (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Matrix Theory and Algorithms
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Numerical Methods and Algorithms
- Physical Sciences › Mathematics › Modeling and Simulation › Mathematical and Computational Methods
- Keywords
- matrix functions, matrix sign function, matrix roots, conditioning, Fréchet derivative, Schur decomposition, numerical stability, computational cost, matrix iteration, convergence, stability, MATLAB algorithm
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
