CINECA IRIS Institutional Research Information System
IRIS è la soluzione IT che facilita la raccolta e la gestione dei dati relativi alle attività e ai prodotti della ricerca. Fornisce a ricercatori, amministratori e valutatori gli strumenti per monitorare i risultati della ricerca, aumentarne la visibilità e allocare in modo efficace le risorse disponibili.
EnglishLagrangian subspaces are linear subspaces that appear naturally in control theory applications, and especially in the context of algebraic Riccati equations. In this paper, a class of semidefinite Lagrangian subspaces is introduced and it is shown that these subspaces can be represented by a subset I ⊆ 1, 2,…, n and a Hermitian matrix X ∈ ℂn×n with the property that the submatrix XII is negative semidefinite and the submatrix XIcIc is positive semidefinite. A matrix X with these definiteness properties is called I-semidefinite and it is a generalization of a quasidefinite matrix. Under mild hypotheses which hold true in most applications, the Lagrangian subspace associated to the stabilizing solution of an algebraic Riccati equation is semidefinite, and in addition it is shown that there is a bijection between Hamiltonian and symplectic pencils and semidefinite Lagrangian subspaces; hence, this structure is ubiquitous in control theory. The (symmetric) principal pivot transform (PPT) is a map used by Mehrmann and Poloni [V. Mehrmann and F. Poloni. Doubling algorithms with permuted Lagrangian graph bases. SIAM J. Matrix Anal. Appl., 33:780–805, 2012. to convert between two different pairs (I,X) and (J,X ′) representing the same Lagrangian subspace. For a semidefinite Lagrangian subspace, it is proven that the symmetric PPT of an I-semidefinite matrix X is a J -semidefinite matrix X ′, and an implementation of the transformation X → X ′ that both makes use of the definiteness properties of X and guarantees the definiteness of the submatrices of X ′ in finite arithmetic is derived. The resulting formulas are used to obtain a semidefiniteness-preserving version of an optimization algorithm introduced by Mehrmann and Poloni to compute a pair (Iopt,Xopt) with Mopt = maxi,j |(Xopt)ij | as small as possible. Using semidefiniteness allows one to obtain a stronger inequality on M with respect to the general case.
| Autori interni: | ||
| Autori: | Poloni, Federico; Strabić, Nataša | |
| Titolo: | Principal pivot transforms of quasidefinite matrices and semidefinite lagrangian subspaces | |
| Anno del prodotto: | 2016 | |
| Abstract: | Lagrangian subspaces are linear subspaces that appear naturally in control theory applications, and especially in the context of algebraic Riccati equations. In this paper, a class of semidefinite Lagrangian subspaces is introduced and it is shown that these subspaces can be represented by a subset I ⊆ 1, 2,…, n and a Hermitian matrix X ∈ ℂn×n with the property that the submatrix XII is negative semidefinite and the submatrix XIcIc is positive semidefinite. A matrix X with these definiteness properties is called I-semidefinite and it is a generalization of a quasidefinite matrix. Under mild hypotheses which hold true in most applications, the Lagrangian subspace associated to the stabilizing solution of an algebraic Riccati equation is semidefinite, and in addition it is shown that there is a bijection between Hamiltonian and symplectic pencils and semidefinite Lagrangian subspaces; hence, this structure is ubiquitous in control theory. The (symmetric) principal pivot transform (PPT) is a map used by Mehrmann and Poloni [V. Mehrmann and F. Poloni. Doubling algorithms with permuted Lagrangian graph bases. SIAM J. Matrix Anal. Appl., 33:780–805, 2012. to convert between two different pairs (I,X) and (J,X ′) representing the same Lagrangian subspace. For a semidefinite Lagrangian subspace, it is proven that the symmetric PPT of an I-semidefinite matrix X is a J -semidefinite matrix X ′, and an implementation of the transformation X → X ′ that both makes use of the definiteness properties of X and guarantees the definiteness of the submatrices of X ′ in finite arithmetic is derived. The resulting formulas are used to obtain a semidefiniteness-preserving version of an optimization algorithm introduced by Mehrmann and Poloni to compute a pair (Iopt,Xopt) with Mopt = maxi,j |(Xopt)ij | as small as possible. Using semidefiniteness allows one to obtain a stronger inequality on M with respect to the general case. | |
| Digital Object Identifier (DOI): | 10.13001/1081-3810.3132 | |
| Appare nelle tipologie: | 1.1 Articolo in rivista |
File in questo prodotto:
| File | Descrizione | Tipologia | Licenza | |
|---|---|---|---|---|
| PoloniF_798494.pdf | Documento in Pre-print | Tutti i diritti riservati (All rights reserved) | Open AccessVisualizza/Apri |
http://hdl.handle.net/11568/798494
Copyright © 2021