✦ LIBER ✦

ALGORITHMIC ASPECTS OF ADAPTIVE MULTIGRID FINITE ELEMENT ANALYSIS

✍ Scribed by S. LOPEZ; R. CASCIARO

Publisher: John Wiley and Sons
Year: 1997
Tongue: English
Weight: 306 KB
Volume: 40
Category: Article
ISSN: 0029-5981
DOI: 10.1002/(sici)1097-0207(19970315)40:5<919::aid-nme95>3.0.co;2-u

No coin nor oath required. For personal study only.

✦ Synopsis

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 to a local error indicator. A dynamic data structure, suitable for C-language implementations, and a technique for irregular nodes, which simpliÿes the treatment of interfaces between di erent reÿnement subdomains, are described. Several numerical examples using bilinear and HC ÿnite elements are presented at the end.

📜 SIMILAR VOLUMES

Algebraic analysis of multigrid algorith

Algebraic analysis of multigrid algorithms

✍ Christoph Pflaum 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 158 KB 👁 1 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

Analysis of matrix-dependent multigrid a

Analysis of matrix-dependent multigrid algorithms

✍ Yair Shapira 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 225 KB 👁 1 views

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

Finite element adaptive mesh analysis us

Finite element adaptive mesh analysis using a cluster of workstations

✍ K. P. Wang; J. C. Bruch Jr 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 236 KB 👁 1 views

Parallel computation on clusters of workstations is becoming one of the major trends in the study of parallel computations, because of their high computing speed, cost effectiveness and scalability. This paper presents studies of using a cluster of workstations for the ®nite element adaptive mesh an

An rh-method for efficient adaptive fini

An rh-method for efficient adaptive finite element analysis

✍ Oh, Hyung-Seok ;Lim, Jang-Keun ;Han, Seok-Young 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 238 KB 👁 2 views

An rh-method, which combines r-and h-methods, is proposed for cost-eective adaptive FE analysis in twodimensional linear elastic problems. Through various numerical test examples, the rh-method is compared with the h-method. From these examples it is concluded that the rh-method has the advantages o

Adaptive finite element computations of

Adaptive finite element computations of complex flows

✍ D. Pelletier 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 198 KB 👁 2 views

Recent efforts to develop and apply adaptive finite element techniques for solving complex flow problems are reviewed. The emphasis is not on new methods but on how to use existing methods to achieve accurate predictions. Various sources of errors, and means of detecting them, are discussed. The aim

A fast numerical homogenization algorith

A fast numerical homogenization algorithm for finite element analysis

✍ M. Morandi Cecchi; F. Marcuzzi 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 143 KB 👁 1 views

A numerical homogenization method is presented here to solve problems governed by partial di erential equations with coe cients that are generic functions in R 2 . It consists of a recursive ÿnite elements discretization and an algebraic homogenization. This method takes advantages of speed and memo