{"id":"db25d93a-bec9-4c58-b493-0d7c3b4670f1","arxiv_id":"2505.13980","paper_version":1,"verdict":"CONDITIONAL","confidence":"HIGH","novelty_score":4.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Symbolic methods compute L-infinity norms exactly but slowly, and they outperform numerical methods on ill-conditioned or parameterized systems.","lead":"This paper surveys symbolic computation methods, such as Sturm-Habicht sequences, rational univariate representations, and cylindrical algebraic decomposition, for computing the L-infinity norm of linear systems exactly. It benchmarks these methods against numerical tools to show when symbolic computation provides higher accuracy, especially for parameterized systems.","discovery_kind":"review","skeptic_critique":null,"referee_report":null,"author_rebuttal":null,"desk_editor":null,"rs_alignment":null,"lean_confirmation":null,"pith_extraction":null,"created_at":"2026-08-07T15:42:45.857836+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":null,"supporting_citations":[],"review_version":1}