• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

Lower bounds for the low-rank matrix approximation.

作者信息

Li Jicheng, Liu Zisheng, Li Guo

机构信息

School of Mathematics and Statistics, Xi'an Jiaotong University, No. 28, Xianning West Road, Xi'an, 710049 China.

School of Statistics, Henan University of Economics and Law, No. 180, Jinshui East Road, Zhengzhou, 450046 China.

出版信息

J Inequal Appl. 2017;2017(1):288. doi: 10.1186/s13660-017-1564-z. Epub 2017 Nov 21.

DOI:10.1186/s13660-017-1564-z
PMID:29200797
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC5696467/
Abstract

Low-rank matrix recovery is an active topic drawing the attention of many researchers. It addresses the problem of approximating the observed data matrix by an unknown low-rank matrix. Suppose that is a low-rank matrix approximation of , where and are [Formula: see text] matrices. Based on a useful decomposition of [Formula: see text], for the unitarily invariant norm [Formula: see text], when [Formula: see text] and [Formula: see text], two sharp lower bounds of [Formula: see text] are derived respectively. The presented simulations and applications demonstrate our results when the approximation matrix is low-rank and the perturbation matrix is sparse.

摘要
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2f34/5696467/56e80ad21a45/13660_2017_1564_Fig2_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2f34/5696467/48c5444288c5/13660_2017_1564_Figa_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2f34/5696467/0cf4234bf64c/13660_2017_1564_Fig1_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2f34/5696467/56e80ad21a45/13660_2017_1564_Fig2_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2f34/5696467/48c5444288c5/13660_2017_1564_Figa_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2f34/5696467/0cf4234bf64c/13660_2017_1564_Fig1_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2f34/5696467/56e80ad21a45/13660_2017_1564_Fig2_HTML.jpg

相似文献

1
Lower bounds for the low-rank matrix approximation.
J Inequal Appl. 2017;2017(1):288. doi: 10.1186/s13660-017-1564-z. Epub 2017 Nov 21.
2
Approximating the Little Grothendieck Problem over the Orthogonal and Unitary Groups.关于正交群和酉群的小格罗滕迪克问题的逼近
Math Program. 2016 Nov;160(1):433-475. doi: 10.1007/s10107-016-0993-7. Epub 2016 Mar 25.
3
Bounds for the norm of lower triangular matrices on the Cesàro weighted sequence space.切萨罗加权序列空间上三角矩阵范数的界
J Inequal Appl. 2017;2017(1):67. doi: 10.1186/s13660-017-1339-6. Epub 2017 Apr 4.
4
Extensions of interpolation between the arithmetic-geometric mean inequality for matrices.矩阵算术 - 几何平均不等式之间插值的扩展。
J Inequal Appl. 2017;2017(1):209. doi: 10.1186/s13660-017-1485-x. Epub 2017 Sep 7.
5
Near-optimal matrix recovery from random linear measurements.随机线性测量的近最优矩阵恢复。
Proc Natl Acad Sci U S A. 2018 Jul 10;115(28):7200-7205. doi: 10.1073/pnas.1705490115. Epub 2018 Jun 25.
6
The lower bounds for the rank of matrices and some sufficient conditions for nonsingular matrices.矩阵秩的下界及非奇异矩阵的一些充分条件。
J Inequal Appl. 2017;2017(1):171. doi: 10.1186/s13660-017-1446-4. Epub 2017 Jul 20.
7
The solvability conditions for the inverse eigenvalue problem of normal skew -Hamiltonian matrices.正规斜哈密顿矩阵逆特征值问题的可解性条件
J Inequal Appl. 2018;2018(1):74. doi: 10.1186/s13660-018-1667-1. Epub 2018 Apr 4.
8
On maximum likelihood estimation of the concentration parameter of von Mises-Fisher distributions.关于冯·米塞斯-费舍尔分布浓度参数的最大似然估计
Comput Stat. 2014;29(5):945-957. doi: 10.1007/s00180-013-0471-0. Epub 2013 Dec 13.
9
Rank-One Matrix Completion With Automatic Rank Estimation via L1-Norm Regularization.通过L1范数正则化进行具有自动秩估计的一阶矩阵补全
IEEE Trans Neural Netw Learn Syst. 2018 Oct;29(10):4744-4757. doi: 10.1109/TNNLS.2017.2766160. Epub 2017 Dec 11.
10
A fast indirect method to compute functions of genomic relationships concerning genotyped and ungenotyped individuals, for diversity management.一种快速的间接方法,用于计算与已基因型和未基因型个体有关的基因组关系的函数,用于多样性管理。
Genet Sel Evol. 2017 Dec 1;49(1):87. doi: 10.1186/s12711-017-0363-9.

本文引用的文献

1
Recovering the missing components in a large noisy low-rank matrix: application to SFM.恢复大型含噪低秩矩阵中的缺失分量:在结构从运动中的应用
IEEE Trans Pattern Anal Mach Intell. 2004 Aug;26(8):1051-63. doi: 10.1109/TPAMI.2004.52.