Improving the finite element ordering for the frontal solver

DOI10.1080/12506559.2000.10511495MaRDI QIDQ2711234zbMATH OpenOpenAlexFDO

Authors Stéphane Nègre, Jacques Carlier, Piotr Breitkopf, J. P. Boufflet

Publication date 12 February 2002

Published in Revue Européenne des Éléments Finis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/12506559.2000.10511495

zbMATH Keywords

bandwidth minimizationbenchmark problemsCholesky methoddirect methoddomain decomposition methodfinite element orderingfrontal solverGaussian eliminationgreedy methodsmatrix with skyline structurenumerical examplessparse matricestabu search optimizationtriangulationwave reordering method

Mathematics Subject Classification ID

Boundary value problems for second-order elliptic equations (35J25) Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55)

Review text

The context is a domain decomposition method and the linear systems in each subdomain have medium size. The optimization of the numbering of nodes in each subdomain can have different goals: 1. When a direct method (Cholesky, Gauss) is chosen along with skyline structure of the matrix, one has to minimize the bandwidth of the overall system. 2. A direct method with sparse data structure needs to maximize the number of zero terms after triangulation. The sequence of nodes optimal for this pattern is usually different from that obtained for the skyline (band) storage. 3. When a frontal solver is used, the optimization concerning the sequence of elements is sought in the way to minimize the frontwidth. The paper is concerned with the proposition of two improvements of greedy methods. A wave reordering method adapts the reordering strategy during the process, and the tabu search optimization technique is adapted for finite element reordering. The well-known benchmark problems from 1979 are considered as small for actual purposes, and so numerical tests are not restricted to them.

Recommendations

• A new approach to minimising the frontwidth in finite element calculations
• scientific article; zbMATH DE number 3854350
• Multilevel hybrid spectral element ordering algorithms
• scientific article; zbMATH DE number 1062852
• scientific article; zbMATH DE number 1309685

Cited in

(3)

• A new approach to minimising the frontwidth in finite element calculations
• scientific article; zbMATH DE number 1309685 (Why is no real title available?)
• A domain renumbering algorithm for multi-domain boundary face method

This page was built for publication: Improving the finite element ordering for the frontal solver

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2711234)