2203.02404
A posteriori validation of generalized polynomial chaos expansions
Maxime Breden
correctmedium confidence
- Category
- Not specified
- Journal tier
- Specialist/Solid
- Processed
- Sep 28, 2025, 12:56 AM
- arXiv Links
- Abstract ↗PDF ↗
Audit review
The paper’s theorem, functional setup, and a posteriori bounds are internally consistent and explicitly documented (including F, the phase condition G, the approximate inverse A, and the computed bounds Y, Z1, Z2 leading to rmin and rmax). The candidate solution reproduces the high‑level framework but makes critical technical misstatements about the tail inverse (ignoring the need to invert the Ω-convolution via an approximate inverse Υ and claiming an unjustified tail norm bound ≤ 1), and reports inconsistent Y, Z1, Z2 compared with the paper while reusing exactly the paper’s radii. Hence, the paper’s argument stands, whereas the model’s solution is flawed in key places.
Referee report (LaTeX)
\textbf{Recommendation:} no revision \textbf{Journal Tier:} specialist/solid \textbf{Justification:} The manuscript develops a clear, efficient a posteriori validation framework for gPC-encoded invariant objects and demonstrates it on Lorenz periodic orbits and Swift–Hohenberg steady states. The analytical setup (weighted ℓ1 algebras with generalized convolution), the Newton–Kantorovich machinery, and the operator design (including the careful treatment of the tail via a gPC inverse Υ) are well executed and documented. The computational constants and resulting radii are explicit and reproducible. I do not see points requiring revision beyond minor editorial polishing.