Photo by ericagarciathomas4414 from unsplash
The methods used for extracting an approximate eigenpair are crucial in sparse iterative eigensolvers. Using least squares and line search techniques this paper devises a method for an approximate eigenpair… Click to show full abstract
The methods used for extracting an approximate eigenpair are crucial in sparse iterative eigensolvers. Using least squares and line search techniques this paper devises a method for an approximate eigenpair extraction. Numerical comparison of the Jacobi–Davidson method using the suggested method of eigenpair extraction, Rayleigh–Ritz, and refined Ritz projections shows that the suggested method is a viable alternative.
Keywords:
least squares;
davidson method;
jacobi davidson;
squares line;
line search
Journal Title: Bit Numerical Mathematics
Year Published: 2020
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Bit Numerical Mathematics
Year Published: 2020
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!