{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DXOEARGS2M5NM3TDEUNZU6QP2C","short_pith_number":"pith:DXOEARGS","schema_version":"1.0","canonical_sha256":"1ddc4044d2d33ad66e63251b9a7a0fd0987ab7143eb27bc2c604ccf6e49c890b","source":{"kind":"arxiv","id":"1504.03026","version":2},"attestation_state":"computed","paper":{"title":"Analysis of a Classical Matrix Preconditioning Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.DS","authors_text":"Alistair Sinclair, Leonard J. Schulman","submitted_at":"2015-04-12T21:30:05Z","abstract_excerpt":"We study a classical iterative algorithm for balancing matrices in the $L_\\infty$ norm via a scaling transformation. This algorithm, which goes back to Osborne and Parlett \\& Reinsch in the 1960s, is implemented as a standard preconditioner in many numerical linear algebra packages. Surprisingly, despite its widespread use over several decades, no bounds were known on its rate of convergence. In this paper we prove that, for any irreducible $n\\times n$ (real or complex) input matrix~$A$, a natural variant of the algorithm converges in $O(n^3\\log(n\\rho/\\varepsilon))$ elementary balancing operat"},"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":"1504.03026","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-12T21:30:05Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"14fcf3ae126d21ced42d5c9de4d6bdf9b832c46a7c6ce3fbfacb2590da2c6ec7","abstract_canon_sha256":"b0ae30df0299e372189703b2329873d49be6a266f50fe2dace5a0f932ce7b81a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:49:55.585877Z","signature_b64":"76ht06pcRqx0wcluDIKIF9prjzMrIhpuKlXTyjlKYH1mI6ZrKuXbaqN6hu557zrQXsaEUGw7Q40NXN/erSB/Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ddc4044d2d33ad66e63251b9a7a0fd0987ab7143eb27bc2c604ccf6e49c890b","last_reissued_at":"2026-05-18T01:49:55.585407Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:49:55.585407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analysis of a Classical Matrix Preconditioning Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.DS","authors_text":"Alistair Sinclair, Leonard J. Schulman","submitted_at":"2015-04-12T21:30:05Z","abstract_excerpt":"We study a classical iterative algorithm for balancing matrices in the $L_\\infty$ norm via a scaling transformation. This algorithm, which goes back to Osborne and Parlett \\& Reinsch in the 1960s, is implemented as a standard preconditioner in many numerical linear algebra packages. Surprisingly, despite its widespread use over several decades, no bounds were known on its rate of convergence. In this paper we prove that, for any irreducible $n\\times n$ (real or complex) input matrix~$A$, a natural variant of the algorithm converges in $O(n^3\\log(n\\rho/\\varepsilon))$ elementary balancing operat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03026","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":"1504.03026","created_at":"2026-05-18T01:49:55.585483+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.03026v2","created_at":"2026-05-18T01:49:55.585483+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03026","created_at":"2026-05-18T01:49:55.585483+00:00"},{"alias_kind":"pith_short_12","alias_value":"DXOEARGS2M5N","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DXOEARGS2M5NM3TD","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DXOEARGS","created_at":"2026-05-18T12:29:17.054201+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/DXOEARGS2M5NM3TDEUNZU6QP2C","json":"https://pith.science/pith/DXOEARGS2M5NM3TDEUNZU6QP2C.json","graph_json":"https://pith.science/api/pith-number/DXOEARGS2M5NM3TDEUNZU6QP2C/graph.json","events_json":"https://pith.science/api/pith-number/DXOEARGS2M5NM3TDEUNZU6QP2C/events.json","paper":"https://pith.science/paper/DXOEARGS"},"agent_actions":{"view_html":"https://pith.science/pith/DXOEARGS2M5NM3TDEUNZU6QP2C","download_json":"https://pith.science/pith/DXOEARGS2M5NM3TDEUNZU6QP2C.json","view_paper":"https://pith.science/paper/DXOEARGS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.03026&json=true","fetch_graph":"https://pith.science/api/pith-number/DXOEARGS2M5NM3TDEUNZU6QP2C/graph.json","fetch_events":"https://pith.science/api/pith-number/DXOEARGS2M5NM3TDEUNZU6QP2C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DXOEARGS2M5NM3TDEUNZU6QP2C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DXOEARGS2M5NM3TDEUNZU6QP2C/action/storage_attestation","attest_author":"https://pith.science/pith/DXOEARGS2M5NM3TDEUNZU6QP2C/action/author_attestation","sign_citation":"https://pith.science/pith/DXOEARGS2M5NM3TDEUNZU6QP2C/action/citation_signature","submit_replication":"https://pith.science/pith/DXOEARGS2M5NM3TDEUNZU6QP2C/action/replication_record"}},"created_at":"2026-05-18T01:49:55.585483+00:00","updated_at":"2026-05-18T01:49:55.585483+00:00"}