Content area

Abstract

This material contains two units which view applications of computer science. The first of these examines Horner's scheme; and is designed to instruct the user on how to apply both this scheme and related algorithms. The second unit aims for student understanding of standard bisection, secant, and Newton methods of root finding and appreciation of their limitations and strong points. An introduction to more recent root finding methods is also provided. Both modules contain exercises, and answers to these problems are given at the conclusion of each unit. (MP)

Details

1007399
Identifier / keyword
Sponsor
National Science Foundation, Washington, DC.
Title
Horner's Scheme and Related Algorithms. Applications of Computer Science. [and] Algorithms for Finding Zeros of Functions. Computer Science. Modules and Monographs in Undergraduate Mathematics and Its Applications Project. UMAP Units 263 and 264
Pages
59
Number of pages
59
Publication date
1980
Source type
Encyclopedia or Reference Work
Summary language
English
Language of publication
English
Document type
Instructional Material/Guideline
Subfile
ERIC, Resources in Education (RIE)
Accession number
ED218126
ProQuest document ID
63544815
Document URL
https://www.proquest.com/encyclopedias-reference-works/horners-scheme-related-algorithms-applications/docview/63544815/se-2?accountid=208611
Last updated
2024-04-21
Database
Education Research Index