Top

BIT Numerical Mathematics

Published in:

12-05-2020

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

Authors: Mashetti Ravibabu, Arindama Singh

Published in: BIT Numerical Mathematics | Issue 4/2020

Activate our intelligent search to find suitable subject content or patents.

search-config

AI-assisted search

Off

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.

previous article A semidiscrete Galerkin scheme for a coupled two-scale elliptic–parabolic system: well-posedness and convergence approximation rates

next article Lower and upper bounds for strong approximation errors for numerical approximations of stochastic heat equations

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Agullo, E., Giraud, L., Salas, P., Zounon, M.: Interpolation-restart strategies for resilient eigensolvers. SIAM J. Sci. Comput. 38(5), C560–C583 (2016)MathSciNetCrossRef

Bai, Z., Day, D., Demmel, J., Dongarra, J.: A Test Matrix Collection for Non-Hermitian Eigenvalue Problems, Technical Report CS-97-355, University of Tennessee Knoxville, TN, USA, (1997). http://math.nist.gov/MatrixMarket

de Sturler, E: Improving the convergence of Jacobi-Davidson Algorithm, Technical Report, UIUCDCS-R-2000-2173, (2000)

Feng, S., Jia, Z.: A Refined Jacobi-Davidson method and its correction equation. Comput. Math. Appl. 49, 417–427 (2005)MathSciNetCrossRef

Fokkema, D.R., Sleijpen, G.L.G., van der Vorst, H.A.: Jacobi-Davidson style QR and QZ algorithms for the reduction of matrix pencils. SIAM J. Sci. Comput. 20(1), 94–125 (1998)MathSciNetCrossRef

Gerseberger, M., Slejipen, Gerard L.G.: Alternative correction equations in Jacobi-Davidson method. Numer. Linear algebra Appl. 6, 235–253 (1999)MathSciNetCrossRef

Hochstenbach, M.E., Notay, Y.: The Jacobi-Davidson method. GAMM Mitteilungen 29, 368–382 (2006)MathSciNetCrossRef

Hochstenbach, M.E., Notay, Y.: Controlling inner iterations in the Jacobi-Davidson method. SIAM. J. Matrix Anal. Appl. 31(2), 460–477 (2009)MathSciNetCrossRef

Jia, Z.: The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors. Math. Comput. 74(251), 1441–1456 (2005)MathSciNetCrossRef

10.

Jia, Z.: Some theoretical comparisons of refined Ritz vectors and Ritz vectors. Sci. China Ser. A 47, 222–233 (2004)MathSciNetCrossRef

11.

Jia, Z., Stewart, G.W.: An anlaysis of the Rayleigh-Ritz method for approximating eigenspaces. Math. Comput. 70(234), 637–647 (2000)CrossRef

12.

Morgan, R.B.: Computing interior eigenvalues of large matrices. Linear Algebra Appl. 154(156), 289–309 (1991)MathSciNetCrossRef

13.

Morgan, R.B., Zeng, Min: Harmonic Projection Methods for Large Non-symmetric Eigenvalue Problems. Numer. Linear Algebra Appl. 5, 33–55 (1998)MathSciNetCrossRef

14.

Ostrowski, A.M.: On the convergence of the Rayleigh quotient iteration for the computation of the characteristic roots and vectors. III (Generalized Rayleigh quotient characteristic roots with linear elementary divisors). Arch. Ration. Mech. Anal. 3, 325–340 (1959)MathSciNetCrossRef

15.

Ovtchinnikov, E.E.: Jacobi correction equation, line search and conjugate gradients in hermitian eigenvalue computation I: Computing an extreme eigenvalue. SIAM J. Numer Anal 46(5), 2567–2592 (2008)MathSciNetCrossRef

16.

Ravibabu, M., Singh, A.: On refined Ritz vectors and polynomial characterization. Comput. Math. Appl. 67, 1057–1064 (2014)MathSciNetCrossRef

17.

Ravibabu, M., Singh, A.: A new variant of Arnoldi method for approximation of eigenpairs. J. Comput. Appl. Math. 344, 424–437 (2018). https://doi.org/10.1016/j.cam.2018.05.047MathSciNetCrossRefMATH

18.

Saad, Y.: Numerical Methods for Large Eigenvalue Problems, 2nd edn. SIAM, New Delhi (2001)

19.

Sleijpen, G.L.G., Van der Vorst, H.A.: A Jacobi-Davidson iteration method for linear eigenvalue problems. SIAM Rev. 42(2), 267–293 (2000)MathSciNetCrossRef

20.

Stewart, G.W.: Matrix Algorithms, vol II Eigensystems. SIAM, Philadelphia (2001)CrossRef

21.

Stewart, G.W.: A generalization of Saad’s theorem on Rayleigh-Ritz approximations. Linear Algebra Appl. 327, 115–119 (2001)MathSciNetCrossRef

22.

Wu, G., Pang, H.K.: On the correction equation of the Jacobi-Davidson method. Linear Algebra Appl. 522, 51–70 (2017)MathSciNetCrossRef

23.

Zöllner, M.R., Thies, Jonas, Kreutzer, Moritz, Alvermann, Andreas, Pieper, Andreas, Basermann, Achim, Hager, Georg, Wellein, Gerhard, Fehske, Holger: Increasing the performance of the Jacobi-Davidson method by blocking. SIAM J. Sci. Comput. 37(6), C697–C722 (2015)MathSciNetCrossRef

Title: The Least squares and line search in extracting eigenpairs in Jacobi–Davidson method
Authors: Mashetti Ravibabu
Arindama Singh
Publication date: 12-05-2020
Publisher: Springer Netherlands
Published in: BIT Numerical Mathematics / Issue 4/2020
Print ISSN: 0006-3835
Electronic ISSN: 1572-9125
DOI: https://doi.org/10.1007/s10543-020-00806-3

Springer Professional

Abstract

Please log in to get access to your license.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft"

Springer Professional "Technik"

Springer Professional "Wirtschaft+Technik"

Other articles of this Issue 4/2020

Variational formulation for fractional inhomogeneous boundary value problems

Study of micro–macro acceleration schemes for linear slow-fast stochastic differential equations with additive noise

Modified averaged vector field methods preserving multiple invariants for conservative stochastic differential equations

Semi-implicit Euler–Maruyama method for non-linear time-changed stochastic differential equations

A semidiscrete Galerkin scheme for a coupled two-scale elliptic–parabolic system: well-posedness and convergence approximation rates

Inexact methods for the low rank solution to large scale Lyapunov equations

Premium Partner