HOW TO DECREASE THE COMBINATORY COMPLEXITY

DOI10.1515/DEMA-1978-0322MaRDI QIDQ4178396zbMATH OpenOpenAlexFDO

Authors Jerzy Trojan

Publication date 1978

Published in Demonstratio Mathematica (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

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

zbMATH Keywords

Analytic FunctionComplexity of AlgorithmsComputationalIterative MethodsMinimizing the CostSolution of Nonlinear Equation

Mathematics Subject Classification ID

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) Analysis of algorithms and problem complexity (68Q25)

Cited in

(1)

• Tight bounds on the complexity index of one-point iterations

This page was built for publication: HOW TO DECREASE THE COMBINATORY COMPLEXITY

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