Certified Amplitude Entropy After Nonlinear Fractal Reconstruction

An entropy computed from an interpolated record depends on both reconstruction accuracy and the amplitude quantizer. We bound the difference between the entropies of the computed reconstruction and the reference interpolant under a common sampling rule and quantizer. For nonlinear fractal interpolation operators, including those whose optimal Lipschitz constant equals one, ordinate perturbations and inexact iteration yield an explicit uniform reconstruction budget. Hard-bin Shannon entropy has no uniform continuity modulus in ∥f−g∥∞ alone; a computable conditional bound uses the weight of samples near bin boundaries. Piecewise-linear soft assignments instead give a distributional error controlled by E/h, where E bounds the amplitude error and h is the grid spacing. When E≤h, an adjacent-label coupling yields a sharp Shannon bound involving at most three labels, independently of the total alphabet size when it is at least three. Its small-error order is (E/h)log(h/E). Sharpness concerns quantization alone. The nonlinear data response can dominate the reconstruction budget even before quantization. We also give uniform and data-dependent bounds for Rényi orders greater than one. Combining these estimates gives stopping criteria and sufficient conditions for reliable entropy comparisons. A reproducible example distinguishes observed differences from the guarantees supplied by the reconstruction budget and quantizer resolution.

Authors

Institutions

Publication Details

Journal
Entropy
Published
2026-11-16
DOI
https://doi.org/10.3390/e28111266
Primary Topic
Mathematical Dynamics and Fractals
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Certified Amplitude Entropy After Nonlinear Fractal Reconstruction

Najmeddine Attia, Taoufik Moulahi
Entropy
Mathematical Dynamics and Fractals
article

Certified Amplitude Entropy After Nonlinear Fractal Reconstruction

Najmeddine Attia, Taoufik Moulahi
article en

Abstract

An entropy computed from an interpolated record depends on both reconstruction accuracy and the amplitude quantizer. We bound the difference between the entropies of the computed reconstruction and the reference interpolant under a common sampling rule and quantizer. For nonlinear fractal interpolation operators, including those whose optimal Lipschitz constant equals one, ordinate perturbations and inexact iteration yield an explicit uniform reconstruction budget. Hard-bin Shannon entropy has no uniform continuity modulus in ∥f−g∥∞ alone; a computable conditional bound uses the weight of samples near bin boundaries. Piecewise-linear soft assignments instead give a distributional error controlled by E/h, where E bounds the amplitude error and h is the grid spacing. When E≤h, an adjacent-label coupling yields a sharp Shannon bound involving at most three labels, independently of the total alphabet size when it is at least three. Its small-error order is (E/h)log(h/E). Sharpness concerns quantization alone. The nonlinear data response can dominate the reconstruction budget even before quantization. We also give uniform and data-dependent bounds for Rényi orders greater than one. Combining these estimates gives stopping criteria and sufficient conditions for reliable entropy comparisons. A reproducible example distinguishes observed differences from the guarantees supplied by the reconstruction budget and quantizer resolution.

EntropyVol. 28(11)
Prince Sattam Bin Abdulaziz University (SA), King Faisal University (SA)
Mathematical Dynamics and Fractals
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