The geometric mean algorithm

DOI10.1016/j.amc.2012.08.002zbMath1291.65132OpenAlexW2166063424MaRDI QIDQ2250180

Rui Ralha

Publication date: 4 July 2014

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1822/20483

zbMATH Keywords

eigenvaluessymmetric matricesgeometric bisection

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Uses Software

• LAPACK
• Matlab

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving dense generalized eigenproblems on multi-threaded architectures
• A fast eigenvalue algorithm for Pascal matrices
• On the correctness of some bisection-like parallel eigenvalue algorithms in floating point arithmetic
• A fast algorithm for solving linear systems of the Pascal type
• A Schur-based algorithm for computing bounds to the smallest eigenvalue of a symmetric positive definite Toeplitz matrix
• Numerical Methods for Large Eigenvalue Problems
• Computing the Minimum Eigenvalue of a Symmetric Positive Definite Toeplitz Matrix
• A Multiprocessor Algorithm for the Symmetric Tridiagonal Eigenvalue Problem
• Bisection is not Optimal on Vector Processors
• Numerical Solution of the Eigenvalue Problem for Hermitian Toeplitz Matrices
• Recursive and iterative algorithms for computing eigenvalues of Hermitian Toeplitz matrices
• Perturbation Splitting for More Accurate Eigenvalues

This page was built for publication: The geometric mean algorithm