Computation of minimum eigenvalue through minimization of rayleigh's quotient for large sparse matrices using vector computer:
From MaRDI portal
Publication:3486742
DOI10.1080/00207169008803913zbMath0706.65031OpenAlexW1983187688MaRDI QIDQ3486742
Publication date: 1990
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169008803913
Rayleigh quotientvector computerconjugate gradient minimization algorithmincomplete Cholesky and polynomial preconditionersLarge sparse symmetric eigenvalue problems
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05)
Related Items (1)
Cites Work
- A parallel implementation of the QR-algorithm
- The parallel calculation of the eigenvalues of a real matrix A
- The eigenvalue problem \((A-\lambda B)x = 0\) for symmetric matrices of high order
- Efficient implementation of Jacobi's diagonalization method on the DAP
- Extreme eigenvalues of large sparse matrices by Rayleigh quotient and modified conjugate gradients
- An improved iterative optimization technique for the leftmost eigenpairs of large symmetric matrices
- An improved parallel Jacobi method for diagonalizing a symmetric matrix
- Effect of the CYBER 205 on the choice of method for solving the eigenvalue problem \((A-\lambda M)x=0\)
- New software for large dense symmetric generalized eigenvalue problems using secondary storage
- A linear algebra package for a local memory multiprocessor: Problems, proposals and solutions
- SUPRENUM software for the symmetric eigenvalue problem
- Accelerated simultaneous iterations for large finite element eigenproblems
- Linear algebra software on a vector computer
- Simultaneous Rayleigh-quotient minimization methods for Ax=lambdaBx
- The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations
- Minimal eigenvalue of large sparse matrices by an efficient reverse power-conjugate gradient scheme
- New iterative methods for solution of the eigenproblem
- An asynchronous parallel version of the power method
- Polynomial Preconditioners for Conjugate Gradient Calculations
- Practical Use of Polynomial Preconditionings for the Conjugate Gradient Method
- A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
- A Multiprocessor Algorithm for the Symmetric Tridiagonal Eigenvalue Problem
- On vectorizing the preconditioned generalized conjugate residual methods
- Rational Krylov: A Practical Algorithm for Large Sparse Nonsymmetric Matrix Pencils
- Numerical comparison of preconditionings for large sparse finite element problems
- The computational efficiency of a new minimization algorithm for eigenvalue analysis
- Computational Variants of the Lanczos Method for the Eigenproblem
This page was built for publication: Computation of minimum eigenvalue through minimization of rayleigh's quotient for large sparse matrices using vector computer:
