The computational efficiency of a new minimization algorithm for eigenvalue analysis
From MaRDI portal
Publication:5632046
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Nonlinear programming (90C30) Finite element, Rayleigh-Ritz, Galerkin and collocation methods for ordinary differential equations (65L60) Multiple scale methods for ordinary differential equations (34E13) Dynamical systems and ergodic theory (37-XX)
Cited in
(11)- An accelerated conjugate gradient algorithm to compute low-lying eigenvalues -- a study for the Dirac operator in SU(2) lattice QCD
- An improved iterative optimization technique for the leftmost eigenpairs of large symmetric matrices
- A partial preconditioned conjugate gradient method for large eigenproblems
- Dual analysis with general boundary conditions
- Computation of minimum eigenvalue through minimization of rayleigh's quotient for large sparse matrices using vector computer:
- Extreme eigenvalues of large sparse matrices by Rayleigh quotient and modified conjugate gradients
- Conjugate gradient methods for the Rayleigh quotient minimization of generalized eigenvalue problems
- Updating component reduction bases of static and vibration modes using preconditioned iterative techniques
- Ein neues Gradientenverfahren zur simultanen Berechnung der kleinsten oder größten Eigenwerte des allgemeinen Eigenwertproblems
- On conjugate gradient-like methods for eigen-like problems
- Eigenvalue extraction for large finite element models using a new conjugate gradient algorithm
This page was built for publication: The computational efficiency of a new minimization algorithm for eigenvalue analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5632046)
