Fernando's solution to Wilkinson's problem: An application of double factorization
From MaRDI portal
Publication:1373322
DOI10.1016/S0024-3795(97)80053-5zbMATH Open0886.65033MaRDI QIDQ1373322FDOQ1373322
Authors: Beresford N. Parlett, Inderjit S. Dhillon 
Publication date: 13 April 1998
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Recommendations
- Orthogonal Eigenvectors and Relative Gaps
- scientific article; zbMATH DE number 3930234
- Minisymposium 4 : Parallele Algorithmen in Der Numerischen Algebra
- The Godunov-inverse iteration: A fast and accurate solution to the symmetric tridiagonal eigenvalue problem
- Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices
Gaussian eliminationeigenvaluesnumerical exampleseigenvectorsalgorithmsymmetric tridiagonal matrixdouble factorization
Cites Work
- Title not available (Why is that?)
- A Review on the Inverse of Symmetric Tridiagonal and Block Tridiagonal Matrices
- Title not available (Why is that?)
- The Calculation of the Eigenvectors of Codiagonal Matrices
- Title not available (Why is that?)
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- Efficient Algorithms for Computing the Condition Number of a Tridiagonal Matrix
- On Computing an Eigenvector of a Tridiagonal Matrix. Part I: Basic Results
- Title not available (Why is that?)
- Inequalities on the Elements of the Inverse of a Certain Tridiagonal Matrix
- On Fourier-Toeplitz Methods for Separable Elliptic Problems
- Title not available (Why is that?)
- Invariant subspaces for tightly clustered eigenvalues of tridiagonals
- Implicite difference methods for initial-boundary value problems
- Improving the Accuracy of Inverse Iteration
- Title not available (Why is that?)
- Bounds for Eigenvalues of Certain Tridiagonal Matrices
- Analysis of a parallel solution method for tridiagonal linear systems
- Numerical Stability in Problems of Linear Algebra
- Reliable Computation of the Condition Number of a Tridiagonal Matrix in O(n) Time
Cited In (20)
- Current inverse iteration software can fail
- On computing the eigenvectors of a class of structured matrices
- A real triple dqds algorithm for the nonsymmetric tridiagonal eigenvalue problem
- Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices
- The Godunov-inverse iteration: A fast and accurate solution to the symmetric tridiagonal eigenvalue problem
- Computing eigenvectors of block tridiagonal matrices based on twisted block factorizations
- Estimation of singular values of very large matrices using random sampling
- Eigenpairs of Wilkinson Matrices
- The Singular Value Decomposition: Anatomy of Optimizing an Algorithm for Extreme Scale
- The orthogonal Rayleigh quotient iteration (ORQI) method
- Localization and Pseudospectra of Twisted Toeplitz Matrices with Applications to Ion Channels
- Computation of Gauss-type quadrature formulas
- On a special basis of approximate eigenvectors with local supports for an isolated narrow cluster of eigenvalues of a symmetric tridiagonal matrix
- For tridiagonals \(T\) replace \(T\) with \(LDL\)
- An \({\mathcal O}(n^{2})\) algorithm for the bidiagonal SVD
- An implementation of the dqds algorithm (positive case)
- Relatively robust representations of symmetric tridiagonals
- Computations of eigenpair subsets with the MRRR algorithm
- Twisted factorization of a banded matrix
- A note on generating finer‐grain parallelism in a representation tree
Uses Software
This page was built for publication: Fernando's solution to Wilkinson's problem: An application of double factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373322)
