Book chapter · 2017
Root Finding and Optimization
Chapman & Hall/CRC eBooks, 175–211 · Published 12 July 2017 · DOI 10.1201/9781315120195-6
In brief
“Root Finding and Optimization” is a 2017 book chapter by James P. Howard, published in Chapman & Hall/CRC eBooks. OpenAlex counts 0 citations as of 19 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.
- Citations
- 0
- Authors
- 1
Abstract
Root finding and optimization are closely related problems. This chapter seeks solutions to functions, linear and nonlinear, that meet some requirement. It begins with the most elementary, the bisection method, which resembles a children's game. The chapter looks at the Newton–Raphson method, an iterative approach that uses the derivative to estimate a better result for… Read the full abstract at the publisher.
Excerpt. This paper is not open access.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Howard, J. P. (2017). Root Finding and Optimization. Chapman & Hall/CRC eBooks, 175–211. https://doi.org/10.1201/9781315120195-6
MLA 9
Howard, James P. “Root Finding and Optimization.” Chapman & Hall/CRC eBooks, 2017, pp. 175–211. https://doi.org/10.1201/9781315120195-6.
Chicago
Howard, James P. 2017. “Root Finding and Optimization.” Chapman & Hall/CRC eBooks: 175–211. https://doi.org/10.1201/9781315120195-6.
Harvard
Howard, J. P. (2017) ‘Root Finding and Optimization’, Chapman & Hall/CRC eBooks, pp. 175–211. doi:10.1201/9781315120195-6.
IEEE
J. P. Howard, “Root Finding and Optimization,” Chapman & Hall/CRC eBooks, pp. 175–211, 2017, doi: 10.1201/9781315120195-6.
BibTeX
@incollection{howard2017root,
title = {{Root Finding and Optimization}},
author = {Howard, James P.},
booktitle = {Chapman \& Hall/CRC eBooks},
publisher = {Informa},
year = {2017},
pages = {175--211},
doi = {10.1201/9781315120195-6},
url = {https://doi.org/10.1201/9781315120195-6}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Mathematics › Numerical Analysis › Iterative Methods for Nonlinear Equations
- root finding
- function minimization
- bisection method
- Newton's method
- secant method
- bracketing method
- gradient descent
- golden section search
Work with this paper
Most-cited papers in Mathematics
- Random ForestsLeo Breiman · Machine Learning · 2001 · 142,830 citations
- Controlling the False Discovery Rate: A Practical and Powerful Approach to Multiple TestingYoav Benjamini, Yosef Hochberg · Journal of the Royal Statistical Society Series B (Statistical Methodology) · 1995 · 113,923 citations
- Fitting Linear Mixed-Effects Models Using lme4Douglas M. Bates, Martin Maechler, Benjamin M. Bolker and 1 more · Journal of Statistical Software · 2015 · 100,328 citations
- The moderator-mediator variable distinction in social psychological research: Conceptual, strategic, and statistical considerations.Reuben M. Baron, David A. Kenny · Journal of Personality and Social Psychology · 1986 · 95,866 citations
- Using multivariate statisticsBarbara Gerson Tabachnick, Linda S. Fidell · 1983 · 79,867 citations
Questions about this paper
How do I cite this paper in APA style?
Howard, J. P. (2017). Root Finding and Optimization. Chapman & Hall/CRC eBooks, 175–211. https://doi.org/10.1201/9781315120195-6
How many times has this paper been cited?
0 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.
Who wrote this paper?
James P. Howard.
What is the DOI of this paper?
10.1201/9781315120195-6, permanently at https://doi.org/10.1201/9781315120195-6. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.