✦ LIBER ✦

Analysis of matrix-dependent multigrid algorithms

✍ Scribed by Yair Shapira

Publisher: John Wiley and Sons
Year: 1998
Tongue: English
Weight: 225 KB
Volume: 5
Category: Article
ISSN: 1070-5325
DOI: 10.1002/(sici)1099-1506(199805/06)5:3<165::aid-nla132>3.0.co;2-n

No coin nor oath required. For personal study only.

✦ Synopsis

Convergence theory for a multigrid method with matrix-dependent restriction, prolongation and coarse-grid operators is developed for a class of SPD problems. It motivates the construction of improved multigrid versions for diffusion problems with discontinuous coefficients. A computational two-level analysis method for a class of separable problems is also available. It motivates the design of matrix-dependent multigrid algorithms and, in particular, multiple coarse-grid correction algorithms for highly indefinite equations. Numerical experiments show the advantage of the present methods for several examples.

📜 SIMILAR VOLUMES

Algebraic analysis of multigrid algorith

Algebraic analysis of multigrid algorithms

✍ Christoph Pflaum 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 158 KB 👁 2 views

We study the convergence rate of multilevel algorithms from an algebraic point of view. This requires a detailed analysis of the constant in the strengthened Cauchy-Schwarz inequality between the coarse-grid space and a so-called complementary space. This complementary space may be spanned by standa

ALGORITHMIC ASPECTS OF ADAPTIVE MULTIGRI

ALGORITHMIC ASPECTS OF ADAPTIVE MULTIGRID FINITE ELEMENT ANALYSIS

✍ S. LOPEZ; R. CASCIARO 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 306 KB 👁 2 views

This paper describes the algorithmic aspects of a multigrid solver based on the adaptive generation of a sequence of discretizing meshes. Non-uniform discretization is obtained by conÿning ÿner meshes to progressively smaller subdomains. New meshes are generated through bisection reÿnement according

Convergence of Multigrid Algorithms for

Convergence of Multigrid Algorithms for Interior Penalty Methods

✍ Susanne C. Brenner; Jie Zhao 📂 Article 📅 2005 🏛 John Wiley and Sons ⚖ 179 KB 👁 1 views

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,

Analysis of algorithms

✍ Philippe Flajolet; Wojciech Szpankowski 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 146 KB 👁 1 views

This special issue is devoted to the A¨erage-Case Analysis of Algorithms. Analysis of algorithms aims at a precise prediction of the expected performances of algorithms and data structures of general use in computer science. Quantification of performance goes from mean value estimates of costs to an

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 👁 2 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 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 👁 2 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