Optimizing Givens’ Algorithm for Multiprocessors

DOI10.1137/0909039MaRDI QIDQ3804076zbMATH OpenOpenAlexFDO

Authors Herbert J. Bernstein, Max Goldstein

Publication date 1988

Published in SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0909039

zbMATH Keywords

secant methodconvergence accelerationbisectionmultisectionsymmetric tridiagonal eigenvalue problemparallel processor

Mathematics Subject Classification ID

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

Recommendations

• An algorithm for the multiprocessor assignment problem
• scientific article; zbMATH DE number 3894470
• Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy
• scientific article; zbMATH DE number 1929944
• scientific article; zbMATH DE number 1294384
• An optimal parallel algorithm for the multiselection problem
• Optimal Combinatorial Functions Comparing Multiprocess Allocation Performance in Multiprocessor Systems
• scientific article; zbMATH DE number 1902275

Cited in

(2)

• Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy
• Bisection is not Optimal on Vector Processors

This page was built for publication: Optimizing Givens’ Algorithm for Multiprocessors

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