Skip to main content
SpringerLink
Log in

A Two-Level Method for Nonsymmetric Eigenvalue Problems

  • Original Papers
  • Published:
Acta Mathematicae Applicatae Sinica Aims and scope Submit manuscript

Abstract

A two-level discretization method for eigenvalue problems is studied. Compared to the standard Galerkin finite element discretization technique performed on a fine grid this method discretizes the eigenvalue problem on a coarse grid and obtains an improved eigenvector (eigenvalue) approximation by solving only a linear problem on the fine grid (or two linear problems for the case of eigenvalue approximation of nonsymmetric problems). The improved solution has the asymptotic accuracy of the Galerkin discretization solution. The link between the method and the iterated Galerkin method is established. Error estimates for the general nonsymmetric case are derived.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Babuška, I., Osborn, J.E. Eigenvalue problems, handbook of numerical analysis, Vol. II, Finite element methods (Part 1), P.G. Ciarlet, J.L. Lions eds, Elsevier, 641–792 1991

  2. Babuška I., Osborn J.E. Finite element-galerkin approximation of the eigenvalues and eigenvectors of selfadjoint problems. Math. Comp., 52: 275–297 (1989)

    Article  MathSciNet  Google Scholar 

  3. Chatelin, F. Spectral approximations of linear operators, Academic Press, New York, 1983

  4. Heuveline, V., Bertsch, C. On multigrid methods for the eigenvalue computation of nonselfadjoint elliptic operators. East-West J. Numer. Math., 8: 275–297 (2000)

    MATH  MathSciNet  Google Scholar 

  5. Lehoucq, R.B., Sorensen, D.C., Yang C. Arpack users’ guide: Solution of large-scale eigenvalue problems with impicitly restarted Arnoldi methods, SIAM, 1998 http://www.caam.rice.edu/software/ARPACK/

  6. Racheva, M.R., Andreev, A.B. Superconvergence postprocessing for eigenvalues. Comp. Meth. Appl. Math., 2: 171–185 (2002)

    MATH  MathSciNet  Google Scholar 

  7. Saad, Y. Sparskit: A basic tool for sparse matrix computations, 1999 ftp://ftp.cs.umn.edu/dept/sparse/

  8. Sloan, I.H. Iterated Galerkin method for eigenvalue problems. SIAM J. Numer. Anal., 13: 753–760 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  9. Xu, J., Zhou A. A two-grid discretization scheme for eigenvalue problems. Math. Comp., 70: 17–25 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  10. Xu, J., Zhou, A. Local and parallel finite element algorithms for eigenvalue problems. Acta. Comp., 18: 185–200 (2002)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Institute, Academy of Sciences of the Czech Republic, Žitná 25, 115 67, Praha 1, Czech Republic

    Karel Kolman

Authors
  1. Karel Kolman
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Karel Kolman.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kolman, K. A Two-Level Method for Nonsymmetric Eigenvalue Problems. Acta Mathematicae Applicatae Sinica, English Series 21, 1–12 (2005). https://doi.org/10.1007/s10255-005-0209-z

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10255-005-0209-z

Keywords

2000 MR Subject Classification

Search

Navigation