Pages that link to "Item:Q1094092"
From MaRDI portal
The following pages link to The use of a refined error bound when updating eigenvalues of tridiagonals (Q1094092):
Displaying 17 items.
- The Lanczos algorithm for the generalized symmetric eigenproblem on shared-memory architectures (Q685964) (← links)
- High performance inverse preconditioning (Q841716) (← links)
- Numerical method for unitary systems (Q1077130) (← links)
- Singular value decompositions of complex symmetric matrices (Q1097636) (← links)
- Effect of the CYBER 205 on the choice of method for solving the eigenvalue problem \((A-\lambda M)x=0\) (Q1097638) (← links)
- Applications of the Lanczos method (Q1330637) (← links)
- Towards a black box Lanczos program (Q1330638) (← links)
- Implementing Lanczos-like algorithms on hypercube architectures (Q1330644) (← links)
- An explicit formula for the inverse of arrowhead and doubly arrow matrices (Q1794667) (← links)
- An adaptive block Lanczos algorithm (Q1921322) (← links)
- Computing eigenvalues: Lanczos algorithm with a new recursive partitioning method (Q1963131) (← links)
- Inversion and pseudoinversion of block arrowhead matrices (Q2007810) (← links)
- An efficient method for computing the inverse of arrowhead matrices (Q2349233) (← links)
- Java multithreading‐based parallel approximate arrow‐type inverses (Q3182720) (← links)
- Some basic information on information-based complexity theory (Q3992023) (← links)
- An approximate inverse matrix technique for arrowhead matrices (Q4256047) (← links)
- Deflation for the Symmetric Arrowhead and Diagonal-Plus-Rank-One Eigenvalue Problems (Q5863874) (← links)