On the Parallelization of Self-Adaptive hp-Finite Element Methods Part I. Composite Programmable Graph GrammarModel
algorithmfinite element methodparallel computingLaplace equationmesh generationgraph grammarautomatic \(hp\) adaptivity
Parallel numerical computation (65Y05) Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) 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) Grammars and rewriting systems (68Q42)
- On the Parallelization of Self-Adaptive hp-Finite Element Methods Part II. Partitioning Communication Agglomeration Mapping (PCAM) Analysis
- A graph grammar model of the \(hp\) adaptive three dimensional finite element method. I.
- A graph grammar model of the \(hp\) adaptive three dimensional finite element method. II.
- Applications of a hyper-graph grammar system in adaptive finite-element computations
- Using a graph grammar system in the finite element method
- On the Parallelization of Self-Adaptive hp-Finite Element Methods Part II. Partitioning Communication Agglomeration Mapping (PCAM) Analysis
- Using a graph grammar system in the finite element method
- Applications of a hyper-graph grammar system in adaptive finite-element computations
- A hybrid algorithm for solving inverse problems in elasticity
- A graph grammar model of the \(hp\) adaptive three dimensional finite element method. I.
- A graph grammar model of the \(hp\) adaptive three dimensional finite element method. II.
- A direct solver with reutilization of Lu factorizations for \(h\)-adaptive finite element grids with point singularities
This page was built for publication: On the Parallelization of Self-Adaptive hp-Finite Element Methods Part I. Composite Programmable Graph GrammarModel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3398968)
