parehermite矩阵EVD解析特征值的迭代逼近

Stephan Weiss, I. Proudler, Fraser K. Coutts, J. Pestana
{"title":"parehermite矩阵EVD解析特征值的迭代逼近","authors":"Stephan Weiss, I. Proudler, Fraser K. Coutts, J. Pestana","doi":"10.1109/ICASSP.2019.8682407","DOIUrl":null,"url":null,"abstract":"We present an algorithm that extracts analytic eigenvalues from a parahermitian matrix. Operating in the discrete Fourier transform domain, an inner iteration re-establishes the lost association between bins via a maximum likelihood sequence detection driven by a smoothness criterion. An outer iteration continues until a desired accuracy for the approximation of the extracted eigenvalues has been achieved. The approach is compared to existing algorithms.","PeriodicalId":13203,"journal":{"name":"ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","volume":"160 1","pages":"8038-8042"},"PeriodicalIF":0.0000,"publicationDate":"2019-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Iterative Approximation of Analytic Eigenvalues of a Parahermitian Matrix EVD\",\"authors\":\"Stephan Weiss, I. Proudler, Fraser K. Coutts, J. Pestana\",\"doi\":\"10.1109/ICASSP.2019.8682407\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present an algorithm that extracts analytic eigenvalues from a parahermitian matrix. Operating in the discrete Fourier transform domain, an inner iteration re-establishes the lost association between bins via a maximum likelihood sequence detection driven by a smoothness criterion. An outer iteration continues until a desired accuracy for the approximation of the extracted eigenvalues has been achieved. The approach is compared to existing algorithms.\",\"PeriodicalId\":13203,\"journal\":{\"name\":\"ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)\",\"volume\":\"160 1\",\"pages\":\"8038-8042\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-05-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICASSP.2019.8682407\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICASSP.2019.8682407","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

摘要

提出了一种从parparhertian矩阵中提取解析特征值的算法。在离散傅里叶变换域中操作,内部迭代通过平滑准则驱动的最大似然序列检测重新建立箱之间丢失的关联。外部迭代继续进行,直到所提取的特征值的近似值达到所需的精度。将该方法与现有算法进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Iterative Approximation of Analytic Eigenvalues of a Parahermitian Matrix EVD
We present an algorithm that extracts analytic eigenvalues from a parahermitian matrix. Operating in the discrete Fourier transform domain, an inner iteration re-establishes the lost association between bins via a maximum likelihood sequence detection driven by a smoothness criterion. An outer iteration continues until a desired accuracy for the approximation of the extracted eigenvalues has been achieved. The approach is compared to existing algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信