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.
General-RHS Hermitian Toeplitz solve by reflection recursion and Gohberg–Semencul
Definition
Input: An integer , a Hermitian Toeplitz lag list satisfying , and a right-hand side . All arithmetic in this definition is exact. The real covariance forecast procedure remains Durbin–Levinson forecast recursion; this procedure solves a general Hermitian matrix equation with arbitrary .
Output: Either a vector or one of the statuses invalid-input, nonpositive-pivot(k), or zero-gohberg-semencul-denominator.
- Reject invalid-input if the lag list or right-hand side has the wrong length, or if the Hermitian lag equalities fail. Set .
- If , return nonpositive-pivot(0). Initialize empty and . For , form , , and If a required is not positive, return nonpositive-pivot(k) before dividing; if a newly computed , return nonpositive-pivot(k+1).
- With and , form If , return zero-gohberg-semencul-denominator.
- Do not form dense triangular matrices. For any , compute Return evaluating the four triangular products successively with vector workspace.
For a Hermitian positive-definite input, Complex Hermitian Toeplitz bordering yields reflection coefficients and positive pivots gives positive reflection pivots, so . The formula is the complex Hermitian extension; it makes no finite-precision stability claim.
Depends on
- Durbin–Levinson forecast recursion
- Lower-shift displacement rank and generator pairs
- Rectangular matrix multiplication and the identity matrix $I_n$, including zero-sized shapes
- Toeplitz, circulant, and finite-index conventions for structured solvers
- Complex Hermitian Toeplitz bordering yields reflection coefficients and positive pivots
Used by
Dependency tree · two levels
12 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
- George Labahn and Tamir Shalom, Inversion of Toeplitz Matrices with Only Two Standard Equations, Theorem 1.1 (standard reference, not scraped)
- Ralf Hiptmair, Numerical Methods for Computational Science and Engineering, Lecture Document, §4.5.3 (standard reference, not scraped)