{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NRG3SD42BVM57ZI6VMP3REG5G5","short_pith_number":"pith:NRG3SD42","schema_version":"1.0","canonical_sha256":"6c4db90f9a0d59dfe51eab1fb890dd37547be8881caa3bfd33226afd888fffff","source":{"kind":"arxiv","id":"1509.09264","version":1},"attestation_state":"computed","paper":{"title":"On recursive algorithms for inverting tridiagonal matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Iwona Wr\\'obel, Pawe{\\l} Keller","submitted_at":"2015-09-30T17:27:27Z","abstract_excerpt":"If $A$ is a tridiagonal matrix, then the equations $AX=I$ and $XA=I$ defining the inverse $X$ of $A$ are in fact the second order recurrence relations for the elements in each row and column of $X$. Thus, the recursive algorithms should be a natural and commonly used way for inverting tridiagonal matrices -- but they are not. Even though a variety of such algorithms were proposed so far, none of them can be applied to numerically invert an arbitrary tridiagonal matrix. Moreover, some of the methods suffer a huge instability problem. In this paper, we investigate these problems very thoroughly."},"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":"1509.09264","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-09-30T17:27:27Z","cross_cats_sorted":[],"title_canon_sha256":"df778679e1ccaf09a16a00abf62c67dd19f278848a2280a2fa759aab43b3f056","abstract_canon_sha256":"400ec5ae8acd43d39ffd2032c65b370c89e7c212b3e2f55948645d33c00674d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:21.885668Z","signature_b64":"+1H8+6dEIZ9zWmGzihrOvYPt6rnmtG2muwj7S23jfdSnmNdHJi/aOz8M52E104Be2nzl+7w4p34scFFeQqQEDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c4db90f9a0d59dfe51eab1fb890dd37547be8881caa3bfd33226afd888fffff","last_reissued_at":"2026-05-18T01:31:21.885168Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:21.885168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On recursive algorithms for inverting tridiagonal matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Iwona Wr\\'obel, Pawe{\\l} Keller","submitted_at":"2015-09-30T17:27:27Z","abstract_excerpt":"If $A$ is a tridiagonal matrix, then the equations $AX=I$ and $XA=I$ defining the inverse $X$ of $A$ are in fact the second order recurrence relations for the elements in each row and column of $X$. Thus, the recursive algorithms should be a natural and commonly used way for inverting tridiagonal matrices -- but they are not. Even though a variety of such algorithms were proposed so far, none of them can be applied to numerically invert an arbitrary tridiagonal matrix. Moreover, some of the methods suffer a huge instability problem. In this paper, we investigate these problems very thoroughly."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.09264","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":"1509.09264","created_at":"2026-05-18T01:31:21.885233+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.09264v1","created_at":"2026-05-18T01:31:21.885233+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.09264","created_at":"2026-05-18T01:31:21.885233+00:00"},{"alias_kind":"pith_short_12","alias_value":"NRG3SD42BVM5","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"NRG3SD42BVM57ZI6","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"NRG3SD42","created_at":"2026-05-18T12:29:34.919912+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/NRG3SD42BVM57ZI6VMP3REG5G5","json":"https://pith.science/pith/NRG3SD42BVM57ZI6VMP3REG5G5.json","graph_json":"https://pith.science/api/pith-number/NRG3SD42BVM57ZI6VMP3REG5G5/graph.json","events_json":"https://pith.science/api/pith-number/NRG3SD42BVM57ZI6VMP3REG5G5/events.json","paper":"https://pith.science/paper/NRG3SD42"},"agent_actions":{"view_html":"https://pith.science/pith/NRG3SD42BVM57ZI6VMP3REG5G5","download_json":"https://pith.science/pith/NRG3SD42BVM57ZI6VMP3REG5G5.json","view_paper":"https://pith.science/paper/NRG3SD42","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.09264&json=true","fetch_graph":"https://pith.science/api/pith-number/NRG3SD42BVM57ZI6VMP3REG5G5/graph.json","fetch_events":"https://pith.science/api/pith-number/NRG3SD42BVM57ZI6VMP3REG5G5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NRG3SD42BVM57ZI6VMP3REG5G5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NRG3SD42BVM57ZI6VMP3REG5G5/action/storage_attestation","attest_author":"https://pith.science/pith/NRG3SD42BVM57ZI6VMP3REG5G5/action/author_attestation","sign_citation":"https://pith.science/pith/NRG3SD42BVM57ZI6VMP3REG5G5/action/citation_signature","submit_replication":"https://pith.science/pith/NRG3SD42BVM57ZI6VMP3REG5G5/action/replication_record"}},"created_at":"2026-05-18T01:31:21.885233+00:00","updated_at":"2026-05-18T01:31:21.885233+00:00"}