Jacobi—Davidson algorithm and its application to modeling RF/Microwave detection circuits

Liu, Chibing; Lee, Jin‐Fa

doi:10.1016/s0045-7825(98)00163-7

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Numerical Illustration1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2006

2007

Publication Types

Select...

Article2

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(2 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…With respect to eigenvalue problems Ax = λx, the Jacobi-Davidson (JD) method [1,2] combined with efficient preconditioning represents a significant advance. It has been shown to be successful in several practical applications [3][4][5][6][7][8][9][10][11][12][13], confirming the potentialities revealed by its theoretical analysis [1,2,14,15].…”

Section: Introductionmentioning

confidence: 61%

JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices

Bollhöfer

Notay

2007

Computer Physics Communications

110

View full text Add to dashboard Cite

Section: Introductionmentioning

confidence: 61%

JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices

Bollhöfer

Notay

2007

Computer Physics Communications

110

View full text Add to dashboard Cite

“…The JD method has been successfully applied in several practical contexts, see for instance [9,79,22,65,42,46,23,47,42,83,15,82,7,19,55,33]. In [45], JD is compared numerically with Davidson and Lanczos.…”

Section: Numerical Illustrationmentioning

confidence: 99%

The Jacobi–Davidson method

Hochstenbach

Notay

2006

GAMM-Mitteilungen

View full text Add to dashboard Cite

The Jacobi–Davidson method is a popular technique to compute a few eigenpairs of large sparse matrices. Its introduction, about a decade ago, was motivated by the fact that standard eigensolvers often require an expensive factorization of the matrix to compute interior eigenvalues. Such a factorization may be infeasible for large matrices as arise in today's large‐scale simulations. In the Jacobi–Davidson method, one still needs to solve “inner” linear systems, but a factorization is avoided because the method is designed so as to favor the efficient use of modern iterative solution techniques, based on preconditioning and Krylov subspace acceleration. Here we review the Jacobi–Davidson method, with the emphasis on recent developments that are important in practical use. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)

show abstract

Jacobi—Davidson algorithm and its application to modeling RF/Microwave detection circuits

Cited by 2 publications

References 13 publications

JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices

JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices

The Jacobi–Davidson method

Contact Info

Product

Resources

About