{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:RR7YIT4UXZDNY72YXTXWVUUNCO","short_pith_number":"pith:RR7YIT4U","schema_version":"1.0","canonical_sha256":"8c7f844f94be46dc7f58bcef6ad28d1382eba89cfea05793e06185eb711f23d6","source":{"kind":"arxiv","id":"2410.07465","version":1},"attestation_state":"computed","paper":{"title":"Preconditioning Low Rank Generalized Minimal Residual Method (GMRES) for Implicit Discretizations of Matrix Differential Equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Daniel Appelo, Shixu Meng, Yingda Cheng","submitted_at":"2024-10-09T22:03:17Z","abstract_excerpt":"This work proposes a new class of preconditioners for the low rank Generalized Minimal Residual Method (GMRES) for multiterm matrix equations arising from implicit timestepping of linear matrix differential equations. We are interested in computing low rank solutions to matrix equations, e.g. arising from spatial discretization of stiff partial differential equations (PDEs). The low rank GMRES method is a particular class of Krylov subspace method where the iteration is performed on the low rank factors of the solution. Such methods can exploit the low rank property of the solution to save on "},"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":"2410.07465","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2024-10-09T22:03:17Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"e4670d559a34c1d7c0f6d5c00138e706d42ad304817b0162f373216f5ec50fda","abstract_canon_sha256":"6e7c9a60a52e5a3e0fd70f65dbd9f43ab0f0eb4ecbe5ae910424917a4e8fcc33"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:18:37.689782Z","signature_b64":"kVLvw+M2muWyCCh6cRQPKoIKrJ0ZTJ4aN4QA5vjlsGPj2ZgK/DLUik9OWktmts99CYezd3g9gBSMkM1wfe6BBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c7f844f94be46dc7f58bcef6ad28d1382eba89cfea05793e06185eb711f23d6","last_reissued_at":"2026-07-05T09:18:37.689270Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:18:37.689270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Preconditioning Low Rank Generalized Minimal Residual Method (GMRES) for Implicit Discretizations of Matrix Differential Equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Daniel Appelo, Shixu Meng, Yingda Cheng","submitted_at":"2024-10-09T22:03:17Z","abstract_excerpt":"This work proposes a new class of preconditioners for the low rank Generalized Minimal Residual Method (GMRES) for multiterm matrix equations arising from implicit timestepping of linear matrix differential equations. We are interested in computing low rank solutions to matrix equations, e.g. arising from spatial discretization of stiff partial differential equations (PDEs). The low rank GMRES method is a particular class of Krylov subspace method where the iteration is performed on the low rank factors of the solution. Such methods can exploit the low rank property of the solution to save on "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.07465","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.07465/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":"2410.07465","created_at":"2026-07-05T09:18:37.689343+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.07465v1","created_at":"2026-07-05T09:18:37.689343+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.07465","created_at":"2026-07-05T09:18:37.689343+00:00"},{"alias_kind":"pith_short_12","alias_value":"RR7YIT4UXZDN","created_at":"2026-07-05T09:18:37.689343+00:00"},{"alias_kind":"pith_short_16","alias_value":"RR7YIT4UXZDNY72Y","created_at":"2026-07-05T09:18:37.689343+00:00"},{"alias_kind":"pith_short_8","alias_value":"RR7YIT4U","created_at":"2026-07-05T09:18:37.689343+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.00805","citing_title":"An Inexact Low-Rank Source Iteration for Steady-State Radiative Transfer Equation with Diffusion Synthetic Acceleration","ref_index":45,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RR7YIT4UXZDNY72YXTXWVUUNCO","json":"https://pith.science/pith/RR7YIT4UXZDNY72YXTXWVUUNCO.json","graph_json":"https://pith.science/api/pith-number/RR7YIT4UXZDNY72YXTXWVUUNCO/graph.json","events_json":"https://pith.science/api/pith-number/RR7YIT4UXZDNY72YXTXWVUUNCO/events.json","paper":"https://pith.science/paper/RR7YIT4U"},"agent_actions":{"view_html":"https://pith.science/pith/RR7YIT4UXZDNY72YXTXWVUUNCO","download_json":"https://pith.science/pith/RR7YIT4UXZDNY72YXTXWVUUNCO.json","view_paper":"https://pith.science/paper/RR7YIT4U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.07465&json=true","fetch_graph":"https://pith.science/api/pith-number/RR7YIT4UXZDNY72YXTXWVUUNCO/graph.json","fetch_events":"https://pith.science/api/pith-number/RR7YIT4UXZDNY72YXTXWVUUNCO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RR7YIT4UXZDNY72YXTXWVUUNCO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RR7YIT4UXZDNY72YXTXWVUUNCO/action/storage_attestation","attest_author":"https://pith.science/pith/RR7YIT4UXZDNY72YXTXWVUUNCO/action/author_attestation","sign_citation":"https://pith.science/pith/RR7YIT4UXZDNY72YXTXWVUUNCO/action/citation_signature","submit_replication":"https://pith.science/pith/RR7YIT4UXZDNY72YXTXWVUUNCO/action/replication_record"}},"created_at":"2026-07-05T09:18:37.689343+00:00","updated_at":"2026-07-05T09:18:37.689343+00:00"}