✦ LIBER ✦

Convergence Estimates of Multilevel Additive and Multiplicative Algorithms for Non-symmetric and Indefinite Problems

✍ Scribed by Zhiqiang Cai; Chen-Yao G. Lai

Publisher: John Wiley and Sons
Year: 1996
Tongue: English
Weight: 639 KB
Volume: 3
Category: Article
ISSN: 1070-5325
DOI: 10.1002/(sici)1099-1506(199605/06)3:3<205::aid-nla79>3.0.co;2-k

No coin nor oath required. For personal study only.

✦ Synopsis

New uniform estimates for multigrid algorithms are established for certain non-symmetric indefinite problems. In particular, we are concerned with the simple additive algorithm and multigrid (V(1, 0)-cycle) algorithms given in [5]. We prove, without full elliptic regularity assumption, that these algorithms have uniform reduction per iteration, independent of the finest mesh size and number of refinement levels, provided that the coarsest mesh size is sufficiently small.

📜 SIMILAR VOLUMES

ON THE CONVERGENCE OF ZERO-FINDING EIGEN

ON THE CONVERGENCE OF ZERO-FINDING EIGENSOLUTION ALGORITHMS FOR SOLVING NON-LINEAR EIGENVALUE PROBLEMS

✍ MOHAMMEDI R. ABDEL-AZIZ 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB 👁 2 views

This paper presents a convergence theory for non-linear eigenvalue methods. The basic idea of these methods, which have been described by the author in an earlier paper, 1 is to apply an eigen-solver in conjunction with a zero-ÿnding technique for solving the non-linear eigenvalue problems. The main