Open problems in computational linear algebra
type: Item
instance of: scholarly article
title: Open problems in computational linear algebra
zbMATH Open document ID: 1153.90588
author: J. Martínez
published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods
publication date: 2009-02-04T00:00:00Z
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 5502620
zbMATH Keywords: computational linear algebra
zbMATH Keywords: open problems
zbMATH Keywords: optimization
zbMATH Keywords: complexity
zbMATH Keywords: polynomial-time deterministic algorithm
MaRDI profile type: Publication
full work available at URL: j.na.2004.12.040
OpenAlex ID: W1967066916
cites work: PRIMES is in P
cites work: On the computational power of pushdown automata
cites work: Q3229788
cites work: Q4893755
cites work: Q3340031
cites work: Q3842088
cites work: A new polynomial-time algorithm for linear programming
cites work: Q3050157
cites work: \(O(n^ 3)\) noniterative heuristic algorithm for linear programs with error-free implementation.
cites work: Solving linear programming problems exactly
cites work: Stabilizing Trench's algorithm to invert symmetric Toeplitz matrices
cites work: Q4677321
cites work: Direct fail-proof triangularization algorithms for \(AX+XB=C\) with error- free and parallel implementations
cites work: Q3903959
cites work: Q4321732
cites work: Complexity of linear programming
DOI: 10.1016/J.NA.2004.12.040
description: scientific article; zbMATH DE number 5502620