The Least squares and line search in extracting eigenpairs in Jacobi–Davidson method

Ravibabu, M and Singh, A (2020) The Least squares and line search in extracting eigenpairs in Jacobi–Davidson method. In: BIT Numerical Mathematics, 60 (4). pp. 1033-1055.

PDF BIT_NUM_MAT_2020.pdf - Published Version Restricted to Registered users only Download (826kB) | Request a copy

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. © 2020, Springer Nature B.V.

Item Type:	Journal Article
Publication:	BIT Numerical Mathematics
Publisher:	Springer
Additional Information:	Copy right for this article belongs to Springer
Keywords:	Jacobi–Davidson method · Rayleigh–Ritz projection · Refined Rayleigh–Ritz projection · Least Squares problem · Line Search
Department/Centre:	Division of Interdisciplinary Sciences > Computational and Data Sciences
Date Deposited:	14 Dec 2020 10:32
Last Modified:	14 Dec 2020 10:32
URI:	http://eprints.iisc.ac.in/id/eprint/65644

Actions (login required)

View Item