{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DX32WJRMH4TL4KS5GSRMOZ6A3O","short_pith_number":"pith:DX32WJRM","schema_version":"1.0","canonical_sha256":"1df7ab262c3f26be2a5d34a2c767c0dbb3cdb60d17c335aba892839acfa381f6","source":{"kind":"arxiv","id":"1311.5028","version":2},"attestation_state":"computed","paper":{"title":"Existence of $\\mathcal{H}$-matrix approximants to the inverses of BEM matrices: the simple-layer operator","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Dirk Praetorius, Jens Markus Melenk, Markus Faustmann","submitted_at":"2013-11-20T12:08:28Z","abstract_excerpt":"We consider the question of approximating the inverse $\\mathbf W = \\mathbf V^{-1}$ of the Galerkin stiffness matrix $\\mathbf V$ obtained by discretizing the simple-layer operator $V$ with piecewise constant functions. The block partitioning of $\\mathbf W$ is assumed to satisfy any of the standard admissibility criteria that are employed in connection with clustering algorithms to approximate the discrete BEM operator $\\mathbf V$. We show that $\\mathbf W$ can be approximated by blockwise low-rank matrices such that the error decays exponentially in the block rank employed. Similar exponential a"},"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":"1311.5028","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-11-20T12:08:28Z","cross_cats_sorted":[],"title_canon_sha256":"2c4abbfe51fafdabb836396988e97b497c5913f3522f77bdc3130738d230e2e7","abstract_canon_sha256":"7ec92df1a72d2dfe43746af339fe64f3db3ddee4b85ea4d6253e451f8c233c32"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:31.266921Z","signature_b64":"kg0ZU+0dWJ+1FIcQzAUmmMKIHTL4cFv3OCn3GOwjpOWND4KUjn0bs+9xF1Y5lkM9oG5z8aK92A2V1kq5Zs3jDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1df7ab262c3f26be2a5d34a2c767c0dbb3cdb60d17c335aba892839acfa381f6","last_reissued_at":"2026-05-18T01:13:31.266180Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:31.266180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Existence of $\\mathcal{H}$-matrix approximants to the inverses of BEM matrices: the simple-layer operator","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Dirk Praetorius, Jens Markus Melenk, Markus Faustmann","submitted_at":"2013-11-20T12:08:28Z","abstract_excerpt":"We consider the question of approximating the inverse $\\mathbf W = \\mathbf V^{-1}$ of the Galerkin stiffness matrix $\\mathbf V$ obtained by discretizing the simple-layer operator $V$ with piecewise constant functions. The block partitioning of $\\mathbf W$ is assumed to satisfy any of the standard admissibility criteria that are employed in connection with clustering algorithms to approximate the discrete BEM operator $\\mathbf V$. We show that $\\mathbf W$ can be approximated by blockwise low-rank matrices such that the error decays exponentially in the block rank employed. Similar exponential a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.5028","kind":"arxiv","version":2},"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":"1311.5028","created_at":"2026-05-18T01:13:31.266280+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.5028v2","created_at":"2026-05-18T01:13:31.266280+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.5028","created_at":"2026-05-18T01:13:31.266280+00:00"},{"alias_kind":"pith_short_12","alias_value":"DX32WJRMH4TL","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DX32WJRMH4TL4KS5","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DX32WJRM","created_at":"2026-05-18T12:27:43.054852+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/DX32WJRMH4TL4KS5GSRMOZ6A3O","json":"https://pith.science/pith/DX32WJRMH4TL4KS5GSRMOZ6A3O.json","graph_json":"https://pith.science/api/pith-number/DX32WJRMH4TL4KS5GSRMOZ6A3O/graph.json","events_json":"https://pith.science/api/pith-number/DX32WJRMH4TL4KS5GSRMOZ6A3O/events.json","paper":"https://pith.science/paper/DX32WJRM"},"agent_actions":{"view_html":"https://pith.science/pith/DX32WJRMH4TL4KS5GSRMOZ6A3O","download_json":"https://pith.science/pith/DX32WJRMH4TL4KS5GSRMOZ6A3O.json","view_paper":"https://pith.science/paper/DX32WJRM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.5028&json=true","fetch_graph":"https://pith.science/api/pith-number/DX32WJRMH4TL4KS5GSRMOZ6A3O/graph.json","fetch_events":"https://pith.science/api/pith-number/DX32WJRMH4TL4KS5GSRMOZ6A3O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DX32WJRMH4TL4KS5GSRMOZ6A3O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DX32WJRMH4TL4KS5GSRMOZ6A3O/action/storage_attestation","attest_author":"https://pith.science/pith/DX32WJRMH4TL4KS5GSRMOZ6A3O/action/author_attestation","sign_citation":"https://pith.science/pith/DX32WJRMH4TL4KS5GSRMOZ6A3O/action/citation_signature","submit_replication":"https://pith.science/pith/DX32WJRMH4TL4KS5GSRMOZ6A3O/action/replication_record"}},"created_at":"2026-05-18T01:13:31.266280+00:00","updated_at":"2026-05-18T01:13:31.266280+00:00"}