A new parallel chasing algorithm for transforming arrowhead matrices to tridiagonal form

DOI10.1090/S0025-5718-98-00895-3zbMath0903.65039MaRDI QIDQ4372691

Suely Oliveira

Publication date: 16 December 1997

Published in: Mathematics of Computation (Search for Journal in Brave)

zbMATH Keywords

parallel computationeigenvalue computationsreduction to tridiagonal formarrowhead matriceschasing algorithmspipeline algorithms

Mathematics Subject Classification ID

Related Items (5)

Accurate eigenvalue decomposition of real symmetric arrowhead matrices and applications ⋮ Processor-efficient sparse matrix-vector multiplication ⋮ Efficient arithmetic on subfield elliptic curves over small finite fields of odd characteristic ⋮ A parallel Davidson-type algorithm for several eigenvalues ⋮ An efficient method for computing the inverse of arrowhead matrices

Cites Work

• Unnamed Item
• The numerically stable reconstruction of Jacobi matrices from spectral data
• Parallel tri- and bi-diagonalization of bordered bidiagonal matrices
• Efficient reduction algorithms for bordered band matrices

This page was built for publication: A new parallel chasing algorithm for transforming arrowhead matrices to tridiagonal form