The cell discretization algorithm; An overview
From MaRDI portal
(Redirected from The cell discretization algorithm; An overview)
Recommendations
- An abridged history of cell discretization
- The Application of Cell Discretization to a “Circle in the Square” Model Problem
- On using the cell discretization algorithm for mixed-boundary value problems and domain decomposition
- scientific article; zbMATH DE number 4106255
- A refined algorithm for the reduced-cell determination
- \(N\)-dimensional error control multiresolution algorithms for the cell average discretization
- On the relation of the cell discretization algorithm to the primal hybrid finite element method
- Cell Discretization of Nonselfadjoint Linear Elliptic Partial Differential Equations
- On the Convergence Rate of the Cell Discretization Algorithm for Solving Elliptic Problems
Cited in
(6)- On approximating the solution of the non-stationary Stokes equations using the cell discretization algorithm
- Construction of explicit extension operators on general finite element grids
- Cell Discretization of Nonselfadjoint Linear Elliptic Partial Differential Equations
- On the relation of the cell discretization algorithm to the primal hybrid finite element method
- Solution of Elliptic Systems of Partial Differential Equations by Cell Discretization
- An abridged history of cell discretization
This page was built for publication: The cell discretization algorithm; An overview
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4952285)