On the efficiency of algorithms of analysis
DOI10.1090/S0273-0979-1985-15391-1zbMath0592.65032MaRDI QIDQ3721699
Publication date: 1985
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
computational complexity; Newton's method; well-posed linear systems; efficiency of linear programming; efficient zero finding; von Neumann-Wilkinson condition number
68Q25: Analysis of algorithms and problem complexity
65K05: Numerical mathematical programming methods
65J05: General theory of numerical analysis in abstract spaces
65H10: Numerical computation of solutions to systems of equations
90C05: Linear programming
65-02: Research exposition (monographs, survey articles) pertaining to numerical analysis
65F10: Iterative numerical methods for linear systems
68W99: Algorithms in computer science
Related Items