{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VJS7AOMWTLAUFQN6YMCMOODBWZ","short_pith_number":"pith:VJS7AOMW","schema_version":"1.0","canonical_sha256":"aa65f039969ac142c1bec304c73861b65eed669a2c3f405d80aa8ae976445291","source":{"kind":"arxiv","id":"1804.10629","version":1},"attestation_state":"computed","paper":{"title":"Numerical Stability of s-step Enlarged Krylov Subspace Conjugate Gradient Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Sophie Moufawad","submitted_at":"2018-04-27T18:00:33Z","abstract_excerpt":"Recently, enlarged Krylov subspace methods, that consists of enlarging the Krylov subspace by a maximum of t vectors per iteration based on the domain decomposition of the graph of A, were introduced in the aim of reducing communication when solving systems of linear equations Ax=b. In this paper, the s-step enlarged Krylov subspace Conjugate Gradient methods are introduced, whereby s iterations of the enlarged Conjugate Gradient methods are merged in one iteration. The numerical stability of these s-step methods is studied, and several numerically stable versions are proposed. Similarly to th"},"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":"1804.10629","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-04-27T18:00:33Z","cross_cats_sorted":[],"title_canon_sha256":"6e84359ad98088314f55942f4185665345f586e7bb6655cf89912af574015ce3","abstract_canon_sha256":"30185755bd3330eee661fe157462b77d9fcd871b4e1d292887983c97fbbc61bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:16.052898Z","signature_b64":"zkaybRPjCY1UMlG+SDYH8YkZiaOboO6yJRX3g+4ic0By5u3qoiDBHtQLpKBJZ76LOBUG1XZRte3E4CdyoU/DCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa65f039969ac142c1bec304c73861b65eed669a2c3f405d80aa8ae976445291","last_reissued_at":"2026-05-18T00:17:16.052256Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:16.052256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Numerical Stability of s-step Enlarged Krylov Subspace Conjugate Gradient Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Sophie Moufawad","submitted_at":"2018-04-27T18:00:33Z","abstract_excerpt":"Recently, enlarged Krylov subspace methods, that consists of enlarging the Krylov subspace by a maximum of t vectors per iteration based on the domain decomposition of the graph of A, were introduced in the aim of reducing communication when solving systems of linear equations Ax=b. In this paper, the s-step enlarged Krylov subspace Conjugate Gradient methods are introduced, whereby s iterations of the enlarged Conjugate Gradient methods are merged in one iteration. The numerical stability of these s-step methods is studied, and several numerically stable versions are proposed. Similarly to th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10629","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1804.10629","created_at":"2026-05-18T00:17:16.052350+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.10629v1","created_at":"2026-05-18T00:17:16.052350+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10629","created_at":"2026-05-18T00:17:16.052350+00:00"},{"alias_kind":"pith_short_12","alias_value":"VJS7AOMWTLAU","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VJS7AOMWTLAUFQN6","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VJS7AOMW","created_at":"2026-05-18T12:32:59.047623+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/VJS7AOMWTLAUFQN6YMCMOODBWZ","json":"https://pith.science/pith/VJS7AOMWTLAUFQN6YMCMOODBWZ.json","graph_json":"https://pith.science/api/pith-number/VJS7AOMWTLAUFQN6YMCMOODBWZ/graph.json","events_json":"https://pith.science/api/pith-number/VJS7AOMWTLAUFQN6YMCMOODBWZ/events.json","paper":"https://pith.science/paper/VJS7AOMW"},"agent_actions":{"view_html":"https://pith.science/pith/VJS7AOMWTLAUFQN6YMCMOODBWZ","download_json":"https://pith.science/pith/VJS7AOMWTLAUFQN6YMCMOODBWZ.json","view_paper":"https://pith.science/paper/VJS7AOMW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.10629&json=true","fetch_graph":"https://pith.science/api/pith-number/VJS7AOMWTLAUFQN6YMCMOODBWZ/graph.json","fetch_events":"https://pith.science/api/pith-number/VJS7AOMWTLAUFQN6YMCMOODBWZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VJS7AOMWTLAUFQN6YMCMOODBWZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VJS7AOMWTLAUFQN6YMCMOODBWZ/action/storage_attestation","attest_author":"https://pith.science/pith/VJS7AOMWTLAUFQN6YMCMOODBWZ/action/author_attestation","sign_citation":"https://pith.science/pith/VJS7AOMWTLAUFQN6YMCMOODBWZ/action/citation_signature","submit_replication":"https://pith.science/pith/VJS7AOMWTLAUFQN6YMCMOODBWZ/action/replication_record"}},"created_at":"2026-05-18T00:17:16.052350+00:00","updated_at":"2026-05-18T00:17:16.052350+00:00"}