Interlacing Properties of Tridiagonal Symmetric Matrices with Applications to Parallel Computing

DOI10.1137/S0895479893252003zbMATH Open0856.65026MaRDI QIDQ4891697FDOQ4891697

Authors: Ilan Bar-On 

Publication date: 11 February 1997

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Recommendations

• Parallel Factorizations for Tridiagonal Matrices
• A Parallel Algorithm for Computing the Eigenvalues of a Symmetric Tridiagonal Matrix
• scientific article; zbMATH DE number 4003350
• Tridiagonal factorizations of Fourier matrices and applications to parallel computations of discrete Fourier transforms
• Parallel block tridiagonalization of real symmetric matrices
• Parallel implementation of bisection for the calculation of eigenvalues of tridiagonal symmetric matrices
• An interlacing theorem for tridiagonal matrices
• Parallelization and vectorization aspects of the solution of tridiagonal linear systems
• Applying parallel computer systems to solve symmetric tridiagonal eigenvalue problems
• Parallel algorithms for reduction of a symmetric matrix to tridiagonal form on a shared memory multiprocessor

zbMATH Keywords

eigenvaluesparallel algorithmstridiagonal symmetric matrix

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Cited In (4)

• Refined interlacing properties for zeros of paraorthogonal polynomials on the unit circle
• An Inverse Extreme Eigenpair Problem and Its Parallel Iterative Solution for Symmetric Tridiagonal Matrices
• On the location of the eigenvalues of Jacobi matrices
• Location of the eigenvalues of weighted graphs with a cut edge

This page was built for publication: Interlacing Properties of Tridiagonal Symmetric Matrices with Applications to Parallel Computing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4891697)