Structured level-2 condition numbers of matrix functions
From MaRDI portal
Abstract: Matrix functions play an increasingly important role in many areas of scientific computing and engineering disciplines. In such real-world applications, algorithms working in floating-point arithmetic are used for computing matrix functions and additionally, input data might be unreliable, e.g., due to measurement errors. Therefore, it is crucial to understand the sensitivity of matrix functions to perturbations, which is measured by condition numbers. However, the condition number itself might not be computed exactly as well due to round-off and errors in the input. The sensitivity of the condition number is measured by the so-called level-2 condition number. For the usual (level-1) condition number, it is well-known that structured condition numbers (i.e., where only perturbations are taken into account that preserve the structure of the input matrix) might be much smaller than unstructured ones, which, e.g., suggests that structure-preserving algorithms for matrix functions might yield much more accurate results than general-purpose algorithms. In this work, we examine structured level-2 condition numbers in the particular case of restricting the perturbation matrix to an automorphism group, a Lie or Jordan algebra or the space of quasi-triangular matrices. In numerical experiments, we then compare the unstructured level-2 condition number with the structured one for some specific matrix functions such as the matrix logarithm, matrix square root, and matrix exponential.
Recommendations
- Structured condition number for a certain class of functions of non-commuting matrices
- Structured conditioning of matrix functions
- Conditioning of matrix functions at quasi-triangular matrices
- The structured condition number of a differentiable map between matrix manifolds, with applications
- Higher Order Fréchet Derivatives of Matrix Functions and the Level-2 Condition Number
Cites work
- \textit{TimeEvolver}: a program for time evolution with improved error bound
- A dynamical systems view of network centrality
- A multiprecision derivative-free Schur-Parlett algorithm for computing matrix functions
- A new scaling and squaring algorithm for the matrix exponential
- A Schur-Parlett Algorithm for Computing Matrix Functions
- Computational Techniques for Real Logarithms of Matrices
- Computing the action of the matrix exponential, with an application to exponential integrators
- Condition Estimates for Matrix Functions
- Condition numbers and their condition numbers
- Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
- Finding generators for Markov chains via empirical transition matrices, with applications to credit ratings
- Functions of Matrices
- Higher Order Fréchet Derivatives of Matrix Functions and the Level-2 Condition Number
- Improved inverse scaling and squaring algorithms for the matrix logarithm
- Integral representations for higher-order Fréchet derivatives of matrix functions: quadrature algorithms and new results on the level-2 condition number
- Numerical Computation of the Matrix Exponential with Accuracy Estimate
- On \(p\)th roots of stochastic matrices
- On condition numbers and the distance to the nearest ill-posed problem
- Padé approximation for the exponential of a block triangular matrix
- Ranking hubs and authorities using matrix functions
- Structured condition numbers and backward errors in scalar product spaces
- Structured conditioning of matrix functions
- The complex step approximation to the higher order Fréchet derivatives of a matrix function
- The Sensitivity of the Matrix Exponential
- The structured condition number of a differentiable map between matrix manifolds, with applications
- Theoretical and numerical considerations about Padé approximants for the matrix logarithm
Cited in
(2)
This page was built for publication: Structured level-2 condition numbers of matrix functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6198237)
