{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RBSICLS37ECXS3T3YIJS36A7J2","short_pith_number":"pith:RBSICLS3","schema_version":"1.0","canonical_sha256":"8864812e5bf905796e7bc2132df81f4e82e3d90a3e648bf61ce5e9003979be76","source":{"kind":"arxiv","id":"1608.00419","version":1},"attestation_state":"computed","paper":{"title":"A New Method for Computing $\\varphi$-functions and Their Condition Numbers of Large Sparse Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Gang Wu, Lu Zhang","submitted_at":"2016-08-01T13:30:30Z","abstract_excerpt":"We propose a new method for computing the $\\varphi$-functions of large sparse matrices with low rank or fast decaying singular values. The key is to reduce the computation of $\\varphi_{\\ell}$-functions of a large matrix to $\\varphi_{\\ell+1}$-functions of some $r$-by-$r$ matrices, where $r$ is the numerical rank of the large matrix in question. Some error analysis on the new method is given. Furthermore, we propose two novel strategies for estimating 2-norm condition numbers of the $\\varphi$-functions. Numerical experiments illustrate the numerical behavior of the new algorithms and show the ef"},"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":"1608.00419","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-08-01T13:30:30Z","cross_cats_sorted":[],"title_canon_sha256":"ede53c4acac15f23316eec2b672bdc2accd7df98c0a102f05fef9b0a51cc1c74","abstract_canon_sha256":"e2257121c6c14c9d490827f669cd0ff0be0bc1f1f4427214c477316a1a305cd0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:11.818032Z","signature_b64":"inHHV2mB1sFCQvzSos1xOhPP/9BK5RY2qEMhe0oBidAkaInmkHji11GNE5T22B+6mlRniFwty83UEjeKwSNeBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8864812e5bf905796e7bc2132df81f4e82e3d90a3e648bf61ce5e9003979be76","last_reissued_at":"2026-05-18T01:10:11.817591Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:11.817591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Method for Computing $\\varphi$-functions and Their Condition Numbers of Large Sparse Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Gang Wu, Lu Zhang","submitted_at":"2016-08-01T13:30:30Z","abstract_excerpt":"We propose a new method for computing the $\\varphi$-functions of large sparse matrices with low rank or fast decaying singular values. The key is to reduce the computation of $\\varphi_{\\ell}$-functions of a large matrix to $\\varphi_{\\ell+1}$-functions of some $r$-by-$r$ matrices, where $r$ is the numerical rank of the large matrix in question. Some error analysis on the new method is given. Furthermore, we propose two novel strategies for estimating 2-norm condition numbers of the $\\varphi$-functions. Numerical experiments illustrate the numerical behavior of the new algorithms and show the ef"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00419","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":"1608.00419","created_at":"2026-05-18T01:10:11.817655+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.00419v1","created_at":"2026-05-18T01:10:11.817655+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00419","created_at":"2026-05-18T01:10:11.817655+00:00"},{"alias_kind":"pith_short_12","alias_value":"RBSICLS37ECX","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RBSICLS37ECXS3T3","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RBSICLS3","created_at":"2026-05-18T12:30:41.710351+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/RBSICLS37ECXS3T3YIJS36A7J2","json":"https://pith.science/pith/RBSICLS37ECXS3T3YIJS36A7J2.json","graph_json":"https://pith.science/api/pith-number/RBSICLS37ECXS3T3YIJS36A7J2/graph.json","events_json":"https://pith.science/api/pith-number/RBSICLS37ECXS3T3YIJS36A7J2/events.json","paper":"https://pith.science/paper/RBSICLS3"},"agent_actions":{"view_html":"https://pith.science/pith/RBSICLS37ECXS3T3YIJS36A7J2","download_json":"https://pith.science/pith/RBSICLS37ECXS3T3YIJS36A7J2.json","view_paper":"https://pith.science/paper/RBSICLS3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.00419&json=true","fetch_graph":"https://pith.science/api/pith-number/RBSICLS37ECXS3T3YIJS36A7J2/graph.json","fetch_events":"https://pith.science/api/pith-number/RBSICLS37ECXS3T3YIJS36A7J2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RBSICLS37ECXS3T3YIJS36A7J2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RBSICLS37ECXS3T3YIJS36A7J2/action/storage_attestation","attest_author":"https://pith.science/pith/RBSICLS37ECXS3T3YIJS36A7J2/action/author_attestation","sign_citation":"https://pith.science/pith/RBSICLS37ECXS3T3YIJS36A7J2/action/citation_signature","submit_replication":"https://pith.science/pith/RBSICLS37ECXS3T3YIJS36A7J2/action/replication_record"}},"created_at":"2026-05-18T01:10:11.817655+00:00","updated_at":"2026-05-18T01:10:11.817655+00:00"}