Hadamard积谱半径的新估计

Qin Zhong, Chunyan Zhao, Xin Zhou, Y. Wang, Ling Li
{"title":"Hadamard积谱半径的新估计","authors":"Qin Zhong, Chunyan Zhao, Xin Zhou, Y. Wang, Ling Li","doi":"10.1117/12.2671104","DOIUrl":null,"url":null,"abstract":"For the Hadamard product of the matrices with non-negative entries, we study the new upper bound for the spectral radius by applying the characteristic value containing the domain theorem. This estimating formula only involves the entries of two non-negative matrices. Hence, the upper bound is easy to calculate in practical examples. An example is considered to illustrate our results.","PeriodicalId":227528,"journal":{"name":"International Conference on Artificial Intelligence and Computer Engineering (ICAICE 2022)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"New estimation for spectral radius of Hadamard product\",\"authors\":\"Qin Zhong, Chunyan Zhao, Xin Zhou, Y. Wang, Ling Li\",\"doi\":\"10.1117/12.2671104\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For the Hadamard product of the matrices with non-negative entries, we study the new upper bound for the spectral radius by applying the characteristic value containing the domain theorem. This estimating formula only involves the entries of two non-negative matrices. Hence, the upper bound is easy to calculate in practical examples. An example is considered to illustrate our results.\",\"PeriodicalId\":227528,\"journal\":{\"name\":\"International Conference on Artificial Intelligence and Computer Engineering (ICAICE 2022)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-04-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Artificial Intelligence and Computer Engineering (ICAICE 2022)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1117/12.2671104\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Artificial Intelligence and Computer Engineering (ICAICE 2022)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.2671104","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

对于非负项矩阵的Hadamard积,应用包含定义域定理的特征值,研究了谱半径的新上界。这个估计公式只涉及两个非负矩阵的元素。因此,上界在实际算例中很容易计算。通过一个例子来说明我们的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
New estimation for spectral radius of Hadamard product
For the Hadamard product of the matrices with non-negative entries, we study the new upper bound for the spectral radius by applying the characteristic value containing the domain theorem. This estimating formula only involves the entries of two non-negative matrices. Hence, the upper bound is easy to calculate in practical examples. An example is considered to illustrate our results.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Hippocampus MRI diagnosis based on deep learning in application of preliminary screening of Alzheimer’s disease Global critic and local actor for campaign-tactic combat management in the joint operation simulation software Intelligent monitoring system of oil tank liquid level based on infrared thermal imaging Chinese named entity recognition incorporating syntactic information Object tracking based on foreground adaptive bounding box and motion state redetection
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1