{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:24WC2UZWKB636UPDTIPDW5AYSF","short_pith_number":"pith:24WC2UZW","schema_version":"1.0","canonical_sha256":"d72c2d5336507dbf51e39a1e3b7418916b644ea97b0d6ec4d2effac045666f17","source":{"kind":"arxiv","id":"1304.0563","version":1},"attestation_state":"computed","paper":{"title":"Optimal rank matrix algebras preconditioners","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"C. Di Fiore, E. E. Tyrtyshnikov, F. Tudisco","submitted_at":"2013-04-02T08:53:03Z","abstract_excerpt":"When a linear system Ax = y is solved by means of iterative methods (mainly CG and GMRES) and the convergence rate is slow, one may consider a preconditioner P. The use of such preconditioner changes the spectrum of the matrix defining the system and could result into a great acceleration of the convergence rate. The construction of optimal rank preconditioners is strongly related to the possibility of splitting A as A = P + R + E, where E is a small perturbation and R is of low rank. In the present work we extend the black-dot algorithm for the computation of such splitting for P circulant, t"},"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":"1304.0563","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-04-02T08:53:03Z","cross_cats_sorted":[],"title_canon_sha256":"c10a0919df87ed308a2edae8255e245a518eadeae9cdef18018c48f1c33e7582","abstract_canon_sha256":"ae2cfdab10c2a13ff53614edec39ded41ab092b03d602a84a04582af13e47f84"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:15.046448Z","signature_b64":"Cp3F4dqFCe8mg56DSGZTtjJ0pos1d54lAJPCXt16vADQhr9Gp7v+2fhGXrlnyycV2ztQYLWxKA6hQ1S5SZunAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d72c2d5336507dbf51e39a1e3b7418916b644ea97b0d6ec4d2effac045666f17","last_reissued_at":"2026-05-18T03:29:15.045685Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:15.045685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal rank matrix algebras preconditioners","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"C. Di Fiore, E. E. Tyrtyshnikov, F. Tudisco","submitted_at":"2013-04-02T08:53:03Z","abstract_excerpt":"When a linear system Ax = y is solved by means of iterative methods (mainly CG and GMRES) and the convergence rate is slow, one may consider a preconditioner P. The use of such preconditioner changes the spectrum of the matrix defining the system and could result into a great acceleration of the convergence rate. The construction of optimal rank preconditioners is strongly related to the possibility of splitting A as A = P + R + E, where E is a small perturbation and R is of low rank. In the present work we extend the black-dot algorithm for the computation of such splitting for P circulant, t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0563","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":"1304.0563","created_at":"2026-05-18T03:29:15.045803+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.0563v1","created_at":"2026-05-18T03:29:15.045803+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0563","created_at":"2026-05-18T03:29:15.045803+00:00"},{"alias_kind":"pith_short_12","alias_value":"24WC2UZWKB63","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"24WC2UZWKB636UPD","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"24WC2UZW","created_at":"2026-05-18T12:27:30.460161+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/24WC2UZWKB636UPDTIPDW5AYSF","json":"https://pith.science/pith/24WC2UZWKB636UPDTIPDW5AYSF.json","graph_json":"https://pith.science/api/pith-number/24WC2UZWKB636UPDTIPDW5AYSF/graph.json","events_json":"https://pith.science/api/pith-number/24WC2UZWKB636UPDTIPDW5AYSF/events.json","paper":"https://pith.science/paper/24WC2UZW"},"agent_actions":{"view_html":"https://pith.science/pith/24WC2UZWKB636UPDTIPDW5AYSF","download_json":"https://pith.science/pith/24WC2UZWKB636UPDTIPDW5AYSF.json","view_paper":"https://pith.science/paper/24WC2UZW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.0563&json=true","fetch_graph":"https://pith.science/api/pith-number/24WC2UZWKB636UPDTIPDW5AYSF/graph.json","fetch_events":"https://pith.science/api/pith-number/24WC2UZWKB636UPDTIPDW5AYSF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/24WC2UZWKB636UPDTIPDW5AYSF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/24WC2UZWKB636UPDTIPDW5AYSF/action/storage_attestation","attest_author":"https://pith.science/pith/24WC2UZWKB636UPDTIPDW5AYSF/action/author_attestation","sign_citation":"https://pith.science/pith/24WC2UZWKB636UPDTIPDW5AYSF/action/citation_signature","submit_replication":"https://pith.science/pith/24WC2UZWKB636UPDTIPDW5AYSF/action/replication_record"}},"created_at":"2026-05-18T03:29:15.045803+00:00","updated_at":"2026-05-18T03:29:15.045803+00:00"}