{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3JNHGIGC2JSZCMVYIR3VUUMJKE","short_pith_number":"pith:3JNHGIGC","schema_version":"1.0","canonical_sha256":"da5a7320c2d2659132b844775a51895134dfec22d8672eb568d4d407540903a7","source":{"kind":"arxiv","id":"1412.1253","version":1},"attestation_state":"computed","paper":{"title":"Preconditioners for hierarchical matrices based on their extended sparse form","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Daria Sushnikova, Ivan V. Oseledets","submitted_at":"2014-12-03T09:42:59Z","abstract_excerpt":"In this paper we consider linear systems with dense-matrices which arise from numerical solution of boundary integral equations. Such matrices can be well-approximated with $\\mathcal{H}^2$-matrices. We propose several new preconditioners for such matrices that are based on the equivalent \\emph{sparse extended form} of $\\mathcal{H}^2$-matrices. In the numerical experiments we show that the most efficient approach is based on the so-called reverse-Schur preconditioning technique."},"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":"1412.1253","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-12-03T09:42:59Z","cross_cats_sorted":[],"title_canon_sha256":"b1b4cf7bb1cc586627230bfea81809d473493bfae48699375a8183d5d31f718d","abstract_canon_sha256":"31ac97860b752b91a1e75beae24c78d55c30133717726c8fff758f63a3a7e600"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:12.993587Z","signature_b64":"gCd/Lok6gLYzesvZt/nMt5OgPbobu6C6nRoYIfVbPQSTMjwavG3c2Oiw7cQQD+F0d5Kji3ga6U6D77rU/2OWCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da5a7320c2d2659132b844775a51895134dfec22d8672eb568d4d407540903a7","last_reissued_at":"2026-05-18T02:32:12.993089Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:12.993089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Preconditioners for hierarchical matrices based on their extended sparse form","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Daria Sushnikova, Ivan V. Oseledets","submitted_at":"2014-12-03T09:42:59Z","abstract_excerpt":"In this paper we consider linear systems with dense-matrices which arise from numerical solution of boundary integral equations. Such matrices can be well-approximated with $\\mathcal{H}^2$-matrices. We propose several new preconditioners for such matrices that are based on the equivalent \\emph{sparse extended form} of $\\mathcal{H}^2$-matrices. In the numerical experiments we show that the most efficient approach is based on the so-called reverse-Schur preconditioning technique."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1253","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":"1412.1253","created_at":"2026-05-18T02:32:12.993173+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.1253v1","created_at":"2026-05-18T02:32:12.993173+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1253","created_at":"2026-05-18T02:32:12.993173+00:00"},{"alias_kind":"pith_short_12","alias_value":"3JNHGIGC2JSZ","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3JNHGIGC2JSZCMVY","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3JNHGIGC","created_at":"2026-05-18T12:28:11.866339+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/3JNHGIGC2JSZCMVYIR3VUUMJKE","json":"https://pith.science/pith/3JNHGIGC2JSZCMVYIR3VUUMJKE.json","graph_json":"https://pith.science/api/pith-number/3JNHGIGC2JSZCMVYIR3VUUMJKE/graph.json","events_json":"https://pith.science/api/pith-number/3JNHGIGC2JSZCMVYIR3VUUMJKE/events.json","paper":"https://pith.science/paper/3JNHGIGC"},"agent_actions":{"view_html":"https://pith.science/pith/3JNHGIGC2JSZCMVYIR3VUUMJKE","download_json":"https://pith.science/pith/3JNHGIGC2JSZCMVYIR3VUUMJKE.json","view_paper":"https://pith.science/paper/3JNHGIGC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.1253&json=true","fetch_graph":"https://pith.science/api/pith-number/3JNHGIGC2JSZCMVYIR3VUUMJKE/graph.json","fetch_events":"https://pith.science/api/pith-number/3JNHGIGC2JSZCMVYIR3VUUMJKE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3JNHGIGC2JSZCMVYIR3VUUMJKE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3JNHGIGC2JSZCMVYIR3VUUMJKE/action/storage_attestation","attest_author":"https://pith.science/pith/3JNHGIGC2JSZCMVYIR3VUUMJKE/action/author_attestation","sign_citation":"https://pith.science/pith/3JNHGIGC2JSZCMVYIR3VUUMJKE/action/citation_signature","submit_replication":"https://pith.science/pith/3JNHGIGC2JSZCMVYIR3VUUMJKE/action/replication_record"}},"created_at":"2026-05-18T02:32:12.993173+00:00","updated_at":"2026-05-18T02:32:12.993173+00:00"}