A direct solver with reutilization of Lu factorizations for h-adaptive finite element grids with point singularities

DOI10.1016/J.CAMWA.2013.02.006zbMATH Open1319.65116arXiv1212.1992OpenAlexW62823550WikidataQ114201601 ScholiaQ114201601MaRDI QIDQ493500FDOQ493500

Authors: Maciej Paszynski, David Pardo, Victor M. Calo 

Publication date: 3 September 2015

Published in: Computers & Mathematics with Applications (Search for Journal in Brave)

Abstract: This paper describes a direct solver algorithm for a sequence of finite element meshes that are h-refined towards one or several point singularities. For such a sequence of grids, the solver delivers linear computational cost O(N) in terms of CPU time and memory with respect to the number of unknowns N. The linear computational cost is achieved by utilizing the recursive structure provided by the sequence of h-adaptive grids with a special construction of the elimination tree that allows for reutilization of previously computed partial LU factorizations over the entire unrefined part of the computational mesh. The reutilization technique reduces the computational cost of the entire sequence of h-refined grids from O(N^2) down to O(N). Theoretical estimates are illustrated with numerical results on two- and three-dimensional model problems exhibiting one or several point singularities.

Full work available at URL: https://arxiv.org/abs/1212.1992

Recommendations

• Direct solvers performance on \(h\)-adapted grids
• A parallel direct solver for the self-adaptive \(hp\) finite element method
• A direct solver for finite element matrices requiring \(O(N \log N)\) memory places.
• Element partition trees for \(h\)-refined meshes to optimize direct solver performance. I: Dynamic programming
• ALGORITHMIC ASPECTS OF ADAPTIVE MULTIGRID FINITE ELEMENT ANALYSIS

zbMATH Keywords

finite element methoddirect solver\(h\) adaptationlinear computational costreutilization

Mathematics Subject Classification ID

Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)

Cites Work

• Multifrontal parallel distributed symmetric and unsymmetric solvers
• A fully asynchronous multifrontal solver using distributed dynamic scheduling
• The h-p version of the finite element method. I. The basic approximation results
• Title not available (Why is that?)
• Computing with hp-ADAPTIVE FINITE ELEMENTS
• The Multifrontal Solution of Indefinite Sparse Symmetric Linear
• The h-p version of the finite element method. II. General results and applications
• A frontal solution program for finite element analysis
• A fast direct solver for elliptic problems on general meshes in 2D
• The design, implementation, and evaluation of a symmetric banded linear solver for distributed-memory parallel computers
• The Multifrontal Solution of Unsymmetric Sets of Linear Equations
• Towards a tighter coupling of bottom-up and top-down sparse matrix ordering methods
• Sparse direct factorizations through unassembled hyper-matrices
• On the Parallelization of Self-Adaptive hp-Finite Element Methods Part I. Composite Programmable Graph GrammarModel
• Recent advances in direct methods for solving unsymmetric sparse systems of linear equations

Cited In (5)

• Direct solvers performance on \(h\)-adapted grids
• Element partition trees for \(h\)-refined meshes to optimize direct solver performance. I: Dynamic programming
• Adaptive finite element analysis of elliptic problems based on bubble-type local mesh generation
• A survey on direct solvers for Galerkin methods
• Using a graph grammar system in the finite element method

Uses Software

• MUMPS
• METIS

This page was built for publication: A direct solver with reutilization of Lu factorizations for \(h\)-adaptive finite element grids with point singularities

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