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.
Eliminating F-points gives the exact coarse time operator
Statement
Use The all-at-once bidiagonal time operator and C/F points with , , and its F/C partition. Both and are invertible. Eliminating the F unknowns from gives the coarse system with Schur complement On coarse interval , its recurrence is where with an empty product defined to be the identity. If for every fine step, the exact coarse propagator is .
Facts & Assumptions
Given: The finite fine recurrence, its all-at-once block matrix, and the C/F partition.
The all-at-once bidiagonal time operator and C/F points: the fine equations are with identity diagonal blocks, and .
Proof
For any right-hand side, solve the fine equations in increasing index: the first unknown is determined by its identity diagonal block, and each later unknown is uniquely . This proves is invertible. Holding all C-values fixed, the F-equations in each interval between consecutive C-points have the same forward-substitution form with identity diagonal blocks, so they uniquely determine the F-values; hence is invertible.
In the reordered block system, the F rows give . Substituting this expression in the C rows gives . Conversely, any solution of this coarse system, together with the displayed formula for , satisfies both the F and C rows. Thus elimination preserves exactly the solution set.
Repeated substitution in , for , gives . For the product is empty and equals . This is exactly the coarse recurrence in the Statement; the coefficient product reduces to when every .
Depends on
Used by
Dependency tree · two levels
2 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
- R. D. Falgout, S. Friedhoff, Tz. V. Kolev, S. P. MacLachlan, and J. B. Schroder, Parallel Time Integration with Multigrid (standard reference, not scraped)
- Martin J. Gander, Time Parallel Time Integration, Chapter 4: Space-Time Multigrid Methods (standard reference, not scraped)