Nonnested multigrid methods for linear problems
adaptive algorithmsC++conjugate gradient algorithmsfinite element methodlinear elasticity problemslinear elliptic problemsmultigrid methodsnumerical examplesperformancepreconditioningunstructered mesh
Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Complexity and performance of numerical algorithms (65Y20) Classical linear elasticity (74B05) Finite element methods applied to problems in solid mechanics (74S05)
The application of the finite element method for solving linear elliptic problems requires the solution of NEWLINE\[NEWLINE Au=b, \tag{1}NEWLINE\]NEWLINE where \(A\) is a symmetric matrix of order \(N\), and \(u\) and \(b\) are the vectors of unknown and independent term. Direct, iterative, and multigrid algorithms are commonly used to solve (1). Multigrid methods use several meshes for solving (1). Computational elements like nested iterations, coarse grid correction, transfer operators, and relaxation schemes are applied. However, engineering problems have complex geometries, which sometimes makes it difficult to generate a sequence of nested meshes. Thus, using nonnested approximation spaces is an interesting option. NEWLINENEWLINENEWLINEThis article presents an application of nonnested and unstructured multigrid methods to linear elasticity problems. A variational formulation for transfer operators and some multigrid strategies, including adaptive algorithms, are presented. Expressions for the performance evaluation of multigrid strategies and its comparison with direct and preconditioned conjugate gradient algorithms are also presented. A C++ implementation of the multigrid algorithms and the quadtree and octree data structures for transfer operators are discussed. Some two- and three-dimensional elasticity examples are analyzed.
- Adaptive non‐nested multigrid methods
- Optimal-Order Nonnested Multigrid Methods for Solving Finite Element Equations I: On Quasi-Uniform Meshes
- A non-nested Galerkin multi-grid method for solving linear and nonlinear solid mechanics problems
- scientific article; zbMATH DE number 3978556
- Evaluation of three unstructured multigrid methods on 3D finite element problems in solid mechanics
- A simple error estimator and adaptive procedure for practical engineerng analysis
- An alternating digital tree (ADT) algorithm for 3D geometric searching and intersection problems
- An unstructured multigrid method for elliptic problems
- Data structures and concepts for adaptive finite element methods
- Fully Adaptive Multigrid Methods
- scientific article; zbMATH DE number 3854346 (Why is no real title available?)
- Multi-Grid Algorithms with Applications to Elliptic Boundary Value Problems
- Multi-Level Adaptive Solutions to Boundary-Value Problems
- Multigrid solution of the 3‐D compressible euler equations on unstructured tetrahedral grids
- Multigrid solution of the two-dimensional Euler equations on unstructured triangular meshes
- Non-nested multi-grid solvers for mixed divergence-free scott-vogelius discretizations
- A non-nested Galerkin multi-grid method for solving linear and nonlinear solid mechanics problems
- A meshless geometric multigrid method based on a node-coarsening algorithm for the linear finite element discretization
- Nonlinear Krylov and moving nodes in the method of lines
- Adaptive non‐nested multigrid methods
- Evaluation of three unstructured multigrid methods on 3D finite element problems in solid mechanics
- The \texttt{deal.II} library, version 9.5
This page was built for publication: Nonnested multigrid methods for linear problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2747807)
