On a norm compression inequality for <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mrow><mml:mn>2</mml:mn><mml:mo>×</mml:mo><mml:mi>N</mml:mi></mml:mrow></mml:math> partitioned block matrices-Reference-Cited by-同舟云学术

On a norm compression inequality for 2×N partitioned block matrices

Author:

Audenaert Koenraad M.R.

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Geometry and Topology,Numerical Analysis,Algebra and Number Theory

Reference11 articles.

1. Matrix Analysis;Bhatia,1997

2. Matrix Analysis;Horn,1985

3. Topics in Matrix Analysis;Horn,1991

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

3. Low-rank approximation with 1/ ^1/3 matrix-vector products;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09