Alphabeta Math
AlgorithmAlgorithm: Literature-sourcedProof: 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.

General-RHS Hermitian Toeplitz solve by reflection recursion and Gohberg–Semencul

Definition

Input: An integer n≥1, a Hermitian Toeplitz lag list (t−(n−1),…,tn−1) satisfying t−r=tr‾, and a right-hand side b∈Cn. 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 b.

Output: Either a vector x∈Cn or one of the statuses invalid-input, nonpositive-pivot(k), or zero-gohberg-semencul-denominator.

  1. Reject invalid-input if the lag list or right-hand side has the wrong length, or if the Hermitian lag equalities fail. Set Tij=ti−j.
  2. If t0≤0, return nonpositive-pivot(0). Initialize ϕ0 empty and ν0=t0. For k=0,…,n−2, form gk=(t1,…,tk)T, ck=Jkgk‾, and αk+1=(tk+1−ck∗ϕk)/νk,ϕk+1=(ϕk−Jkϕk‾ αk+1, αk+1)T,νk+1=νk(1−∣αk+1∣2). If a required νk is not positive, return nonpositive-pivot(k) before dividing; if a newly computed νk+1≤0, return nonpositive-pivot(k+1).
  3. With ϕ=ϕn−1 and ν=νn−1, form v=(−Jn−1ϕ‾/ν, 1/ν)T,u=Jnv‾. If u0=0, return zero-gohberg-semencul-denominator.
  4. Do not form dense triangular matrices. For any a,y∈Cn, compute (L(a)y)i=∑j=0iai−jyj,(L(a)∗y)i=∑j=in−1aj−i‾yj. Return x=(L(u)L(u)∗b−L(Znv)L(Znv)∗b)/u0, 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 u0=1/νn−1>0. The formula is the complex Hermitian extension; it makes no finite-precision stability claim.

Depends on

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