{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SMXLILV53XBV5O5RGHSXFCLJAR","short_pith_number":"pith:SMXLILV5","schema_version":"1.0","canonical_sha256":"932eb42ebdddc35ebbb131e572896904586c74180b2b5cf782969747563372c0","source":{"kind":"arxiv","id":"1508.01835","version":2},"attestation_state":"computed","paper":{"title":"The inverse fast multipole method: using a fast approximate direct solver as a preconditioner for dense linear systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Eric Darve, Hadi Pouransari, Pieter Coulier","submitted_at":"2015-08-07T23:22:43Z","abstract_excerpt":"Although some preconditioners are available for solving dense linear systems, there are still many matrices for which preconditioners are lacking, in particular in cases where the size of the matrix $N$ becomes very large. There remains hence a great need to develop general purpose preconditioners whose cost scales well with the matrix size $N$. In this paper, we propose a preconditioner with broad applicability and with cost $\\mathcal{O}(N)$ for dense matrices, when the matrix is given by a smooth kernel. Extending the method using the same framework to general $\\mathcal{H}^2$-matrices is rel"},"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":"1508.01835","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-08-07T23:22:43Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"c17aac2fa751d8bcb2770b621a145e114b1894d1558057d9050d4e41f66678fc","abstract_canon_sha256":"f43be9b82c0dfd65b01f87f4515f627587cdb20c3622683daffaa08a7f453bd3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:19.482358Z","signature_b64":"sm5PmLIWgACYb8mrIaqOM1ODc+yZtNfwBGsipU77bBocQn1enrkOJatYztaEoEzLVdf+c5eXy4Qf0FDCxahxCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"932eb42ebdddc35ebbb131e572896904586c74180b2b5cf782969747563372c0","last_reissued_at":"2026-05-18T01:21:19.481687Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:19.481687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The inverse fast multipole method: using a fast approximate direct solver as a preconditioner for dense linear systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Eric Darve, Hadi Pouransari, Pieter Coulier","submitted_at":"2015-08-07T23:22:43Z","abstract_excerpt":"Although some preconditioners are available for solving dense linear systems, there are still many matrices for which preconditioners are lacking, in particular in cases where the size of the matrix $N$ becomes very large. There remains hence a great need to develop general purpose preconditioners whose cost scales well with the matrix size $N$. In this paper, we propose a preconditioner with broad applicability and with cost $\\mathcal{O}(N)$ for dense matrices, when the matrix is given by a smooth kernel. Extending the method using the same framework to general $\\mathcal{H}^2$-matrices is rel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01835","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":"1508.01835","created_at":"2026-05-18T01:21:19.481769+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.01835v2","created_at":"2026-05-18T01:21:19.481769+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01835","created_at":"2026-05-18T01:21:19.481769+00:00"},{"alias_kind":"pith_short_12","alias_value":"SMXLILV53XBV","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"SMXLILV53XBV5O5R","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"SMXLILV5","created_at":"2026-05-18T12:29:42.218222+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/SMXLILV53XBV5O5RGHSXFCLJAR","json":"https://pith.science/pith/SMXLILV53XBV5O5RGHSXFCLJAR.json","graph_json":"https://pith.science/api/pith-number/SMXLILV53XBV5O5RGHSXFCLJAR/graph.json","events_json":"https://pith.science/api/pith-number/SMXLILV53XBV5O5RGHSXFCLJAR/events.json","paper":"https://pith.science/paper/SMXLILV5"},"agent_actions":{"view_html":"https://pith.science/pith/SMXLILV53XBV5O5RGHSXFCLJAR","download_json":"https://pith.science/pith/SMXLILV53XBV5O5RGHSXFCLJAR.json","view_paper":"https://pith.science/paper/SMXLILV5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.01835&json=true","fetch_graph":"https://pith.science/api/pith-number/SMXLILV53XBV5O5RGHSXFCLJAR/graph.json","fetch_events":"https://pith.science/api/pith-number/SMXLILV53XBV5O5RGHSXFCLJAR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SMXLILV53XBV5O5RGHSXFCLJAR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SMXLILV53XBV5O5RGHSXFCLJAR/action/storage_attestation","attest_author":"https://pith.science/pith/SMXLILV53XBV5O5RGHSXFCLJAR/action/author_attestation","sign_citation":"https://pith.science/pith/SMXLILV53XBV5O5RGHSXFCLJAR/action/citation_signature","submit_replication":"https://pith.science/pith/SMXLILV53XBV5O5RGHSXFCLJAR/action/replication_record"}},"created_at":"2026-05-18T01:21:19.481769+00:00","updated_at":"2026-05-18T01:21:19.481769+00:00"}