Evaluation of matrix functions with the block Lanczos algorithm
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 3557389 (Why is no real title available?)
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- An iterative solution method for solving \(f(A)x=b\), using Krylov subspace information obtained for the symmetric positive definite matrix A
- Analysis of Some Krylov Subspace Approximations to the Matrix Exponential Operator
- Error Bounds for Dynamic Responses in Forced Vibration Problems
- How to Implement the Spectral Transformation
- Some new characterizations of the Chebyshev polynomials
- The Advantages of Inverted Operators in Rayleigh–Ritz Approximations
- The simultaneous computation of a few of the algebraically largest and smallest eigenvalues of a large, sparse, symmetric matrix
- Two polynomial methods of calculating functions of symmetric matrices
Cited in
(2)
This page was built for publication: Evaluation of matrix functions with the block Lanczos algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q678426)