{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LEQIBGZI4ZZK4W3YHUOHN24RKQ","short_pith_number":"pith:LEQIBGZI","schema_version":"1.0","canonical_sha256":"5920809b28e672ae5b783d1c76eb915433761e884baf8fbe306da6bb9e28a5b5","source":{"kind":"arxiv","id":"1507.02100","version":2},"attestation_state":"computed","paper":{"title":"Iterative methods for the delay Lyapunov equation with T-Sylvester preconditioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Elias Jarlebring, Federico Poloni","submitted_at":"2015-07-08T11:22:36Z","abstract_excerpt":"The delay Lyapunov equation is an important matrix boundary-value problem which arises as an analogue of the Lyapunov equation in the study of time-delay systems $\\dot{x}(t) = A_0x(t)+A_1x(t-\\tau)+B_0u(t)$. We propose a new algorithm for the solution of the delay Lyapunov equation. Our method is based on the fact that the delay Lyapunov equation can be expressed as a linear system of equations, whose unknown is the value $U(\\tau/2)\\in\\mathbb{R}^{n\\times n}$, i.e., the delay Lyapunov matrix at time $\\tau/2$. This linear matrix equation with $n^2$ unknowns is solved by adapting a preconditioned "},"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":"1507.02100","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-07-08T11:22:36Z","cross_cats_sorted":[],"title_canon_sha256":"a4bd87807ec885e5cb235bf680cd6c8a754f09edae9278ce5c08e76ffce47bd9","abstract_canon_sha256":"570d28d5ef78e8bf5552f558fab90211ddee86a18c014bbff04a51474f9350ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:26.515192Z","signature_b64":"VugdMu3MCphQTRdD2hxXhihoO7mrpOjQJQ1IiqBCwlNPQiQDHOPxasDmYby6jt/C5pc03mZX104fpynJXbMDCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5920809b28e672ae5b783d1c76eb915433761e884baf8fbe306da6bb9e28a5b5","last_reissued_at":"2026-05-18T00:03:26.514665Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:26.514665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iterative methods for the delay Lyapunov equation with T-Sylvester preconditioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Elias Jarlebring, Federico Poloni","submitted_at":"2015-07-08T11:22:36Z","abstract_excerpt":"The delay Lyapunov equation is an important matrix boundary-value problem which arises as an analogue of the Lyapunov equation in the study of time-delay systems $\\dot{x}(t) = A_0x(t)+A_1x(t-\\tau)+B_0u(t)$. We propose a new algorithm for the solution of the delay Lyapunov equation. Our method is based on the fact that the delay Lyapunov equation can be expressed as a linear system of equations, whose unknown is the value $U(\\tau/2)\\in\\mathbb{R}^{n\\times n}$, i.e., the delay Lyapunov matrix at time $\\tau/2$. This linear matrix equation with $n^2$ unknowns is solved by adapting a preconditioned "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02100","kind":"arxiv","version":2},"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":"1507.02100","created_at":"2026-05-18T00:03:26.514755+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.02100v2","created_at":"2026-05-18T00:03:26.514755+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02100","created_at":"2026-05-18T00:03:26.514755+00:00"},{"alias_kind":"pith_short_12","alias_value":"LEQIBGZI4ZZK","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LEQIBGZI4ZZK4W3Y","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LEQIBGZI","created_at":"2026-05-18T12:29:29.992203+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/LEQIBGZI4ZZK4W3YHUOHN24RKQ","json":"https://pith.science/pith/LEQIBGZI4ZZK4W3YHUOHN24RKQ.json","graph_json":"https://pith.science/api/pith-number/LEQIBGZI4ZZK4W3YHUOHN24RKQ/graph.json","events_json":"https://pith.science/api/pith-number/LEQIBGZI4ZZK4W3YHUOHN24RKQ/events.json","paper":"https://pith.science/paper/LEQIBGZI"},"agent_actions":{"view_html":"https://pith.science/pith/LEQIBGZI4ZZK4W3YHUOHN24RKQ","download_json":"https://pith.science/pith/LEQIBGZI4ZZK4W3YHUOHN24RKQ.json","view_paper":"https://pith.science/paper/LEQIBGZI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.02100&json=true","fetch_graph":"https://pith.science/api/pith-number/LEQIBGZI4ZZK4W3YHUOHN24RKQ/graph.json","fetch_events":"https://pith.science/api/pith-number/LEQIBGZI4ZZK4W3YHUOHN24RKQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LEQIBGZI4ZZK4W3YHUOHN24RKQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LEQIBGZI4ZZK4W3YHUOHN24RKQ/action/storage_attestation","attest_author":"https://pith.science/pith/LEQIBGZI4ZZK4W3YHUOHN24RKQ/action/author_attestation","sign_citation":"https://pith.science/pith/LEQIBGZI4ZZK4W3YHUOHN24RKQ/action/citation_signature","submit_replication":"https://pith.science/pith/LEQIBGZI4ZZK4W3YHUOHN24RKQ/action/replication_record"}},"created_at":"2026-05-18T00:03:26.514755+00:00","updated_at":"2026-05-18T00:03:26.514755+00:00"}