The geometric mean algorithm
From MaRDI portal
Publication:2250180
Recommendations
Cites work
- A fast algorithm for solving linear systems of the Pascal type
- A fast eigenvalue algorithm for Pascal matrices
- A Multiprocessor Algorithm for the Symmetric Tridiagonal Eigenvalue Problem
- A Schur-based algorithm for computing bounds to the smallest eigenvalue of a symmetric positive definite Toeplitz matrix
- Bisection is not Optimal on Vector Processors
- Computing the Minimum Eigenvalue of a Symmetric Positive Definite Toeplitz Matrix
- scientific article; zbMATH DE number 3671573 (Why is no real title available?)
- scientific article; zbMATH DE number 53686 (Why is no real title available?)
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 3451330 (Why is no real title available?)
- Numerical methods for large eigenvalue problems
- Numerical Solution of the Eigenvalue Problem for Hermitian Toeplitz Matrices
- On the correctness of some bisection-like parallel eigenvalue algorithms in floating point arithmetic
- Perturbation Splitting for More Accurate Eigenvalues
- Recursive and iterative algorithms for computing eigenvalues of Hermitian Toeplitz matrices
- Solving dense generalized eigenproblems on multi-threaded architectures
Cited in
(2)
This page was built for publication: The geometric mean algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2250180)