Tridiagonalization of band symmetric matrices for vector computers

DOI10.1016/0898-1221(90)90004-4zbMath0704.65031OpenAlexW2012844458MaRDI QIDQ917223

T. Z. Kalamboukis

Publication date: 1990

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(90)90004-4

zbMATH Keywords

performancevector computersNumerical resultstridiagonalizationband symmetric matrix

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of matrix norms, conditioning, scaling (65F35) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Related Items (1)

Spatial Bayesian Nonparametric Methods

Cites Work

• Tridiagonalization of a symmetric band matrix
• On the Impact of Communication Complexity on the Design of Parallel Numerical Algorithms
• Banded Eigenvalue Solvers on Vector Machines
• A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
• Solution of large, dense symmetric generalized eigenvalue problems using secondary storage
• A Multiprocessor Algorithm for the Symmetric Tridiagonal Eigenvalue Problem

This page was built for publication: Tridiagonalization of band symmetric matrices for vector computers