Metraipolis › archive › dc_34b27d770fd2

Chronological stability for nonstationary matrix refinement — arXiv:2609.13981

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.13981
License (as archived)
CC0-1.0
Archived
2026-10-16T01:22:28.429Z
SHA-256 of the archived text
283a5ed969f1eb7cb6ee2d3732d17929d16763aeadabac55531dd3cc31590a39
Stable URL of this page
https://metraipolis.com/documento/dc_34b27d770fd2

How to cite

Chronological stability for nonstationary matrix refinement — arXiv:2609.13981 — arXiv (en), https://arxiv.org/abs/2609.13981 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_34b27d770fd2 (Metraipolis archive dc_34b27d770fd2, sha256 283a5ed969f1eb7cb6ee2d3732d17929d16763aeadabac55531dd3cc31590a39)
BibTeX
@misc{dc34b27d770fd2,
  title = {Chronological stability for nonstationary matrix refinement — arXiv:2609.13981},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.13981},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_34b27d770fd2; sha256 283a5ed969f1eb7cb6ee2d3732d17929d16763aeadabac55531dd3cc31590a39},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.13981. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

A matrix cascade is an iterative refinement process in which vector-valued data are repeatedly filtered by matrix-valued masks across successively finer scales. Such cascades arise in multichannel subdivision, Hermite refinement, multiresolution synthesis, and exponential-spline constructions, and in nonstationary schemes the masks may vary with scale. We develop a chronological stability framework for this setting, allowing both the transition operators and the associated matching spaces to change from level to level. If the chronological radius satisfies $\rho_{\rm ch}<1$ and the matching defects are summable, then the cascade converges uniformly and, for every $q\in(\rho_{\rm ch},1)$, \[ \|F_n-\Phi\|_\infty \lesssim q^n+\sum_{j=1}^n\delta_j q^{\,n-j} +\sum_{j>n}\delta_j . \] The time-weighted defect term records the level at which each perturbation is inserted, and the matching spaces need not converge; they may even alternate indefinitely. For compact piecewise-linear seeds, every finite ordered matrix cascade admits an exact fixed-width ReLU realization with $O(n)$ depth and parameters, and this linear depth order is worst-case optimal at fixed width. Consequently, exponentially decaying defects yield certified approximants of size $O(\log\varepsilon^{-1})$. We further construct stable two-channel classes in which the chronological radius and the leading metric-entropy coefficient are independent invariants, showing that stability does not determine finite-accuracy description complexity. The framework therefore provides tolerance-controlled finite representations for nonstationary multiresolution and exponential-spline refinement.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-15 in math.NA).
Categorie arXiv: Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2609.13981 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T00:39:06.299Z dalla pagina https://arxiv.org/catchup/math.NA/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).