Optimal sequential and parallel search for finding a root

DOI10.1016/0097-3165(77)90074-7zbMath0383.65025OpenAlexW2088089273MaRDI QIDQ1248895

Willard L. Miranker, Shmuel Gal

Publication date: 1977

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(77)90074-7

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Numerical computation of solutions to single equations (65H05)

Related Items (2)

A parallel root-finding algorithm ⋮ Parallel methods for solving equations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• High Order Search Methods for Finding Roots
• Location of the Maximum on Unimodal Surfaces
• Parallel minimax search for a maximum
• Sequential Minimax Search for a Maximum When Prior Information is Available
• Multidimensional Minimax Search for a Maximum
• Sequential Minimax Search for a Zero of a Convex Function
• Sequential Minimax Search for a Maximum

This page was built for publication: Optimal sequential and parallel search for finding a root