Extreme eigenvalues of large sparse matrices by Rayleigh quotient and modified conjugate gradients
From MaRDI portal
(Redirected from Publication:1067355)
Recommendations
- Computation of minimum eigenvalue through minimization of rayleigh's quotient for large sparse matrices using vector computer:
- scientific article; zbMATH DE number 3997026
- Accelerated simultaneous iterations for large finite element eigenproblems
- An improved iterative optimization technique for the leftmost eigenpairs of large symmetric matrices
- On the approximate computation of extreme eigenvalues and the condition number of nonsingular matrices
Cites work
- A class of iterative methods for finite element equations
- An iterative procedure for the calculation of the lowest real eigenvalue and eigenvector of a nonsymmetric matrix
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Berechnung von Eigenwerten und Eigenvektoren normaler Matrizenpaare durch Ritz‐Iteration
- Fast solution to finite element flow equations by newton iteration and modified conjugate gradient method
- Gradient methods for finite-element eigenproblems.
- scientific article; zbMATH DE number 3181418 (Why is no real title available?)
- scientific article; zbMATH DE number 3709500 (Why is no real title available?)
- scientific article; zbMATH DE number 3771171 (Why is no real title available?)
- scientific article; zbMATH DE number 3537182 (Why is no real title available?)
- scientific article; zbMATH DE number 3553640 (Why is no real title available?)
- scientific article; zbMATH DE number 3083850 (Why is no real title available?)
- Minimal eigenvalue of large sparse matrices by an efficient reverse power-conjugate gradient scheme
- New iterative methods for solution of the eigenproblem
- Optimal gradient minimization scheme for finite element eigenproblems
- The computational efficiency of a new minimization algorithm for eigenvalue analysis
- The eigenvalue problem \((A-\lambda B)x = 0\) for symmetric matrices of high order
- The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations
- The iterative calculation of several of the lowest or highest eigenvalues and corresponding eigenvectors of very large symmetric matrices
Cited in
(15)- An improved iterative optimization technique for the leftmost eigenpairs of large symmetric matrices
- Accelerated simultaneous iterations for large finite element eigenproblems
- On the approximate computation of extreme eigenvalues and the condition number of nonsingular matrices
- An orthogonal accelerated deflation technique for large symmetric eigenproblems
- A method using successive iteration of analysis and design for large-scale topology optimization considering eigenfrequencies
- A Rayleigh-Chebyshev procedure for finding the smallest eigenvalues and associated eigenvectors of large sparse Hermitian matrices
- scientific article; zbMATH DE number 440672 (Why is no real title available?)
- 3-D nested eigenanalysis on finite element grids
- Computation of minimum eigenvalue through minimization of rayleigh's quotient for large sparse matrices using vector computer:
- scientific article; zbMATH DE number 3913549 (Why is no real title available?)
- scientific article; zbMATH DE number 4112144 (Why is no real title available?)
- CONJUGATE GRADIENT METHODS FOR SOLVING THE SMALLEST EIGENPAIR OF LARGE SYMMETRIC EIGENVALUE PROBLEMS
- scientific article; zbMATH DE number 3997026 (Why is no real title available?)
- Multilevel preconditioned iterative eigensolvers for Maxwell eigenvalue problems
- Computing several eigenpairs of Hermitian problems by conjugate gradient iterations
This page was built for publication: Extreme eigenvalues of large sparse matrices by Rayleigh quotient and modified conjugate gradients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1067355)
