{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:4JLKUCGVTLFOMJIIJUN2T2EN2K","short_pith_number":"pith:4JLKUCGV","schema_version":"1.0","canonical_sha256":"e256aa08d59acae625084d1ba9e88dd295157d0575795ddb9bfc5821beed4616","source":{"kind":"arxiv","id":"2605.17664","version":1},"attestation_state":"computed","paper":{"title":"A modified Anderson acceleration with sharp linear convergence rate predictions and application to incompressible flows","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Modified Anderson acceleration using nonlinear residuals gives sharp linear convergence predictions for Navier-Stokes Picard iterations.","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Leo Rebholz, Yunhui He","submitted_at":"2026-05-17T21:49:19Z","abstract_excerpt":"In this work, we extend a modified Anderson acceleration proposed in [Y. He, arXiv:2603.25983, 2026] to accelerate the Picard iteration for the Navier-Stokes equations. In this variant of Anderson acceleration, named AAg, the nonlinear residual--rather than the standard fixed-point iteration residual--is used to define the associated least-squares problem. We establish a convergence analysis for this method with any depth that shows how AAg accelerates convergence through the gain of the optimization problem, and obtain a sharp prediction of its linear convergence rate (a feature that is not p"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.17664","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2026-05-17T21:49:19Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"7dffdd3152a98e5faee26ecc7fb3b1485eb76480f44a982fc0966481e074b250","abstract_canon_sha256":"53e5ff034f433036672d6ef546db80b4adfb35b7dbdb398d65dec40503f93919"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:04:51.592893Z","signature_b64":"9bneZlmMRg7tfreEIre0x+1UEocLRnY5jAxy1yHliJrre6OInjE4Yg2T2Bp2WEnqMPPQUX2SoqeJnGG7QcQZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e256aa08d59acae625084d1ba9e88dd295157d0575795ddb9bfc5821beed4616","last_reissued_at":"2026-05-20T00:04:51.591997Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:04:51.591997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A modified Anderson acceleration with sharp linear convergence rate predictions and application to incompressible flows","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Modified Anderson acceleration using nonlinear residuals gives sharp linear convergence predictions for Navier-Stokes Picard iterations.","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Leo Rebholz, Yunhui He","submitted_at":"2026-05-17T21:49:19Z","abstract_excerpt":"In this work, we extend a modified Anderson acceleration proposed in [Y. He, arXiv:2603.25983, 2026] to accelerate the Picard iteration for the Navier-Stokes equations. In this variant of Anderson acceleration, named AAg, the nonlinear residual--rather than the standard fixed-point iteration residual--is used to define the associated least-squares problem. We establish a convergence analysis for this method with any depth that shows how AAg accelerates convergence through the gain of the optimization problem, and obtain a sharp prediction of its linear convergence rate (a feature that is not p"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We establish a convergence analysis for this method with any depth that shows how AAg accelerates convergence through the gain of the optimization problem, and obtain a sharp prediction of its linear convergence rate (a feature that is not part of the known theory for classical Anderson acceleration).","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The convergence analysis assumes that the nonlinear residual is used to define the least-squares problem in AAg and that the gain of this optimization problem directly controls the contraction factor; this premise is inherited from the prior work on AAg and is not re-derived from first principles for the Navier-Stokes setting.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The paper introduces AAg, a nonlinear-residual variant of Anderson acceleration, proves sharp linear convergence rates for arbitrary depth on Picard iterations for Navier-Stokes, and proposes an adaptive depth strategy validated by numerical tests.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Modified Anderson acceleration using nonlinear residuals gives sharp linear convergence predictions for Navier-Stokes Picard iterations.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"90f27bdfa920981467511614a1f165554de20fc89d278e9853910f7b6f8a8b76"},"source":{"id":"2605.17664","kind":"arxiv","version":1},"verdict":{"id":"00ef584e-95c2-4481-b875-e42f2cd427f0","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T22:19:47.101946Z","strongest_claim":"We establish a convergence analysis for this method with any depth that shows how AAg accelerates convergence through the gain of the optimization problem, and obtain a sharp prediction of its linear convergence rate (a feature that is not part of the known theory for classical Anderson acceleration).","one_line_summary":"The paper introduces AAg, a nonlinear-residual variant of Anderson acceleration, proves sharp linear convergence rates for arbitrary depth on Picard iterations for Navier-Stokes, and proposes an adaptive depth strategy validated by numerical tests.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The convergence analysis assumes that the nonlinear residual is used to define the least-squares problem in AAg and that the gain of this optimization problem directly controls the contraction factor; this premise is inherited from the prior work on AAg and is not re-derived from first principles for the Navier-Stokes setting.","pith_extraction_headline":"Modified Anderson acceleration using nonlinear residuals gives sharp linear convergence predictions for Navier-Stokes Picard iterations."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.17664/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T22:31:19.467874Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T22:31:02.121541Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"cited_work_retraction","ran_at":"2026-05-19T22:21:57.393925Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"citation_quote_validity","ran_at":"2026-05-19T21:49:44.267700Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.538897Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T21:21:57.455070Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"d606123ea36f483ff5c86dc9ee792f980e42d56f53e24b302e9392f7592beba9"},"references":{"count":61,"sample":[{"doi":"","year":2017,"title":"H. An, X. Jia, and H. Walker. Anderson acceleration and application to the three-temperature energy equations. Journal of Computational Physics , 347:1–19, 2017","work_id":"21f7146b-afa4-435d-b7d2-8077e2a6c929","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1965,"title":"D. G. Anderson. Iterative procedures for nonlinear integral equations. J. Assoc. Comput. Mach. , 12(4):547–560, 1965","work_id":"fe9c5d8c-6255-4e72-aeaa-b4d997bb0092","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2016,"title":"A. Z. Atanasov, B. Uekermann, C. Pachajoa, H. Bungartz, and P. Neumann. Steady-state Anderson accelerated coupling of Lattice Boltzmann and Navier-Stokes solvers. Comput., 4:38, 2016","work_id":"36b5c932-cacb-4096-be5a-8eec7b59d061","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"N. A. Barnafi and M. L. Pasini. Two-level sketching alternating Anderson acceleration for complex physics applications. arXiv preprint arXiv:2505.08587 , 2025","work_id":"8faeb8a8-c370-475c-8415-9281e9240589","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2095,"title":"M. Benzi and M. Olshanskii. An augmented Lagrangian-based approach to the Oseen problem. SIAM J. Sci. Comput. , 28:2095–2113, 2006","work_id":"26501470-5204-4a61-a052-8495a0ab879f","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":61,"snapshot_sha256":"185a66535059ed3b1f08691052dcbe38180efe8fc02b24a75b0c193f1f2672cf","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.17664","created_at":"2026-05-20T00:04:51.592155+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.17664v1","created_at":"2026-05-20T00:04:51.592155+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17664","created_at":"2026-05-20T00:04:51.592155+00:00"},{"alias_kind":"pith_short_12","alias_value":"4JLKUCGVTLFO","created_at":"2026-05-20T00:04:51.592155+00:00"},{"alias_kind":"pith_short_16","alias_value":"4JLKUCGVTLFOMJII","created_at":"2026-05-20T00:04:51.592155+00:00"},{"alias_kind":"pith_short_8","alias_value":"4JLKUCGV","created_at":"2026-05-20T00:04:51.592155+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4JLKUCGVTLFOMJIIJUN2T2EN2K","json":"https://pith.science/pith/4JLKUCGVTLFOMJIIJUN2T2EN2K.json","graph_json":"https://pith.science/api/pith-number/4JLKUCGVTLFOMJIIJUN2T2EN2K/graph.json","events_json":"https://pith.science/api/pith-number/4JLKUCGVTLFOMJIIJUN2T2EN2K/events.json","paper":"https://pith.science/paper/4JLKUCGV"},"agent_actions":{"view_html":"https://pith.science/pith/4JLKUCGVTLFOMJIIJUN2T2EN2K","download_json":"https://pith.science/pith/4JLKUCGVTLFOMJIIJUN2T2EN2K.json","view_paper":"https://pith.science/paper/4JLKUCGV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.17664&json=true","fetch_graph":"https://pith.science/api/pith-number/4JLKUCGVTLFOMJIIJUN2T2EN2K/graph.json","fetch_events":"https://pith.science/api/pith-number/4JLKUCGVTLFOMJIIJUN2T2EN2K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4JLKUCGVTLFOMJIIJUN2T2EN2K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4JLKUCGVTLFOMJIIJUN2T2EN2K/action/storage_attestation","attest_author":"https://pith.science/pith/4JLKUCGVTLFOMJIIJUN2T2EN2K/action/author_attestation","sign_citation":"https://pith.science/pith/4JLKUCGVTLFOMJIIJUN2T2EN2K/action/citation_signature","submit_replication":"https://pith.science/pith/4JLKUCGVTLFOMJIIJUN2T2EN2K/action/replication_record"}},"created_at":"2026-05-20T00:04:51.592155+00:00","updated_at":"2026-05-20T00:04:51.592155+00:00"}