Open problems in computational linear algebra

DOI10.1016/J.NA.2004.12.040MaRDI QIDQ999481zbMATH OpenOpenAlexFDO

Authors J. Martínez

Publication date 4 February 2009

Published in Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.na.2004.12.040

zbMATH Keywords

optimizationcomplexityopen problemscomputational linear algebrapolynomial-time deterministic algorithm

Mathematics Subject Classification ID

Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Computational Complexity and Numerical Stability of Linear Problems
• scientific article; zbMATH DE number 4020842
• Complexity of some linear problems with interval data
• Randomization and the parallel solution of linear algebra problems
• Some computational problems in linear algebra as hard as matrix multiplication

Cites work

• scientific article; zbMATH DE number 3644821 (Why is no real title available?)
• scientific article; zbMATH DE number 3115468 (Why is no real title available?)
• scientific article; zbMATH DE number 3874496 (Why is no real title available?)
• scientific article; zbMATH DE number 1193893 (Why is no real title available?)
• scientific article; zbMATH DE number 3713095 (Why is no real title available?)
• scientific article; zbMATH DE number 714760 (Why is no real title available?)
• scientific article; zbMATH DE number 2169903 (Why is no real title available?)
• scientific article; zbMATH DE number 928863 (Why is no real title available?)
• A new polynomial-time algorithm for linear programming
• Complexity of linear programming
• Direct fail-proof triangularization algorithms for \(AX+XB=C\) with error- free and parallel implementations
• On the computational power of pushdown automata
• PRIMES is in P
• Solving linear programming problems exactly
• Stabilizing Trench's algorithm to invert symmetric Toeplitz matrices
• \(O(n^ 3)\) noniterative heuristic algorithm for linear programs with error-free implementation.

Cited in

(2)

• The bilinear complexity and practical algorithms for matrix multiplication
• scientific article; zbMATH DE number 1583868 (Why is no real title available?)

This page was built for publication: Open problems in computational linear algebra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q999481)