Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generated
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.

Hybrid mimetic finite-volume diffusion on general meshes

Definition

Let T be a cell-face mesh as in Finite-volume cell-face meshes and geometric regularity, with xK the volume centroid of each cell and xF the face centroid. For the mimetic branch require the following explicit face-moment closure on each cell: ∑F⊂∂K∣F∣nK,F=0,∑F⊂∂K∣F∣xF⊗nK,F=∣K∣Id. Here Id is the identity matrix on Rd and (x⊗n)ij=xinj. These are finite geometric checks on the face data; they impose no center-to-face orthogonality. For every cell use one real cell-mean unknown uK; for every face use one shared real face-mean unknown uF. On a boundary face F⊂∂Ω, the value uF=gF is prescribed. Write nK,F for the outward unit normal. Define the reconstructed cell gradient and its face residual by GKu=1∣K∣∑F⊂∂K∣F∣uFnK,F,ρK,F(u)=uF−uK−GKu⋅(xF−xK). Interpret uK and uF as cell and face averages. For a symmetric positive-definite tensor AK constant on K (so z⋅AKz>0 for every nonzero z), define AK(u,v)=∣K∣(AKGKu)⋅GKv+λmin⁡(AK)∑F⊂∂K∣F∣dK,FρK,F(u)ρK,F(v), where λmin⁡(AK)>0 is the smallest eigenvalue of AK. For f∈L1(Ω), the linear hybrid mimetic scheme with homogeneous Dirichlet data is to find all cell and interior-face values u such that ∑K∈KAK(u,v)=∑K∈KvK∫Kf(x) dx for every test vector v whose boundary face values are zero. For each local face F⊂∂K, let ϕK,F have face value 1 on F, zero on the other faces of K, and cell value zero. Define the outward numerical flux QK,F(u)=−AK(u,ϕK,F).

There is also a monotone p-growth backward-Euler extension, specified as an algebraic scheme but with no existence or convergence claim in this definition. Let 1<p<∞, set p′=p/(p−1), and let a(x,ξ) be a Carathéodory flux, meaning that x↦a(x,ξ) is measurable for each fixed ξ and ξ↦a(x,ξ) is continuous for almost every x. Assume there are constants C,α>0, a nonnegative g∈Lp′(Ω), and a nonnegative h∈L1(Ω) such that, outside one null set, ∣a(x,ξ)∣≤C(g(x)+∣ξ∣p−1),a(x,ξ)⋅ξ≥α∣ξ∣p−h(x),(a(x,ξ)−a(x,η))⋅(ξ−η)≥0. For each cell set bK(ξ)=∣K∣−1∫Ka(x,ξ) dx, and fix α0,K>0. Put ψp(s)=∣s∣p−2s for s≠0 and ψp(0)=0. Its spatial operator, linear in the test vector v, is Ah,K(u;v)=∣K∣bK(GKu)⋅GKv+α0,K∑F⊂∂K∣F∣dK,Fp−1ψp(ρK,F(u))ρK,F(v). For this extension define QK,Fnl(u)=−Ah,K(u;ϕK,F). On a time partition 0=t0<⋯<tN=T, given un−1 and f∈Lp′((0,T)×Ω), put fKn=((tn−tn−1)∣K∣)−1∫tn−1tn∫Kf. The backward-Euler step seeks un with zero boundary face values satisfying ∑K∈K∣K∣uKn−uKn−1tn−tn−1vK+∑K∈KAh,K(un;v)=∑K∈K∣K∣fKnvK for every test vector with zero boundary face values. The formula specifies a candidate discrete method; solvability and convergence require separate results.

For an affine function ℓ(x)=b⋅x+c, its cell and face averages satisfy GKℓ=b and ρK,F(ℓ)=0 by the displayed face-moment closure. The drawing illustrates the cell and face degrees of freedom on a skew cell; no center-to-face orthogonality is assumed.

uKuF1uF2uF3uF4GKu

When p=2, bK(ξ)=AKξ, and α0,K=λmin⁡(AK), the nonlinear formula agrees with the linear form above. Neither specification by itself proves solvability, a conforming W01,p reconstruction, or a mesh-uniform discrete Aubin–Lions estimate; those require separate results or hypotheses.

Depends on

Used by

Dependency tree · one level

1 result 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