{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:PYBJK2KXVM5Q3NPXPX5P2C55ML","short_pith_number":"pith:PYBJK2KX","schema_version":"1.0","canonical_sha256":"7e02956957ab3b0db5f77dfafd0bbd62ffda5895cf0ab89e1cd52de30a7c1b37","source":{"kind":"arxiv","id":"1903.06268","version":1},"attestation_state":"computed","paper":{"title":"Rational Minimax Iterations for Computing the Matrix $p$th Root","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Evan S. Gawlik","submitted_at":"2019-03-14T21:27:25Z","abstract_excerpt":"In [E. S. Gawlik, Zolotarev iterations for the matrix square root, arXiv preprint 1804.11000, (2018)], a family of iterations for computing the matrix square root was constructed by exploiting a recursion obeyed by Zolotarev's rational minimax approximants of the function $z^{1/2}$. The present paper generalizes this construction by deriving rational minimax iterations for the matrix $p^{th}$ root, where $p \\ge 2$ is an integer. The analysis of these iterations is considerably different from the case $p=2$, owing to the fact that when $p>2$, rational minimax approximants of the function $z^{1/"},"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":"1903.06268","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-03-14T21:27:25Z","cross_cats_sorted":[],"title_canon_sha256":"cb80160eb735c8bdcdb2c4cf5a5f977b49182e4d0f2b168af2a7d1e0a43fc4bd","abstract_canon_sha256":"cef5882c854ef448b81f1fbc72af755f635a20d51598b1f2e6b046225170f39c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:11.287735Z","signature_b64":"H4XKt0IJ47kbkz/JTu2HvtBSXkpKX3x0GDisLsVQ81zPC1N264OTGoMfrSgTBN/bHOGX3i9v5NRFyLCIMk3EBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e02956957ab3b0db5f77dfafd0bbd62ffda5895cf0ab89e1cd52de30a7c1b37","last_reissued_at":"2026-05-17T23:51:11.287109Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:11.287109Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rational Minimax Iterations for Computing the Matrix $p$th Root","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Evan S. Gawlik","submitted_at":"2019-03-14T21:27:25Z","abstract_excerpt":"In [E. S. Gawlik, Zolotarev iterations for the matrix square root, arXiv preprint 1804.11000, (2018)], a family of iterations for computing the matrix square root was constructed by exploiting a recursion obeyed by Zolotarev's rational minimax approximants of the function $z^{1/2}$. The present paper generalizes this construction by deriving rational minimax iterations for the matrix $p^{th}$ root, where $p \\ge 2$ is an integer. The analysis of these iterations is considerably different from the case $p=2$, owing to the fact that when $p>2$, rational minimax approximants of the function $z^{1/"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.06268","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":"1903.06268","created_at":"2026-05-17T23:51:11.287203+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.06268v1","created_at":"2026-05-17T23:51:11.287203+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.06268","created_at":"2026-05-17T23:51:11.287203+00:00"},{"alias_kind":"pith_short_12","alias_value":"PYBJK2KXVM5Q","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"PYBJK2KXVM5Q3NPX","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"PYBJK2KX","created_at":"2026-05-18T12:33:24.271573+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.11326","citing_title":"Approximating the pth Root by Composite Rational Functions","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PYBJK2KXVM5Q3NPXPX5P2C55ML","json":"https://pith.science/pith/PYBJK2KXVM5Q3NPXPX5P2C55ML.json","graph_json":"https://pith.science/api/pith-number/PYBJK2KXVM5Q3NPXPX5P2C55ML/graph.json","events_json":"https://pith.science/api/pith-number/PYBJK2KXVM5Q3NPXPX5P2C55ML/events.json","paper":"https://pith.science/paper/PYBJK2KX"},"agent_actions":{"view_html":"https://pith.science/pith/PYBJK2KXVM5Q3NPXPX5P2C55ML","download_json":"https://pith.science/pith/PYBJK2KXVM5Q3NPXPX5P2C55ML.json","view_paper":"https://pith.science/paper/PYBJK2KX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.06268&json=true","fetch_graph":"https://pith.science/api/pith-number/PYBJK2KXVM5Q3NPXPX5P2C55ML/graph.json","fetch_events":"https://pith.science/api/pith-number/PYBJK2KXVM5Q3NPXPX5P2C55ML/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PYBJK2KXVM5Q3NPXPX5P2C55ML/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PYBJK2KXVM5Q3NPXPX5P2C55ML/action/storage_attestation","attest_author":"https://pith.science/pith/PYBJK2KXVM5Q3NPXPX5P2C55ML/action/author_attestation","sign_citation":"https://pith.science/pith/PYBJK2KXVM5Q3NPXPX5P2C55ML/action/citation_signature","submit_replication":"https://pith.science/pith/PYBJK2KXVM5Q3NPXPX5P2C55ML/action/replication_record"}},"created_at":"2026-05-17T23:51:11.287203+00:00","updated_at":"2026-05-17T23:51:11.287203+00:00"}