Publication

Algebraic coarse grid operators for domain decomposition based preconditioners

Luca Formaggia
2002
Conference Papers

Abstract

We investigate some domain decomposition techniques to solve large scale aerodynamics problems on unstructured grids. Where implicit time advancing scheme are used, a large sparse linear system have to be solved at each step. To obtain good scalability and CPU times, a good preconditioner is needed for the parallel iterative solution of these systems. For the widely-used Schwarz technique this can be achieved by a coarse level operator. Since many of the current coarse operators are difficult to implement on unstructured 2D and 3D meshes, we have developed a purely algebraic procedure, that requires the entries of the matrix only

Official source

https://infoscience.epfl.ch/entities/publication/7289ab0e-0611-4645-a0f3-e5decd721556

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Luca Formaggia
2002
Conference Papers

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/7289ab0e-0611-4645-a0f3-e5decd721556

About this result

Related concepts (32)

Unstructured grid

An unstructured grid or irregular grid is a tessellation of a part of the Euclidean plane or Euclidean space by simple shapes, such as triangles or tetrahedra, in an irregular pattern. Grids of this type may be used in finite element analysis when the input to be analyzed has an irregular shape. Unlike structured grids, unstructured grids require a list of the connectivity which specifies the way a given set of vertices make up individual elements (see graph (data structure)).

Types of mesh

A mesh is a representation of a larger geometric domain by smaller discrete cells. Meshes are commonly used to compute solutions of partial differential equations and render computer graphics, and to analyze geographical and cartographic data. A mesh partitions space into elements (or cells or zones) over which the equations can be solved, which then approximates the solution over the larger domain. Element boundaries may be constrained to lie on internal or external boundaries within a model.

3D modeling

In 3D computer graphics, 3D modeling is the process of developing a mathematical coordinate-based representation of any surface of an object (inanimate or living) in three dimensions via specialized software by manipulating edges, vertices, and polygons in a simulated 3D space. Three-dimensional (3D) models represent a physical body using a collection of points in 3D space, connected by various geometric entities such as triangles, lines, curved surfaces, etc.

Related publications (1)

Algebraic coarse grid operators for domain decomposition based preconditioners

Chat with Graph Search

Database and Geometrical Characterization of 3D Stone Masonry Wall Microstructures