Mixed precision recursive block diagonalization for bivariate functions of matrices
From MaRDI portal
Abstract: Various numerical linear algebra problems can be formulated as evaluating bivariate function of matrices. The most notable examples are the Fr'echet derivative along a direction, the evaluation of (univariate) functions of Kronecker-sum-structured matrices and the solution of Sylvester matrix equations. In this work, we propose a recursive block diagonalization algorithm for computing bivariate functions of matrices of small to medium size, for which dense liner algebra is appropriate. The algorithm combines a blocking strategy, as in the Schur-Parlett scheme, and an evaluation procedure for the diagonal blocks. We discuss two implementations of the latter. The first is a natural choice based on Taylor expansions, whereas the second is derivative-free and relies on a multiprecision perturb-and-diagonalize approach. In particular, the appropriate use of multiprecision guarantees backward stability without affecting the efficiency in the generic case. This makes the second approach more robust. The whole method has cubic complexity and it is closely related to the well-known Bartels-Stewart algorithm for Sylvester matrix equations when applied to . We validate the performances of the proposed numerical method on several problems with different conditioning properties.
Recommendations
Cites work
- A Krylov subspace method for the approximation of bivariate matrix functions
- A multiprecision derivative-free Schur-Parlett algorithm for computing matrix functions
- A Schur-Parlett Algorithm for Computing Matrix Functions
- Accuracy and Stability of Numerical Algorithms
- Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]
- Approximate Diagonalization
- Approximation of functions of large matrices with Kronecker structure
- Approximation of Large-Scale Dynamical Systems
- Bivariate matrix functions
- Block algorithms for reordering standard and generalized Schur forms
- Complex-Valued Matrix Derivatives
- Computational Methods for Linear Matrix Equations
- Computing A^\alpha, \log(A), and Related Matrix Functions by Contour Integrals
- Computing the Fréchet Derivative of the Matrix Exponential, with an Application to Condition Number Estimation
- Computing the Fréchet derivative of the matrix logarithm and estimating the condition number
- Exponential integrators
- Functions of Matrices
- Network properties revealed through matrix functions
- Rational Krylov for Stieltjes matrix functions: convergence and pole selection
- Recursive blocked algorithms for solving triangular systems—Part I
- The numerical range is a \((1+\sqrt{2})\)-spectral set
- The scaling and squaring method for the matrix exponential revisited
Cited in
(2)
This page was built for publication: Mixed precision recursive block diagonalization for bivariate functions of matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5071438)
