HOW TO DECREASE THE COMBINATORY COMPLEXITY

DOI10.1515/dema-1978-0322zbMath0395.65015OpenAlexW2782891610MaRDI QIDQ4178396

Jerzy Trojan

Publication date: 1978

Published in: Demonstratio Mathematica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dema-1978-0322

zbMATH Keywords

Iterative MethodsComputationalAnalytic FunctionComplexity of AlgorithmsMinimizing the CostSolution of Nonlinear Equation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05)

Related Items

Tight bounds on the complexity index of one-point iterations