Jacobi-Davidson methods for cubic eigenvalue problems

Tsung Min Hwang, Wen Wei Lin, Jinn Liang Liu, Weichung Wang

Research output: Contribution to journalArticle

35 Citations (Scopus)

Abstract

Several Jacobi-Davidson type methods are proposed for computing interior eigenpairs of large-scale cubic eigenvalue problems. To successively compute the eigenpairs, a novel explicit non-equivalence deflation method with low-rank updates is developed and analysed. Various techniques such as locking, search direction transformation, restarting, and preconditioning are incorporated into the methods to improve stability and efficiency. A semiconductor quantum dot model is given as an example to illustrate the cubic nature of the eigenvalue system resulting from the finite difference approximation. Numerical results of this model are given to demonstrate the convergence and effectiveness of the methods. Comparison results are also provided to indicate advantages and disadvantages among the various methods.

Original languageEnglish
Pages (from-to)605-624
Number of pages20
JournalNumerical Linear Algebra with Applications
Volume12
Issue number7
DOIs
Publication statusPublished - 2005 Sep 1

Fingerprint

Jacobi-Davidson Method
Eigenvalue Problem
Semiconductor quantum dots
Jacobi-Davidson
Deflation
Finite Difference Approximation
Comparison Result
Locking
Preconditioning
Quantum Dots
Semiconductors
Interior
Update
Eigenvalue
Numerical Results
Computing
Model
Demonstrate

Keywords

  • 3D schrödinger equation
  • Cubic Jacobi-Davidson method
  • Cubic eigenvalue problem
  • Non-equivalence deflation

ASJC Scopus subject areas

  • Algebra and Number Theory
  • Applied Mathematics

Cite this

Jacobi-Davidson methods for cubic eigenvalue problems. / Hwang, Tsung Min; Lin, Wen Wei; Liu, Jinn Liang; Wang, Weichung.

In: Numerical Linear Algebra with Applications, Vol. 12, No. 7, 01.09.2005, p. 605-624.

Research output: Contribution to journalArticle

Hwang, Tsung Min ; Lin, Wen Wei ; Liu, Jinn Liang ; Wang, Weichung. / Jacobi-Davidson methods for cubic eigenvalue problems. In: Numerical Linear Algebra with Applications. 2005 ; Vol. 12, No. 7. pp. 605-624.
@article{348f1ce04f98440b8dc224a53a8fe8e5,
title = "Jacobi-Davidson methods for cubic eigenvalue problems",
abstract = "Several Jacobi-Davidson type methods are proposed for computing interior eigenpairs of large-scale cubic eigenvalue problems. To successively compute the eigenpairs, a novel explicit non-equivalence deflation method with low-rank updates is developed and analysed. Various techniques such as locking, search direction transformation, restarting, and preconditioning are incorporated into the methods to improve stability and efficiency. A semiconductor quantum dot model is given as an example to illustrate the cubic nature of the eigenvalue system resulting from the finite difference approximation. Numerical results of this model are given to demonstrate the convergence and effectiveness of the methods. Comparison results are also provided to indicate advantages and disadvantages among the various methods.",
keywords = "3D schr{\"o}dinger equation, Cubic Jacobi-Davidson method, Cubic eigenvalue problem, Non-equivalence deflation",
author = "Hwang, {Tsung Min} and Lin, {Wen Wei} and Liu, {Jinn Liang} and Weichung Wang",
year = "2005",
month = "9",
day = "1",
doi = "10.1002/nla.423",
language = "English",
volume = "12",
pages = "605--624",
journal = "Numerical Linear Algebra with Applications",
issn = "1070-5325",
publisher = "John Wiley and Sons Ltd",
number = "7",

}

TY - JOUR

T1 - Jacobi-Davidson methods for cubic eigenvalue problems

AU - Hwang, Tsung Min

AU - Lin, Wen Wei

AU - Liu, Jinn Liang

AU - Wang, Weichung

PY - 2005/9/1

Y1 - 2005/9/1

N2 - Several Jacobi-Davidson type methods are proposed for computing interior eigenpairs of large-scale cubic eigenvalue problems. To successively compute the eigenpairs, a novel explicit non-equivalence deflation method with low-rank updates is developed and analysed. Various techniques such as locking, search direction transformation, restarting, and preconditioning are incorporated into the methods to improve stability and efficiency. A semiconductor quantum dot model is given as an example to illustrate the cubic nature of the eigenvalue system resulting from the finite difference approximation. Numerical results of this model are given to demonstrate the convergence and effectiveness of the methods. Comparison results are also provided to indicate advantages and disadvantages among the various methods.

AB - Several Jacobi-Davidson type methods are proposed for computing interior eigenpairs of large-scale cubic eigenvalue problems. To successively compute the eigenpairs, a novel explicit non-equivalence deflation method with low-rank updates is developed and analysed. Various techniques such as locking, search direction transformation, restarting, and preconditioning are incorporated into the methods to improve stability and efficiency. A semiconductor quantum dot model is given as an example to illustrate the cubic nature of the eigenvalue system resulting from the finite difference approximation. Numerical results of this model are given to demonstrate the convergence and effectiveness of the methods. Comparison results are also provided to indicate advantages and disadvantages among the various methods.

KW - 3D schrödinger equation

KW - Cubic Jacobi-Davidson method

KW - Cubic eigenvalue problem

KW - Non-equivalence deflation

UR - http://www.scopus.com/inward/record.url?scp=25144512445&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=25144512445&partnerID=8YFLogxK

U2 - 10.1002/nla.423

DO - 10.1002/nla.423

M3 - Article

AN - SCOPUS:25144512445

VL - 12

SP - 605

EP - 624

JO - Numerical Linear Algebra with Applications

JF - Numerical Linear Algebra with Applications

SN - 1070-5325

IS - 7

ER -