{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GUPNM4JGU7SK6NFU7F36TM6EJK","short_pith_number":"pith:GUPNM4JG","schema_version":"1.0","canonical_sha256":"351ed67126a7e4af34b4f977e9b3c44ab29e37fffb9f2b7b80dccaad4be437a7","source":{"kind":"arxiv","id":"1802.08033","version":3},"attestation_state":"computed","paper":{"title":"Approximating the nearest stable discrete-time system","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.OC","authors_text":"Michael Karow, Nicolas Gillis, Punit Sharma","submitted_at":"2018-02-22T13:29:48Z","abstract_excerpt":"In this paper, we consider the problem of stabilizing discrete-time linear systems by computing a nearby stable matrix to an unstable one. To do so, we provide a new characterization for the set of stable matrices. We show that a matrix $A$ is stable if and only if it can be written as $A=S^{-1}UBS$, where $S$ is positive definite, $U$ is orthogonal, and $B$ is a positive semidefinite contraction (that is, the singular values of $B$ are less or equal to 1). This characterization results in an equivalent non-convex optimization problem with a feasible set on which it is easy to project. We prop"},"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":"1802.08033","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-22T13:29:48Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"2770391b42c7bf4c26027332733e3fe50250830970f04b41eaf785347a92305c","abstract_canon_sha256":"4d55791cc63b842104207ee425d295ce87513bcba54dc2cf491eabdf4e70aaaa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:59.722678Z","signature_b64":"oCKPhOsAaf1Cw4QQSuE3m0Lf4X2mf9LCS2po2xjxNTLAZtUSulFemGW0wnAK04+YVTrAzvqyeZZlSDaP6ZH9Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"351ed67126a7e4af34b4f977e9b3c44ab29e37fffb9f2b7b80dccaad4be437a7","last_reissued_at":"2026-05-17T23:49:59.722072Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:59.722072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating the nearest stable discrete-time system","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.OC","authors_text":"Michael Karow, Nicolas Gillis, Punit Sharma","submitted_at":"2018-02-22T13:29:48Z","abstract_excerpt":"In this paper, we consider the problem of stabilizing discrete-time linear systems by computing a nearby stable matrix to an unstable one. To do so, we provide a new characterization for the set of stable matrices. We show that a matrix $A$ is stable if and only if it can be written as $A=S^{-1}UBS$, where $S$ is positive definite, $U$ is orthogonal, and $B$ is a positive semidefinite contraction (that is, the singular values of $B$ are less or equal to 1). This characterization results in an equivalent non-convex optimization problem with a feasible set on which it is easy to project. We prop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08033","kind":"arxiv","version":3},"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":"1802.08033","created_at":"2026-05-17T23:49:59.722145+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.08033v3","created_at":"2026-05-17T23:49:59.722145+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08033","created_at":"2026-05-17T23:49:59.722145+00:00"},{"alias_kind":"pith_short_12","alias_value":"GUPNM4JGU7SK","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GUPNM4JGU7SK6NFU","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GUPNM4JG","created_at":"2026-05-18T12:32:25.280505+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/GUPNM4JGU7SK6NFU7F36TM6EJK","json":"https://pith.science/pith/GUPNM4JGU7SK6NFU7F36TM6EJK.json","graph_json":"https://pith.science/api/pith-number/GUPNM4JGU7SK6NFU7F36TM6EJK/graph.json","events_json":"https://pith.science/api/pith-number/GUPNM4JGU7SK6NFU7F36TM6EJK/events.json","paper":"https://pith.science/paper/GUPNM4JG"},"agent_actions":{"view_html":"https://pith.science/pith/GUPNM4JGU7SK6NFU7F36TM6EJK","download_json":"https://pith.science/pith/GUPNM4JGU7SK6NFU7F36TM6EJK.json","view_paper":"https://pith.science/paper/GUPNM4JG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.08033&json=true","fetch_graph":"https://pith.science/api/pith-number/GUPNM4JGU7SK6NFU7F36TM6EJK/graph.json","fetch_events":"https://pith.science/api/pith-number/GUPNM4JGU7SK6NFU7F36TM6EJK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GUPNM4JGU7SK6NFU7F36TM6EJK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GUPNM4JGU7SK6NFU7F36TM6EJK/action/storage_attestation","attest_author":"https://pith.science/pith/GUPNM4JGU7SK6NFU7F36TM6EJK/action/author_attestation","sign_citation":"https://pith.science/pith/GUPNM4JGU7SK6NFU7F36TM6EJK/action/citation_signature","submit_replication":"https://pith.science/pith/GUPNM4JGU7SK6NFU7F36TM6EJK/action/replication_record"}},"created_at":"2026-05-17T23:49:59.722145+00:00","updated_at":"2026-05-17T23:49:59.722145+00:00"}