Electronic Resource
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.
| Τίτλος: | 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. |
|---|---|
| Γλώσσα: | English |
| Συγγραφείς: | Rheinboldt, Werner C., Education Development Center, Inc., Newton, MA. |
| Peer Reviewed: | N |
| Page Count: | 59 |
| Ημερομηνία έκδοσης: | 1980 |
| Sponsoring Agency: | National Science Foundation, Washington, DC. |
| Τύπος εγγράφου: | Guides - Classroom - Learner |
| Descriptors: | Algorithms, College Mathematics, Computer Programs, Computer Science, Computer Science Education, Higher Education, Instructional Materials, Learning Modules, Mathematical Applications, Problem Solving, Supplementary Reading Materials |
| Περίληψη: | 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) |
| Entry Date: | 1982 |
| Αριθμός Καταχώρησης: | ED218126 |
| Βάση Δεδομένων: | ERIC |
καταχωρήστε σχόλιο πρώτοι!