Complexity of computing topological degree of Lipschitz functions in n dimensions

DOI10.1016/0885-064X(86)90022-1MaRDI QIDQ578854zbMATH OpenFDO

Authors Jianyong Qiao, Sumit K. Garg

Publication date 1986

Published in Journal of Complexity (Search for Journal in Brave)

zbMATH Keywords

computational complexityLipschitz functiontopological degreelower and upper bounds

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical computation of solutions to systems of equations (65H10) Degree, winding number (55M25)

Recommendations

• An Optimal Complexity Algorithm for Computing the Topological Degree in Two Dimensions
• Computing the topological degree with noisy information
• Computing topological degree using noisy information
• Effective topological degree computation based on interval arithmetic
• Zur numerischen Bestimmung des Abbildungsgrades im \(R^ n\). II

Cites work

• scientific article; zbMATH DE number 3688714 (Why is no real title available?)
• scientific article; zbMATH DE number 3438078 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• A simplification of Stenger's topological degree formula
• An algorithm for numerical calculation of topological degree
• An efficient degree-computation method for a generalized method of bisection
• Bisection is optimal
• Complexity of computing topological degree of Lipschitz functions in n dimensions
• Computing the topological degree of a mapping in \(R^n\)
• On the construction of sufficient refinements for computation of topological degree
• Perspectives on information-based complexity

Cited in

(12)

• Computing the topological degree with noisy information
• An Optimal Complexity Algorithm for Computing the Topological Degree in Two Dimensions
• On the complexity of isolating real roots and computing with certainty the topological degree
• Complexity of computing topological degree of Lipschitz functions in n dimensions
• Computing topological degree using noisy information
• COMPUTING TWO LINCHPINS OF TOPOLOGICAL DEGREE BY A NOVEL DIFFERENTIAL EVOLUTION ALGORITHM
• Optimal solution of nonlinear equations
• Existence and computation of short-run equilibria in economic geography
• Quasi-decidability of a fragment of the first-order theory of real numbers
• Effective topological degree computation based on interval arithmetic
• Randomization for continuous problems
• ``Curse of dimensionality for complexity of approximation for classes of functions satisfying Lipschitz condition

This page was built for publication: Complexity of computing topological degree of Lipschitz functions in n dimensions

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