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.
TPFA flux-energy convergence for smooth face-aligned interfaces
Statement
Let be a bounded connected polyhedral set and let be a refining, uniformly regular, boundary-anchored family of TPFA-admissible meshes. Assume with , constant on each cell, and that coefficient jumps occur only across mesh faces. Suppose is continuous, vanishes on , and is on each cell closure with the uniform family bound For every interior face fix an orientation and define its exact outward flux from by . On a boundary face define by the same formula. Assume the exact fluxes satisfy the cell balances and on every interior face. Let solve the TPFA cell balances with source and zero boundary values, and let be the cell-center sample with zero boundary face values. Then, for a constant depending only on , , and the uniform mesh regularity bounds, The second estimate is convergence of the reconstructed numerical face flux in the transmissibility-dual energy norm. No pointwise operator consistency on arbitrary nonorthogonal meshes or error rate for nonsmooth weak solutions is asserted.
Facts & Assumptions
Given: The exact cell and face geometry, a refining uniformly regular orthogonal mesh family, with mesh-aligned jumps, the piecewise function , the exact face fluxes and their cell balances, and the TPFA scheme.
Finite-volume cell-face meshes and geometric regularity: in a uniformly regular family, cell volumes and face measures scale as and , center-to-face distances scale as , and the number of faces per cell is uniformly bounded.
Orthogonal TPFA diffusion with harmonic face transmissibility: on interior faces, on boundary faces, and .
TPFA discrete Green identity, coercivity, and maximum principle: the TPFA stiffness matrix is symmetric positive definite, and its bilinear form is the face energy in [F2].
Each cell restriction of extends to its closure with Hessian norm at most the family-wide bound . The exact integrated fluxes are opposite on each interior face, and the exact cell flux balances hold as stated.
Proof
For each face fix an incident cell and set . On an interior face , write , let be the center-normal crossing point, and put . Integrated conservation says that is the face mean of both and . On each cell closure the Hessian bound gives , and the same bound holds for . Continuity of and one-sided normal Taylor expansion therefore give and , with . Substitution into the harmonic formula yields , while . Since , . On a boundary face take and . The same face-mean estimate and give , , and the identical defect bound.
By uniform regularity, every transmissibility satisfies . There are at most faces per cell, , and , so and . Step 1.1 therefore gives Thus the vector of local flux defects has transmissibility-dual norm at most .
Let . The exact cell balances in [A1] and the finite-volume balances for imply, for every cell vector , because the two exact interior fluxes are oppositely oriented. Take . Weighted Cauchy–Schwarz gives . If the first estimate is immediate; otherwise divide by and use step 2.1 to obtain . The bilinear identity used here is [F3].
On every face, equals for an interior face and for a boundary face. Its transmissibility-dual norm is therefore exactly . By the triangle inequality, the numerical-flux error norm is at most , using steps 2.1 and 3.1. This proves both estimates.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · one level
3 results within one dependency step of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
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)