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.

Centered leapfrog wave recurrence with Dirichlet and periodic rows

Definition

Use the uniform-grid indices, physical nodes, and spacings of Uniform periodic, infinite, and Dirichlet grid conventions. Fix a wave speed c>0, an interval length L=Nh with N≥2, and a time step k>0. Write ν=ck/h. The target model is the real scalar wave equation utt=c2uxx, and grid states are real-valued. Prescribe a real initial displacement row U0 and discrete initial-velocity row V0, and set U1=U0+kV0. For smooth Dirichlet data u0,u1:[0,L]→R with u0(0)=u0(L)=u1(0)=u1(L)=0, the corresponding sample rows are Uj0=u0(xj) and Vj0=u1(xj); for smooth periodic data, take real L-periodic u0,u1 and sample them at xj. In both cases the discrete initial velocity equals the sampled u1. The centered leapfrog recurrence is Ujn+1−2Ujn+Ujn−1=ν2(Uj+1n−2Ujn+Uj−1n),n≥1. For the finite Dirichlet interval, require U00=UN0=V00=VN0=0 and impose the recurrence for j=1,…,N−1, with U0n=UNn=0 for every n≥0. For the periodic branch, use j=0,…,N−1, reduce indices modulo N, and impose the recurrence at every node. Fourier analysis of this real periodic update uses its complex-linear extension to the complexified grid space. No convergence order for a particular initialization formula is asserted here.

Depends on

Used by

Dependency tree · two levels

5 results within two dependency steps 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