An all-time Aluthge bound uniform in two joining entries

Using retained finite and whole-chart center premises, we give a candidate Frobenius error bound for ordinary Aluthge iteration (weight 1/2) on Jordan blocks of sizes (1,1,2) when two joining entries vary independently in [255/32768,257/32768]. In a specified moving triangular gauge, the scaled discrete orbit stays within 1/4 of its own entrance-normalized bidiagonal reference at every integer time m >= 128. A positive-definite lift preserves the initial order comparison without accumulating error in time; a Cholesky estimate converts it to the required gauge bound. Logarithmic non-expansion controls the input-dependent references. Reusing the center receipts with a sharper tail composition gives a total allowance 526607/2125000 < 1/4. A rational checker verifies the numerical composition conditional on the written analytic arguments and inherited enclosure contracts. The claim remains a provisional candidate. The result is restricted to this closed independent input rectangle, these block sizes and the stated gauge.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-04
DOI
https://doi.org/10.5281/zenodo.23963839
Primary Topic
Matrix Theory and Algorithms
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

An all-time Aluthge bound uniform in two joining entries

Robert Barritz
Zenodo (CERN European Organization for Nuclear Research)
Matrix Theory and Algorithms
preprint

An all-time Aluthge bound uniform in two joining entries

Robert Barritz
preprint en

Abstract

Using retained finite and whole-chart center premises, we give a candidate Frobenius error bound for ordinary Aluthge iteration (weight 1/2) on Jordan blocks of sizes (1,1,2) when two joining entries vary independently in [255/32768,257/32768]. In a specified moving triangular gauge, the scaled discrete orbit stays within 1/4 of its own entrance-normalized bidiagonal reference at every integer time m >= 128. A positive-definite lift preserves the initial order comparison without accumulating error in time; a Cholesky estimate converts it to the required gauge bound. Logarithmic non-expansion controls the input-dependent references. Reusing the center receipts with a sharper tail composition gives a total allowance 526607/2125000 < 1/4. A rational checker verifies the numerical composition conditional on the written analytic arguments and inherited enclosure contracts. The claim remains a provisional candidate. The result is restricted to this closed independent input rectangle, these block sizes and the stated gauge.

Zenodo (CERN European Organization for Nuclear Research)
Matrix Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon