A Krylov subspace method for the approximation of bivariate matrix functions
From MaRDI portal
Publication:3294692
Abstract: Bivariate matrix functions provide a unified framework for various tasks in numerical linear algebra, including the solution of linear matrix equations and the application of the Fr'echet derivative. In this work, we propose a novel tensorized Krylov subspace method for approximating such bivariate matrix functions and analyze its convergence. While this method is already known for some instances, our analysis appears to result in new convergence estimates and insights for all but one instance, Sylvester matrix equations.
Recommendations
- A new investigation of the extended Krylov subspace method for matrix function evaluations
- Rational Krylov approximation of matrix functions: numerical methods and optimal pole selection
- The error analysis of the Krylov subspace methods for computing the bilinear form of matrix functions
- scientific article; zbMATH DE number 4201485
- Bivariate matrix functions
Cites work
- scientific article; zbMATH DE number 3738047 (Why is no real title available?)
- scientific article; zbMATH DE number 3449064 (Why is no real title available?)
- scientific article; zbMATH DE number 4187010 (Why is no real title available?)
- A Chain Rule for Matrix Functions and Applications
- Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]
- An error analysis for rational Galerkin projection applied to the Sylvester equation
- Approximation of functions of large matrices with Kronecker structure
- Balanced truncation model order reduction in limited time intervals for large systems
- Bivariate matrix functions
- Block Krylov subspace methods for functions of matrices
- Bounds for iterates, inverses, spectral variation and fields of values of non-normal matrices
- Computational Methods for Linear Matrix Equations
- Computationally enhanced projection methods for symmetric Sylvester and Lyapunov matrix equations
- Convergence analysis of projection methods for the numerical solution of large Lyapunov equations
- Error Estimates and Evaluation of Matrix Functions via the Faber Transform
- Explicit Solutions of Linear Matrix Equations
- Fields of values and the ADI method for non-normal matrices
- Frequency-limited balanced truncation with low-rank approximations
- From quantum to classical molecular dynamics: Reduced models and numerical analysis.
- Functions of Matrices
- Krylov subspace methods for linear systems with tensor product structure
- Low-Rank Updates and a Divide-And-Conquer Method for Linear Matrix Equations
- Low-rank updates of matrix functions
- Matrix algorithms. Vol. 2: Eigensystems
- Matrix functions
- Model reduction in limited time and frequency intervals
- Multivariate polynomial approximation in the hypercube
- Norm estimates for functions of two non-commuting matrices
- Numerical Methods for Large-Scale Lyapunov Equations with Symmetric Banded Data
- Numerical methods for large eigenvalue problems
- Numerical solution of large and sparse continuous time algebraic matrix Riccati and Lyapunov equations: a state of the art survey
- Oblique Production Methods for Large Scale Model Reduction
- On Krylov Subspace Approximations to the Matrix Exponential Operator
- On the numerical solution of \(AX-XB=C\)
- Rational Krylov approximation of matrix functions: numerical methods and optimal pole selection
- Solution of large scale algebraic matrix Riccati equations by use of hierarchical matrices
- Sparse solution of the Lyapunov equation for large-scale interconnected systems
- The numerical range is a \((1+\sqrt{2})\)-spectral set
Cited in
(18)- Low-rank-modified Galerkin methods for the Lyapunov equation
- Low-rank tensor structure preservation in fractional operators by means of exponential sums
- Limited‐memory polynomial methods for large‐scale matrix functions
- scientific article; zbMATH DE number 5240908 (Why is no real title available?)
- scientific article; zbMATH DE number 5240913 (Why is no real title available?)
- Biconjugate direction methods in Krylov subspaces
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- Sensitivity of Matrix Function Based Network Communicability Measures: Computational Methods and A Priori Bounds
- Integral representations for higher-order Fréchet derivatives of matrix functions: quadrature algorithms and new results on the level-2 condition number
- Bivariate matrix functions
- The Fréchet derivative of the tensor t-function
- The error analysis of the Krylov subspace methods for computing the bilinear form of matrix functions
- Approximation of bi-variate functions: singular value decomposition versus sparse grids
- Calculating a function of a matrix with a real spectrum
- A Unifying Framework for Higher Order Derivatives of Matrix Functions
- Norm and trace estimation with random rank-one vectors
- Krylov Approximations for Matrix Square Roots in Stiff Boundary Value Problems
- Mixed precision recursive block diagonalization for bivariate functions of matrices
This page was built for publication: A Krylov subspace method for the approximation of bivariate matrix functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3294692)
