On Symmetric Factorizations of Hankel Matrices

被引：0
|
作者：
Ghadiri, Mehrdad [1 ]
机构：
[1] Georgia Tech, Sch Comp Sci, Atlanta, GA 30332 USA
来源：
2023 IEEE 64TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, FOCS | 2023年
关键词：
component; formatting; style; styling; insert; TOEPLITZ; SUPERFAST; SOLVER; MULTIPLICATION; SYSTEMS;
D O I：
10.1109/FOCS57990.2023.00127
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We present two conjectures regarding the running time of computing symmetric factorizations for a Hankel matrix H and its inverse H-1 as BB* under fixed-point arithmetic. If solved, these would result in a faster-than-matrix-multiplication algorithm for solving sparse poly-conditioned linear programming problems, a fundamental problem in optimization and theoretical computer science. To justify our proposed conjectures and running times, we show weaker results of computing decompositions of the form BB* - CC* for Hankel matrices and their inverses with the same running time.
引用
收藏
页码：2081 / 2092
页数：12
相关论文
共 50 条
12345