{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:N3YZLQ5F2N5FFWLKEIQOU6G5IM","short_pith_number":"pith:N3YZLQ5F","schema_version":"1.0","canonical_sha256":"6ef195c3a5d37a52d96a2220ea78dd4304866c4e045ad90d6b061c5f88a3494b","source":{"kind":"arxiv","id":"1410.2202","version":1},"attestation_state":"computed","paper":{"title":"Newton-Ellipsoid Method and its Polynomiography","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NA","authors_text":"Bahman Kalantari, Eric Lee","submitted_at":"2014-10-08T18:12:26Z","abstract_excerpt":"We introduce a new iterative root-finding method for complex polynomials, dubbed {\\it Newton-Ellipsoid} method. It is inspired by the Ellipsoid method, a classical method in optimization, and a property of Newton's Method derived in \\cite{kalFTA}, according to which at each complex number a half-space can be found containing a root. Newton-Ellipsoid method combines this property, bounds on zeros, together with the plane-cutting properties of the Ellipsoid Method. We present computational results for several examples, as well as corresponding polynomiography. Polynomiography refers to algorithm"},"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":"1410.2202","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2014-10-08T18:12:26Z","cross_cats_sorted":[],"title_canon_sha256":"57be92c7e2d6240f2df51109d59651d028c149878ec3a285549cec5a4c4fd91a","abstract_canon_sha256":"0e1dcfc82aa5a902136890154325e43ad6eb8d98f69cf9f948921c0513e8aad8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:47.985799Z","signature_b64":"IacKM4eQ9zuHml0A2rbbgLqTY6qm92fr4iXSPcVFf+t2k4z/8ZaCtt1X/sw0/D/bSXgn/yqXlp1fKAdtzJHgAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ef195c3a5d37a52d96a2220ea78dd4304866c4e045ad90d6b061c5f88a3494b","last_reissued_at":"2026-05-18T02:40:47.985328Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:47.985328Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Newton-Ellipsoid Method and its Polynomiography","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NA","authors_text":"Bahman Kalantari, Eric Lee","submitted_at":"2014-10-08T18:12:26Z","abstract_excerpt":"We introduce a new iterative root-finding method for complex polynomials, dubbed {\\it Newton-Ellipsoid} method. It is inspired by the Ellipsoid method, a classical method in optimization, and a property of Newton's Method derived in \\cite{kalFTA}, according to which at each complex number a half-space can be found containing a root. Newton-Ellipsoid method combines this property, bounds on zeros, together with the plane-cutting properties of the Ellipsoid Method. We present computational results for several examples, as well as corresponding polynomiography. Polynomiography refers to algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.2202","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":"1410.2202","created_at":"2026-05-18T02:40:47.985409+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.2202v1","created_at":"2026-05-18T02:40:47.985409+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2202","created_at":"2026-05-18T02:40:47.985409+00:00"},{"alias_kind":"pith_short_12","alias_value":"N3YZLQ5F2N5F","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"N3YZLQ5F2N5FFWLK","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"N3YZLQ5F","created_at":"2026-05-18T12:28:41.024544+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/N3YZLQ5F2N5FFWLKEIQOU6G5IM","json":"https://pith.science/pith/N3YZLQ5F2N5FFWLKEIQOU6G5IM.json","graph_json":"https://pith.science/api/pith-number/N3YZLQ5F2N5FFWLKEIQOU6G5IM/graph.json","events_json":"https://pith.science/api/pith-number/N3YZLQ5F2N5FFWLKEIQOU6G5IM/events.json","paper":"https://pith.science/paper/N3YZLQ5F"},"agent_actions":{"view_html":"https://pith.science/pith/N3YZLQ5F2N5FFWLKEIQOU6G5IM","download_json":"https://pith.science/pith/N3YZLQ5F2N5FFWLKEIQOU6G5IM.json","view_paper":"https://pith.science/paper/N3YZLQ5F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.2202&json=true","fetch_graph":"https://pith.science/api/pith-number/N3YZLQ5F2N5FFWLKEIQOU6G5IM/graph.json","fetch_events":"https://pith.science/api/pith-number/N3YZLQ5F2N5FFWLKEIQOU6G5IM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N3YZLQ5F2N5FFWLKEIQOU6G5IM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N3YZLQ5F2N5FFWLKEIQOU6G5IM/action/storage_attestation","attest_author":"https://pith.science/pith/N3YZLQ5F2N5FFWLKEIQOU6G5IM/action/author_attestation","sign_citation":"https://pith.science/pith/N3YZLQ5F2N5FFWLKEIQOU6G5IM/action/citation_signature","submit_replication":"https://pith.science/pith/N3YZLQ5F2N5FFWLKEIQOU6G5IM/action/replication_record"}},"created_at":"2026-05-18T02:40:47.985409+00:00","updated_at":"2026-05-18T02:40:47.985409+00:00"}