{"title":"半正定矩阵的辛特征值与迹极小化定理","authors":"N. T. Son, T. Stykel","doi":"10.13001/ela.2022.7351","DOIUrl":null,"url":null,"abstract":"Symplectic eigenvalues are conventionally defined for symmetric positive-definite matrices via Williamson's diagonal form. Many properties of standard eigenvalues, including the trace minimization theorem, have been extended to the case of symplectic eigenvalues. In this note, we will generalize Williamson's diagonal form for symmetric positive-definite matrices to the case of symmetric positive-semidefinite matrices, which allows us to define symplectic eigenvalues, and prove the trace minimization theorem in the new setting.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Symplectic eigenvalues of positive-semidefinite matrices and the trace minimization theorem\",\"authors\":\"N. T. Son, T. Stykel\",\"doi\":\"10.13001/ela.2022.7351\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Symplectic eigenvalues are conventionally defined for symmetric positive-definite matrices via Williamson's diagonal form. Many properties of standard eigenvalues, including the trace minimization theorem, have been extended to the case of symplectic eigenvalues. In this note, we will generalize Williamson's diagonal form for symmetric positive-definite matrices to the case of symmetric positive-semidefinite matrices, which allows us to define symplectic eigenvalues, and prove the trace minimization theorem in the new setting.\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2022-08-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.13001/ela.2022.7351\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.13001/ela.2022.7351","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Symplectic eigenvalues of positive-semidefinite matrices and the trace minimization theorem
Symplectic eigenvalues are conventionally defined for symmetric positive-definite matrices via Williamson's diagonal form. Many properties of standard eigenvalues, including the trace minimization theorem, have been extended to the case of symplectic eigenvalues. In this note, we will generalize Williamson's diagonal form for symmetric positive-definite matrices to the case of symmetric positive-semidefinite matrices, which allows us to define symplectic eigenvalues, and prove the trace minimization theorem in the new setting.