Element partition trees for h-refined meshes to optimize direct solver performance. I: Dynamic programming
DOI10.1515/AMCS-2017-0025zbMATH Open1369.65044OpenAlexW2735468326MaRDI QIDQ2011908FDOQ2011908
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)
Full work available at URL: https://doi.org/10.1515/amcs-2017-0025
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
ordering\(h\)-adaptive finite element methodelement partition treeextensions of dynamic programmingmultifrontal direct solvers
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)
Cites Work
- Multifrontal parallel distributed symmetric and unsymmetric solvers
- A fully asynchronous multifrontal solver using distributed dynamic scheduling
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- An Approximate Minimum Degree Ordering Algorithm
- An analytical and numerical approach to a bilateral contact problem with nonmonotone friction
- 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
- Title not available (Why is that?)
- Error Estimates for Adaptive Finite Element Computations
- The Role of Elimination Trees in Sparse Factorization
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- Title not available (Why is that?)
- Title not available (Why is that?)
- A finite element method for extended KdV equations
- An \(h\)-adaptive finite element solver for the calculations of the electronic structures
- Refined \(h\)-adaptive finite element procedure for large deformation geotechnical problems
- The Multifrontal Solution of Unsymmetric Sets of Linear Equations
- Element partition trees for \(h\)-refined meshes to optimize direct solver performance. I: Dynamic programming
- PARFES: A method for solving finite element linear equations on multi-core computers
- H‐Adaptive finite element methods for dynamic problems, with emphasis on localization
- Fast solvers for mesh-based computations
- Using a graph grammar system in the finite element method
Cited In (5)
- From h to p efficiently: strategy selection for operator evaluation on hexahedral and tetrahedral elements
- 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
- Applications of a hyper-graph grammar system in adaptive finite-element computations
Uses Software
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)
