Optimal sequential and parallel search for finding a root

DOI10.1016/0097-3165(77)90074-7MaRDI QIDQ1248895zbMATH OpenOpenAlexFDO

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

• scientific article; zbMATH DE number 3174053 (Why is no real title available?)
• scientific article; zbMATH DE number 3265438 (Why is no real title available?)
• scientific article; zbMATH DE number 3318215 (Why is no real title available?)
• High Order Search Methods for Finding Roots
• Location of the Maximum on Unimodal Surfaces
• Multidimensional Minimax Search for a Maximum
• Parallel minimax search for a maximum
• Sequential Minimax Search for a Maximum
• Sequential Minimax Search for a Maximum When Prior Information is Available
• Sequential Minimax Search for a Zero of a Convex Function

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)