The coordinex problem and its relation to the conjecture of Wilkinson

DOI10.1007/BF01389574zbMath0522.65016OpenAlexW1982046575WikidataQ122917737 ScholiaQ122917737MaRDI QIDQ1056193

Heinrich Puschmann, Joaquín A. Cortés

Publication date: 1983

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/132877

zbMATH Keywords

Gauss eliminationrounding errorsorthogonal matricescomplete pivoting strategyconjecture of Wilkinsoncoordinex problemGaussian matrix decomposition

Mathematics Subject Classification ID

Factorization of matrices (15A23) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

Zwei unzulässige Verstärkungen der Vermutung von Wilkinson. (Two inadmissible amplifications of Wilkinson's conjecture), On the complexity of some basic problems in computational convexity. I. Containment problems, Largest \(j\)-simplices in \(d\)-cubes: Some relatives of the Hadamard maximum determinant problem

Cites Work

• Unnamed Item
• Pivot size in Gaussian elimination
• Optimally conditioned optimization algorithms without line searches
• On Orthogonal Matrices