Operator Scaling: Theory and Applications

In this paper, we present a deterministic polynomial time algorithm for testing whether a symbolic matrix in non-commuting variables over Q is invertible or not. The analogous question for commuting variables is the celebrated polynomial identity testing (PIT) for symbolic determinants. In contrast...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Foundations of computational mathematics 2020-04, Vol.20 (2), p.223-290
Hauptverfasser:	Garg, Ankit, Gurvits, Leonid, Oliveira, Rafael, Wigderson, Avi
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applications of Mathematics Approximation Commuting Complexity Computer Science Economics Information theory Linear algebra Linear and Multilinear Algebras Lower bounds Math Applications in Computer Science Mathematical research Mathematics Mathematics and Statistics Matrices Matrices (mathematics) Matrix Theory Numerical Analysis Operators (mathematics) Optimization Polynomials Quantum computing Quantum phenomena Questions System theory Systems theory Variables (Mathematics)
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!