{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QES4JHDMF3OQAPFW7F4GBMWR2I","short_pith_number":"pith:QES4JHDM","schema_version":"1.0","canonical_sha256":"8125c49c6c2edd003cb6f97860b2d1d21f3bb4a9fe1e471883b5593a8911fd61","source":{"kind":"arxiv","id":"1707.03045","version":1},"attestation_state":"computed","paper":{"title":"Low-rank updates of matrix functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"math.NA","authors_text":"Bernhard Beckermann, Daniel Kressner, Marcel Schweitzer","submitted_at":"2017-07-10T20:08:48Z","abstract_excerpt":"We consider the task of updating a matrix function $f(A)$ when the matrix $A\\in{\\mathbb C}^{n \\times n}$ is subject to a low-rank modification. In other words, we aim at approximating $f(A+D)-f(A)$ for a matrix $D$ of rank $k \\ll n$. The approach proposed in this paper attains efficiency by projecting onto tensorized Krylov subspaces produced by matrix-vector multiplications with $A$ and $A^*$. We prove the approximations obtained from $m$ steps of the proposed methods are exact if $f$ is a polynomial of degree at most $m$ and use this as a basis for proving a variety of convergence results, i"},"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":"1707.03045","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-07-10T20:08:48Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"6919a52ed2914e09b14408e04807acf47dad8d8ca2d9fe0d5e3e71257cb107a2","abstract_canon_sha256":"aa923e0508ed9893140ccae276def1b33bfdeaa12ada510c56a88e035994c9de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:34.508031Z","signature_b64":"KcbG+wq+p7MKUNcbOg9iVoLRdjt84eOysx1fIffsUzv98vUAT6mxKE3QapN6HLs7FO1Y4WKz66Yyqsd58e49BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8125c49c6c2edd003cb6f97860b2d1d21f3bb4a9fe1e471883b5593a8911fd61","last_reissued_at":"2026-05-18T00:40:34.507344Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:34.507344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-rank updates of matrix functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"math.NA","authors_text":"Bernhard Beckermann, Daniel Kressner, Marcel Schweitzer","submitted_at":"2017-07-10T20:08:48Z","abstract_excerpt":"We consider the task of updating a matrix function $f(A)$ when the matrix $A\\in{\\mathbb C}^{n \\times n}$ is subject to a low-rank modification. In other words, we aim at approximating $f(A+D)-f(A)$ for a matrix $D$ of rank $k \\ll n$. The approach proposed in this paper attains efficiency by projecting onto tensorized Krylov subspaces produced by matrix-vector multiplications with $A$ and $A^*$. We prove the approximations obtained from $m$ steps of the proposed methods are exact if $f$ is a polynomial of degree at most $m$ and use this as a basis for proving a variety of convergence results, i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03045","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":"1707.03045","created_at":"2026-05-18T00:40:34.507460+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.03045v1","created_at":"2026-05-18T00:40:34.507460+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03045","created_at":"2026-05-18T00:40:34.507460+00:00"},{"alias_kind":"pith_short_12","alias_value":"QES4JHDMF3OQ","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"QES4JHDMF3OQAPFW","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"QES4JHDM","created_at":"2026-05-18T12:31:37.085036+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/QES4JHDMF3OQAPFW7F4GBMWR2I","json":"https://pith.science/pith/QES4JHDMF3OQAPFW7F4GBMWR2I.json","graph_json":"https://pith.science/api/pith-number/QES4JHDMF3OQAPFW7F4GBMWR2I/graph.json","events_json":"https://pith.science/api/pith-number/QES4JHDMF3OQAPFW7F4GBMWR2I/events.json","paper":"https://pith.science/paper/QES4JHDM"},"agent_actions":{"view_html":"https://pith.science/pith/QES4JHDMF3OQAPFW7F4GBMWR2I","download_json":"https://pith.science/pith/QES4JHDMF3OQAPFW7F4GBMWR2I.json","view_paper":"https://pith.science/paper/QES4JHDM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.03045&json=true","fetch_graph":"https://pith.science/api/pith-number/QES4JHDMF3OQAPFW7F4GBMWR2I/graph.json","fetch_events":"https://pith.science/api/pith-number/QES4JHDMF3OQAPFW7F4GBMWR2I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QES4JHDMF3OQAPFW7F4GBMWR2I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QES4JHDMF3OQAPFW7F4GBMWR2I/action/storage_attestation","attest_author":"https://pith.science/pith/QES4JHDMF3OQAPFW7F4GBMWR2I/action/author_attestation","sign_citation":"https://pith.science/pith/QES4JHDMF3OQAPFW7F4GBMWR2I/action/citation_signature","submit_replication":"https://pith.science/pith/QES4JHDMF3OQAPFW7F4GBMWR2I/action/replication_record"}},"created_at":"2026-05-18T00:40:34.507460+00:00","updated_at":"2026-05-18T00:40:34.507460+00:00"}