Stable Computation of Generalized Matrix Functions via Polynomial Interpolation
From MaRDI portal
Recommendations
- Polynomial interpolation and Gaussian quadrature for matrix-valued functions
- Computing generalized inverse of polynomial matrices by interpolation
- scientific article; zbMATH DE number 2087114
- scientific article; zbMATH DE number 2127855
- Approximation of functions from stochastic matrices by interpolation polynomials
- Structure preserving piecewise polynomial interpolation for definite matrices
- Polynomial approximation of functions of matrices and applications
- Polynomial evaluation and interpolation and transformations of matrix structures
- Generalized interpolation polynomials of Hermite type for functions of matrix variable
- Numerical stabilization of polynomial and matrix
Cites work
- A filtered Lanczos procedure for extreme and interior eigenvalue problems
- A formula for the Fréchet derivative of a generalized matrix function
- A New Frequency Estimation Method for Equally and Unequally Spaced Data
- A new status index derived from sociometric analysis
- Accuracy and Stability of Numerical Algorithms
- Approximation theory and approximation practice
- Backward stability of Clenshaw's algorithm
- Bounding the spectrum of large Hermitian matrices
- Computation of functions of Hamiltonian and skew-symmetric matrices
- Computation of generalized matrix functions
- Computation of the Exponential of Large Sparse Skew-Symmetric Matrices
- Cucheb: a GPU implementation of the filtered Lanczos procedure
- Edge modification criteria for enhancing the communicability of digraphs
- Functions of Matrices
- scientific article; zbMATH DE number 592770 (Why is no real title available?)
- scientific article; zbMATH DE number 1862742 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 3110365 (Why is no real title available?)
- Introduction to quantum graphs
- Low-Rank Matrix Approximation Using the Lanczos Bidiagonalization Process with Applications
- Mapping directed networks
- On generalized matrix functions
- Operator-Lipschitz estimates for the singular value functional calculus
- Ranking hubs and authorities using matrix functions
- Restarted block Lanczos bidiagonalization methods
- Semigroup methods for evolution equations on networks
- The University of Florida sparse matrix collection
- Two polynomial methods of calculating functions of symmetric matrices
Cited in
(9)- Generalized tensor function via the tensor singular value decomposition based on the T-product
- Faster stochastic trace estimation with a Chebyshev product identity
- Some matrix properties preserved by generalized matrix functions
- Continuity, differentiability and semismoothness of generalized tensor functions
- Mittag-Leffler functions and their applications in network science
- Computation of generalized matrix functions with rational Krylov methods
- Matrix functions in network analysis
- Limited‐memory polynomial methods for large‐scale matrix functions
- Numerical methods for the simulation of quantum walks and quantum annealing
This page was built for publication: Stable Computation of Generalized Matrix Functions via Polynomial Interpolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3119538)
