A Hybrid Tridiagonalization Algorithm for Symmetric Sparse Matrices

DOI10.1137/S0895479892228924zbMATH Open0807.65043MaRDI QIDQ4313385FDOQ4313385

Authors: Ian A. Cavers 

Publication date: 16 November 1994

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

Recommendations

• Tridiagonalization of band symmetric matrices for vector computers
• A Parallel Algorithm for Reducing Symmetric Banded Matrices to Tridiagonal Form
• Reduction of a General Matrix to Tridiagonal Form
• Block tridiagonalization of "effectively" sparse symmetric matrices
• A new algorithm for the symmetric tridiagonal eigenvalue problem

zbMATH Keywords

symmetric sparse matricesband- preserving reductionhybrid tridiagonalization algorithm

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50)

Cited In (4)

• Title not available (Why is that?)
• Block tridiagonalization of "effectively" sparse symmetric matrices
• Tridiagonalization of band symmetric matrices for vector computers
• Fast Runge-Kutta approximation of inhomogeneous parabolic equations

This page was built for publication: A Hybrid Tridiagonalization Algorithm for Symmetric Sparse Matrices

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