How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Finite-volume cell-face meshes and geometric regularity
Definition
Let and let be a nonempty bounded connected open polyhedral set, meaning the interior of a finite union of bounded closed convex polytopes. A closed convex polytope is a bounded intersection of finitely many closed half-spaces with nonempty interior. A cell-face mesh consists of finitely many nonempty cells , where each is a closed convex polytope, with pairwise disjoint interiors and , together with the relative interiors of the -dimensional faces of their closures. Each interior face is incident to exactly two cells and is denoted ; each boundary face is incident to one cell and is contained in . In dimension one a face is an endpoint and has measure .
Write for the -dimensional volume of , for the -dimensional measure of , for the unit normal outward from , for a chosen point in , and for the centroid of . For every incident pair set . The cell adjacency graph has one vertex for each cell and an edge for each interior face. A mesh is boundary anchored if every cell has a finite path in this graph to a cell incident to a boundary face; such a path can be chosen simple, with no repeated cells.
For a family , put . The family is uniformly regular if there are fixed constants and such that, for every mesh and each of its cells and faces, and each cell has at most faces. A family is refining if . These bounds are invoked only where explicitly assumed; a cell-face mesh alone is not asserted to be uniformly regular or orthogonal.
The finite-volume convention is that a face flux is signed outward from . If is an interior face, local conservation requires the single shared-flux identity . The mesh drawing below labels the center-to-center vector and the outward normal; no orthogonality is part of this general mesh definition.
The cell-face mesh definition and the diagram fix only the objects, incidences, normals, and orientation. A two-point flux approximation adds a separate orthogonality condition; the hybrid mimetic method is formulated on the general cell-face geometry specified here.
Used by
- A nonorthogonal two-point flux gives a false transverse flux Counterexample
- Finite-volume families with a regular simplicial companion Definition
- Hybrid mimetic finite-volume diffusion on general meshes Definition
- No-flux finite-volume and conforming realizations for phase fields Definition
- No-flux TPFA diffusion generator Definition
- One-dimensional orthogonal finite-volume viscous scheme Definition
- Orthogonal TPFA diffusion with harmonic face transmissibility Definition
- Affine anisotropic flux on a skew parallelogram Example
- Harmonic TPFA flux on a rectangular Voronoï mesh Example
- Harmonic transmissibility across a one-dimensional material interface Example
- Coercivity, monotonicity, conservation, and affine exactness of the mimetic schemes Proposition
- Discrete Poincaré inequality from boundary paths Theorem
- TPFA discrete Green identity, coercivity, and maximum principle Theorem
- TPFA flux-energy convergence for smooth face-aligned interfaces Theorem
Dependency tree · 0 levels
Nothing. This result depends on no other item in the library.
Sources
- R. Eymard, T. Gallouët, and R. Herbin, Finite Volume Methods, Handbook of Numerical Analysis, Vol. VII, 2000; complete updated author text (standard reference, not scraped)
- Jérôme Droniou, Finite volume schemes for diffusion equations: introduction to and review of modern methods, 2014 (standard reference, not scraped)