{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:T3LE46WAEVDA3DMN6FZ7HGRR4U","short_pith_number":"pith:T3LE46WA","schema_version":"1.0","canonical_sha256":"9ed64e7ac025460d8d8df173f39a31e51ce2f285e5c5fcc8c78ad031fc61dc41","source":{"kind":"arxiv","id":"1907.06537","version":4},"attestation_state":"computed","paper":{"title":"Computing the Kreiss Constant of a Matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Tim Mitchell","submitted_at":"2019-07-15T15:05:10Z","abstract_excerpt":"We establish the first globally convergent algorithms for computing the Kreiss constant of a matrix to arbitrary accuracy. We propose three different iterations for continuous-time Kreiss constants and analogues for discrete-time Kreiss constants. With standard eigensolvers, the methods do $\\mathcal{O}(n^6)$ work, but we show how this theoretical work complexity can be lowered to $\\mathcal{O}(n^4)$ on average and $\\mathcal{O}(n^5)$ in the worst case via divide-and-conquer variants. Finally, locally optimal Kreiss constant approximations can be efficiently obtained for large-scale matrices via "},"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":"1907.06537","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-15T15:05:10Z","cross_cats_sorted":[],"title_canon_sha256":"b0018cfe78d51f8a9d9d3e6869d9b819df69c0eb9af2ad288ed12854a9d42eb1","abstract_canon_sha256":"707db87d0575f0bdab269ac433dc75a4b8b6c0fe94f173fd6e014014bfd23245"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:01:09.471500Z","signature_b64":"M3hrcUp+L4hCF7z76FsTiJ6s6V3nMCofm3+Hl1PVyV22JYBVCAe8Y3pCRF7AGorOqKvpPa04IQ/7ZsFuCqegBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ed64e7ac025460d8d8df173f39a31e51ce2f285e5c5fcc8c78ad031fc61dc41","last_reissued_at":"2026-07-05T02:01:09.471117Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:01:09.471117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing the Kreiss Constant of a Matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Tim Mitchell","submitted_at":"2019-07-15T15:05:10Z","abstract_excerpt":"We establish the first globally convergent algorithms for computing the Kreiss constant of a matrix to arbitrary accuracy. We propose three different iterations for continuous-time Kreiss constants and analogues for discrete-time Kreiss constants. With standard eigensolvers, the methods do $\\mathcal{O}(n^6)$ work, but we show how this theoretical work complexity can be lowered to $\\mathcal{O}(n^4)$ on average and $\\mathcal{O}(n^5)$ in the worst case via divide-and-conquer variants. Finally, locally optimal Kreiss constant approximations can be efficiently obtained for large-scale matrices via "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.06537","kind":"arxiv","version":4},"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/1907.06537/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":"1907.06537","created_at":"2026-07-05T02:01:09.471169+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.06537v4","created_at":"2026-07-05T02:01:09.471169+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.06537","created_at":"2026-07-05T02:01:09.471169+00:00"},{"alias_kind":"pith_short_12","alias_value":"T3LE46WAEVDA","created_at":"2026-07-05T02:01:09.471169+00:00"},{"alias_kind":"pith_short_16","alias_value":"T3LE46WAEVDA3DMN","created_at":"2026-07-05T02:01:09.471169+00:00"},{"alias_kind":"pith_short_8","alias_value":"T3LE46WA","created_at":"2026-07-05T02:01:09.471169+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/T3LE46WAEVDA3DMN6FZ7HGRR4U","json":"https://pith.science/pith/T3LE46WAEVDA3DMN6FZ7HGRR4U.json","graph_json":"https://pith.science/api/pith-number/T3LE46WAEVDA3DMN6FZ7HGRR4U/graph.json","events_json":"https://pith.science/api/pith-number/T3LE46WAEVDA3DMN6FZ7HGRR4U/events.json","paper":"https://pith.science/paper/T3LE46WA"},"agent_actions":{"view_html":"https://pith.science/pith/T3LE46WAEVDA3DMN6FZ7HGRR4U","download_json":"https://pith.science/pith/T3LE46WAEVDA3DMN6FZ7HGRR4U.json","view_paper":"https://pith.science/paper/T3LE46WA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.06537&json=true","fetch_graph":"https://pith.science/api/pith-number/T3LE46WAEVDA3DMN6FZ7HGRR4U/graph.json","fetch_events":"https://pith.science/api/pith-number/T3LE46WAEVDA3DMN6FZ7HGRR4U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T3LE46WAEVDA3DMN6FZ7HGRR4U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T3LE46WAEVDA3DMN6FZ7HGRR4U/action/storage_attestation","attest_author":"https://pith.science/pith/T3LE46WAEVDA3DMN6FZ7HGRR4U/action/author_attestation","sign_citation":"https://pith.science/pith/T3LE46WAEVDA3DMN6FZ7HGRR4U/action/citation_signature","submit_replication":"https://pith.science/pith/T3LE46WAEVDA3DMN6FZ7HGRR4U/action/replication_record"}},"created_at":"2026-07-05T02:01:09.471169+00:00","updated_at":"2026-07-05T02:01:09.471169+00:00"}