{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SSJ5X5WCFNFOITFUDLEBMGFQ4B","short_pith_number":"pith:SSJ5X5WC","schema_version":"1.0","canonical_sha256":"9493dbf6c22b4ae44cb41ac81618b0e075814186d85578e316bed1ed032a0115","source":{"kind":"arxiv","id":"2407.10472","version":2},"attestation_state":"computed","paper":{"title":"Convergence Analysis of the Alternating Anderson-Picard Method for Nonlinear Fixed-point Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"M. Paul Laiu, Thomas Strohmer, Xue Feng","submitted_at":"2024-07-15T06:57:46Z","abstract_excerpt":"Anderson Acceleration (AA) has been widely used to solve nonlinear fixed-point problems due to its rapid convergence. This work focuses on a variant of AA in which multiple Picard iterations are performed between each AA step, referred to as the Alternating Anderson-Picard (AAP) method. Despite introducing more ``slow'' Picard iterations, this method has been shown to be efficient and even more robust in both linear and nonlinear cases. However, there is a lack of theoretical analysis for AAP in the nonlinear case. In this paper, we address this gap by establishing the equivalence between AAP "},"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":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2407.10472","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2024-07-15T06:57:46Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"9152f53167026a606ab543511d0b292758db390515e43575c20969af058fdb58","abstract_canon_sha256":"aa045dfc1bbdc3cda51befe256ea21fbf171b86fc99320261d771d52a7b55d8d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:35:50.383218Z","signature_b64":"SMrBLSWGcG3vmQry9dxiPF3KGuB69fDsQyvQGedAguRn/nTPOriWOkYrkqLAyjjt8WP3vqSaC7RgZXUq8LOBAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9493dbf6c22b4ae44cb41ac81618b0e075814186d85578e316bed1ed032a0115","last_reissued_at":"2026-07-05T11:35:50.382800Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:35:50.382800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convergence Analysis of the Alternating Anderson-Picard Method for Nonlinear Fixed-point Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"M. Paul Laiu, Thomas Strohmer, Xue Feng","submitted_at":"2024-07-15T06:57:46Z","abstract_excerpt":"Anderson Acceleration (AA) has been widely used to solve nonlinear fixed-point problems due to its rapid convergence. This work focuses on a variant of AA in which multiple Picard iterations are performed between each AA step, referred to as the Alternating Anderson-Picard (AAP) method. Despite introducing more ``slow'' Picard iterations, this method has been shown to be efficient and even more robust in both linear and nonlinear cases. However, there is a lack of theoretical analysis for AAP in the nonlinear case. In this paper, we address this gap by establishing the equivalence between AAP "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.10472","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2407.10472/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","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":"2407.10472","created_at":"2026-07-05T11:35:50.382854+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.10472v2","created_at":"2026-07-05T11:35:50.382854+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.10472","created_at":"2026-07-05T11:35:50.382854+00:00"},{"alias_kind":"pith_short_12","alias_value":"SSJ5X5WCFNFO","created_at":"2026-07-05T11:35:50.382854+00:00"},{"alias_kind":"pith_short_16","alias_value":"SSJ5X5WCFNFOITFU","created_at":"2026-07-05T11:35:50.382854+00:00"},{"alias_kind":"pith_short_8","alias_value":"SSJ5X5WC","created_at":"2026-07-05T11:35:50.382854+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.20884","citing_title":"A gradient-based and determinant-free framework for fully Bayesian Gaussian process regression","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SSJ5X5WCFNFOITFUDLEBMGFQ4B","json":"https://pith.science/pith/SSJ5X5WCFNFOITFUDLEBMGFQ4B.json","graph_json":"https://pith.science/api/pith-number/SSJ5X5WCFNFOITFUDLEBMGFQ4B/graph.json","events_json":"https://pith.science/api/pith-number/SSJ5X5WCFNFOITFUDLEBMGFQ4B/events.json","paper":"https://pith.science/paper/SSJ5X5WC"},"agent_actions":{"view_html":"https://pith.science/pith/SSJ5X5WCFNFOITFUDLEBMGFQ4B","download_json":"https://pith.science/pith/SSJ5X5WCFNFOITFUDLEBMGFQ4B.json","view_paper":"https://pith.science/paper/SSJ5X5WC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.10472&json=true","fetch_graph":"https://pith.science/api/pith-number/SSJ5X5WCFNFOITFUDLEBMGFQ4B/graph.json","fetch_events":"https://pith.science/api/pith-number/SSJ5X5WCFNFOITFUDLEBMGFQ4B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SSJ5X5WCFNFOITFUDLEBMGFQ4B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SSJ5X5WCFNFOITFUDLEBMGFQ4B/action/storage_attestation","attest_author":"https://pith.science/pith/SSJ5X5WCFNFOITFUDLEBMGFQ4B/action/author_attestation","sign_citation":"https://pith.science/pith/SSJ5X5WCFNFOITFUDLEBMGFQ4B/action/citation_signature","submit_replication":"https://pith.science/pith/SSJ5X5WCFNFOITFUDLEBMGFQ4B/action/replication_record"}},"created_at":"2026-07-05T11:35:50.382854+00:00","updated_at":"2026-07-05T11:35:50.382854+00:00"}