{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:USVE7HLCFF47ACRJPWXDXUKQC4","short_pith_number":"pith:USVE7HLC","schema_version":"1.0","canonical_sha256":"a4aa4f9d622979f00a297dae3bd15017158929a7a94a0beb13758afba03b0144","source":{"kind":"arxiv","id":"2008.11480","version":1},"attestation_state":"computed","paper":{"title":"Convergence Rate Improvement of Richardson and Newton-Schulz Iterations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Alexander Stotsky","submitted_at":"2020-08-26T10:35:10Z","abstract_excerpt":"Fast convergent, accurate, computationally efficient, parallelizable, and robust matrix inversion and parameter estimation algorithms are required in many time-critical and accuracy-critical applications such as system identification, signal and image processing, network and big data analysis, machine learning and in many others. This paper introduces new composite power series expansion with optionally chosen rates (which can be calculated simultaneously on parallel units with different computational capacities) for further convergence rate improvement of high order Newton-Schulz iteration. N"},"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":"2008.11480","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-08-26T10:35:10Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"e070d80b55dbbc86b26061c3fd8db27893e91dd1cf621481314d7cc1d7c3df70","abstract_canon_sha256":"6b6c9a91cc62536ee5aed51ad280145da2bfa8cf6795808948e161d793cb3645"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:30:45.263285Z","signature_b64":"UtKmf4V8Dqo02Bm0Mlhvzvs/gvfUrdHWTnm0EhX4XU6/Q00eKZO/ueOFU00kynpdILq8wXznc0bgm0mESodTDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4aa4f9d622979f00a297dae3bd15017158929a7a94a0beb13758afba03b0144","last_reissued_at":"2026-07-05T01:30:45.262893Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:30:45.262893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convergence Rate Improvement of Richardson and Newton-Schulz Iterations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Alexander Stotsky","submitted_at":"2020-08-26T10:35:10Z","abstract_excerpt":"Fast convergent, accurate, computationally efficient, parallelizable, and robust matrix inversion and parameter estimation algorithms are required in many time-critical and accuracy-critical applications such as system identification, signal and image processing, network and big data analysis, machine learning and in many others. This paper introduces new composite power series expansion with optionally chosen rates (which can be calculated simultaneously on parallel units with different computational capacities) for further convergence rate improvement of high order Newton-Schulz iteration. N"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.11480","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2008.11480/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2008.11480","created_at":"2026-07-05T01:30:45.262954+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.11480v1","created_at":"2026-07-05T01:30:45.262954+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.11480","created_at":"2026-07-05T01:30:45.262954+00:00"},{"alias_kind":"pith_short_12","alias_value":"USVE7HLCFF47","created_at":"2026-07-05T01:30:45.262954+00:00"},{"alias_kind":"pith_short_16","alias_value":"USVE7HLCFF47ACRJ","created_at":"2026-07-05T01:30:45.262954+00:00"},{"alias_kind":"pith_short_8","alias_value":"USVE7HLC","created_at":"2026-07-05T01:30:45.262954+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.23594","citing_title":"Multilook Coherent Imaging: Theoretical Guarantees and Algorithms","ref_index":50,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/USVE7HLCFF47ACRJPWXDXUKQC4","json":"https://pith.science/pith/USVE7HLCFF47ACRJPWXDXUKQC4.json","graph_json":"https://pith.science/api/pith-number/USVE7HLCFF47ACRJPWXDXUKQC4/graph.json","events_json":"https://pith.science/api/pith-number/USVE7HLCFF47ACRJPWXDXUKQC4/events.json","paper":"https://pith.science/paper/USVE7HLC"},"agent_actions":{"view_html":"https://pith.science/pith/USVE7HLCFF47ACRJPWXDXUKQC4","download_json":"https://pith.science/pith/USVE7HLCFF47ACRJPWXDXUKQC4.json","view_paper":"https://pith.science/paper/USVE7HLC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.11480&json=true","fetch_graph":"https://pith.science/api/pith-number/USVE7HLCFF47ACRJPWXDXUKQC4/graph.json","fetch_events":"https://pith.science/api/pith-number/USVE7HLCFF47ACRJPWXDXUKQC4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/USVE7HLCFF47ACRJPWXDXUKQC4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/USVE7HLCFF47ACRJPWXDXUKQC4/action/storage_attestation","attest_author":"https://pith.science/pith/USVE7HLCFF47ACRJPWXDXUKQC4/action/author_attestation","sign_citation":"https://pith.science/pith/USVE7HLCFF47ACRJPWXDXUKQC4/action/citation_signature","submit_replication":"https://pith.science/pith/USVE7HLCFF47ACRJPWXDXUKQC4/action/replication_record"}},"created_at":"2026-07-05T01:30:45.262954+00:00","updated_at":"2026-07-05T01:30:45.262954+00:00"}