Optimal sequential and parallel search for finding a root

DOI10.1016/0097-3165(77)90074-7zbMATH Open0383.65025OpenAlexW2088089273MaRDI QIDQ1248895FDOQ1248895

Authors: Shmuel Gal, Willard L. Miranker 

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)

Cites Work

• Title not available (Why is that?)
• Sequential Minimax Search for a Maximum
• Location of the Maximum on Unimodal Surfaces
• High Order Search Methods for Finding Roots
• Sequential Minimax Search for a Zero of a Convex Function
• Parallel minimax search for a maximum
• Sequential Minimax Search for a Maximum When Prior Information is Available
• Title not available (Why is that?)
• Title not available (Why is that?)
• Multidimensional Minimax Search for a Maximum

Cited In (2)

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

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

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