Element partition trees for h-refined meshes to optimize direct solver performance. I: Dynamic programming

DOI10.1515/AMCS-2017-0025MaRDI QIDQ2011908zbMATH OpenOpenAlexFDO

Authors Victor M. Calo, Konrad Jopek, Anna Paszyńska, Marcin Skotniczny, Hassan AbouEisha, Mikhail Moshkov, Maciej Paszynski

Publication date 27 July 2017

Published in International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1515/amcs-2017-0025

zbMATH Keywords

\(h\)-adaptive finite element methodelement partition treeextensions of dynamic programmingmultifrontal direct solversordering

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Finite element, Rayleigh-Ritz and Galerkin methods for initial value and initial-boundary value problems involving PDEs (65M60) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)

Recommendations

• scientific article; zbMATH DE number 833721
• A refinement-tree based partitioning method for dynamic load balancing with adaptively refined grids
• Direct solvers performance on \(h\)-adapted grids
• A direct solver with reutilization of Lu factorizations for \(h\)-adaptive finite element grids with point singularities
• scientific article; zbMATH DE number 2063818

Cites work

• H‐Adaptive finite element methods for dynamic problems, with emphasis on localization
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• A finite element method for extended KdV equations
• A fully asynchronous multifrontal solver using distributed dynamic scheduling
• Adaptive Finite Element Methods for Optimal Control of Partial Differential Equations: Basic Concept
• Adaptive Finite Element Methods for Parabolic Problems I: A Linear Model Problem
• An h-adaptive finite element solver for the calculations of the electronic structures
• An analytical and numerical approach to a bilateral contact problem with nonmonotone friction
• An Approximate Minimum Degree Ordering Algorithm
• Element partition trees for \(h\)-refined meshes to optimize direct solver performance. I: Dynamic programming
• Error Estimates for Adaptive Finite Element Computations
• Fast solvers for mesh-based computations
• scientific article; zbMATH DE number 5719287 (Why is no real title available?)
• scientific article; zbMATH DE number 3976197 (Why is no real title available?)
• scientific article; zbMATH DE number 6413793 (Why is no real title available?)
• Multifrontal parallel distributed symmetric and unsymmetric solvers
• PARFES: A method for solving finite element linear equations on multi-core computers
• Refined h-adaptive finite element procedure for large deformation geotechnical problems
• The Multifrontal Solution of Indefinite Sparse Symmetric Linear
• The Multifrontal Solution of Unsymmetric Sets of Linear Equations
• The Role of Elimination Trees in Sparse Factorization
• Using a graph grammar system in the finite element method

Cited in

(6)

• Applications of a hyper-graph grammar system in adaptive finite-element computations
• Direct solvers performance on \(h\)-adapted grids
• Element partition trees for \(h\)-refined meshes to optimize direct solver performance. I: Dynamic programming
• Coarse mesh partitioning for tree-based AMR
• A direct solver with reutilization of Lu factorizations for \(h\)-adaptive finite element grids with point singularities
• From h to p efficiently: strategy selection for operator evaluation on hexahedral and tetrahedral elements

Describes a project that uses

Uses Software

• MUMPS

This page was built for publication: Element partition trees for \(h\)-refined meshes to optimize direct solver performance. I: Dynamic programming

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