✦ LIBER ✦

Convergence of Multigrid Algorithms for Interior Penalty Methods

✍ Scribed by Susanne C. Brenner; Jie Zhao

Publisher: John Wiley and Sons
Year: 2005
Weight: 179 KB
Volume: 2
Category: Article
ISSN: 1611-8170
DOI: 10.1002/anac.200410019

No coin nor oath required. For personal study only.

✦ Synopsis

V -cycle, F -cycle and W -cycle multigrid algorithms for interior penalty methods for second order elliptic boundary value problems are studied in this paper. It is shown that these algorithms converge uniformly with respect to all grid levels if the number of smoothing steps is sufficiently large, and that the contraction numbers decrease as the number of smoothing steps increases, at a rate determined by the elliptic regularity of the problem.

📜 SIMILAR VOLUMES

Convergence acceleration of segregated a

Convergence acceleration of segregated algorithms using dynamic tuning additive correction multigrid strategy

✍ Franz Zdravistch; Clive A.J. Fletcher; Masud Behnia 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 388 KB 👁 1 views

A convergence acceleration method based on an additive correction multigrid -SIMPLEC (ACM-S) algorithm with dynamic tuning of the relaxation factors is presented. In the ACM-S method, the coarse grid velocity correction components obtained from the mass conservation (velocity potential) correction e

Estimation of convergence rate for robus

Estimation of convergence rate for robust identification algorithms

✍ O. Yu. Kul'Chitskiy; A. E. Mozgovoy 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 204 KB 👁 1 views

On the convergence of nonnested multigri

On the convergence of nonnested multigrid methods with nested spaces on coarse grids

✍ Zhangxin Chen 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 178 KB

Multigrid methods for discretized partial differential problems using nonnested conforming and nonconforming finite elements are here defined in the general setting. The coarse-grid corrections of these multigrid methods make use of different finite element spaces from those on the finest grid. In g

Techniques for bounding the convergence

Techniques for bounding the convergence rate of genetic algorithms

✍ Yuri Rabinovich; Avi Wigderson 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 308 KB 👁 1 views

The main purpose of the present paper is the study of computational aspects, ## Ž . and primarily the convergence rate, of genetic algorithms GAs . Despite the fact that such algorithms are widely used in practice, little is known so far about their theoretical properties, and in particular about

A fast wavelet multigrid algorithm for s

A fast wavelet multigrid algorithm for solution of electromagnetic integral equations

✍ Gaofeng Wang; Robert W. Dutton; Jiechang Hou 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 1 views

A multigrid scheme naturally contained in wa¨elet expansion methods is presented. Careful examination of the wa¨elet matrix re¨eals matrix representations of an integral operator at ¨arious coarse le¨els that can be identified as nested submatrices of the original wa¨elet matrix at the finest le¨el.

Convergence properties of bias-eliminati

Convergence properties of bias-eliminating algorithms for errors-in-variables identification

✍ Torsten Söderström; Mei Hong; Wei Xing Zheng 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 174 KB 👁 2 views

This paper considers the problem of dynamic errors-in-variables identification. Convergence properties of the previously proposed bias-eliminating algorithms are investigated. An error dynamic equation for the bias-eliminating parameter estimates is derived. It is shown that the convergence of the b