Pages that link to "Item:Q1077870"
From MaRDI portal
The following pages link to Eigenvalues of a symmetric tridiagonal matrix: A divide-and-conquer approach (Q1077870):
Displaying 17 items.
- An analytical approach to solutions of master equations for stochastic nonlinear reactions (Q454302) (← links)
- A case against a divide and conquer approach to the nonsymmetric eigenvalue problem (Q685968) (← links)
- A divide and conquer method for polynomial zeros (Q911228) (← links)
- Eigenvalues of tridiagonal matrices: An alternative to Givens' method (Q916305) (← links)
- A divide and conquer method for unitary and orthogonal eigenproblems (Q920577) (← links)
- Restricted rank modification of the symmetric eigenvalue problem: Theoretical considerations (Q1106912) (← links)
- Practical improvement of the divide-and-conquer eigenvalue algorithms (Q1192014) (← links)
- Efficient computation of tridiagonal matrices largest eigenvalue (Q1675958) (← links)
- Computing the eigenvalues of symmetric tridiagonal matrices via a Cayley transformation (Q1744301) (← links)
- Efficient parallel factorization and solution of structured and unstructured linear systems (Q2486566) (← links)
- A robust algorithm for finding the eigenvalues and eigenvectors of \(3 \times 3\) symmetric matrices (Q2637898) (← links)
- How to split the eigenvalues of a one-parameter family of matrices (Q2747938) (← links)
- Reliable Eigenvalues of Symmetric Tridiagonals (Q3225550) (← links)
- Location of the eigenvalues of weighted graphs with a cut edge (Q3564194) (← links)
- Minisymposium 4 : Parallele Algorithmen in Der Numerischen Algebra (Q4306793) (← links)
- MONITORING THE CONVERGENCE OF THE LANCZOS ALGORITHM IN PARALLEL COMPUTING ENVIRONMENTS (Q4820115) (← links)
- A Parallel Algorithm for Computing the Eigenvalues of a Symmetric Tridiagonal Matrix (Q5288225) (← links)
