A parallel algorithm for the dense symmetric eigenvalue problem on a transputer array

DOI10.1016/0167-8191(92)90079-MzbMath0746.65036OpenAlexW2016254281MaRDI QIDQ1186180

T. Z. Kalamboukis

Publication date: 28 June 1992

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(92)90079-m

zbMATH Keywords

eigenvaluesnumerical experimentseigenvectorsparallel implementationdense matrixsimilarity transformationsring topologytransputer arrayperformance resultsHouseholder's algorithm

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05)

Related Items (4)

Parallel implementation of semiempirical quantum methods for the Intel platforms ⋮ Gaussian quadrature for matrix valued functions on the real line ⋮ Parallel algorithms for reduction of a general matrix to upper Hessenberg form on a shared memory multiprocessor ⋮ Parallel algorithms for reduction of a symmetric matrix to tridiagonal form on a shared memory multiprocessor

This page was built for publication: A parallel algorithm for the dense symmetric eigenvalue problem on a transputer array