Approximate Diagonalization
From MaRDI portal
approximate diagonalizationfractional powersfunctional calculusill-posednessJordan matricesnumerical examplesregularizationspectral theory
Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Linear operators and ill-posed problems, regularization (47A52) Functional calculus for linear operators (47A60) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Ill-posedness and regularization problems in numerical linear algebra (65F22)
Recommendations
- Transfer functions and resolvent norm approximation of large matrices
- Estimating the diagonal of matrix functions
- Computing A^\alpha, \log(A), and Related Matrix Functions by Contour Integrals
- Efficient mixed rational and polynomial approximation of matrix functions
- THE COMPUTATION OF FUNCTIONS OF MATRICES BY TRUNCATED FABER SERIES
Cited in
(25)- Transfer functions and resolvent norm approximation of large matrices
- Computing primary solutions of equations involving primary matrix functions
- An efficient and accurate algorithm for computing the matrix cosine based on new Hermite approximations
- On the real Davies' conjecture
- On the backward and forward error of approximations of analytic functions and applications to the computation of matrix functions
- Pseudoeigenvector bases and deflated GMRES for highly nonnormal matrices.
- scientific article; zbMATH DE number 1820154 (Why is no real title available?)
- Diagonal approximation of the form factor of the unitary group
- A multiprecision derivative-free Schur-Parlett algorithm for computing matrix functions
- Computing the wave-kernel matrix functions
- scientific article; zbMATH DE number 1405272 (Why is no real title available?)
- Mixed precision recursive block diagonalization for bivariate functions of matrices
- Computing enclosures for the matrix exponential
- New Algorithms for Computing the Matrix Sine and Cosine Separately or Simultaneously
- Estimating the diagonal of matrix functions
- The Complexity of Diagonalization
- Quantitative invertibility of non-Hermitian random matrices
- Pseudospectral shattering, the sign function, and diagonalization in nearly matrix multiplication time
- Spectral instabilities: variations on a theme loved by Brian Davies
- Overlaps, eigenvalue gaps, and pseudospectrum under real Ginibre and absolutely continuous perturbations
- Universality for diagonal eigenvector overlaps of non-Hermitian random matrices
- Global convergence of Hessenberg shifted QR. I: Exact arithmetic
- Global convergence of Hessenberg shifted QR. III: Approximate Ritz values via shifted inverse iteration
- Efficient algorithm for the oscillatory matrix functions
- The approximation characteristic of diagonal matrix in probabilistic setting
This page was built for publication: Approximate Diagonalization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3537435)
