Next, add to you derivative function the capability to check for accuracy by comparing maximum errors between successive calculations of the derivative. You will need a while loop that checks when the maximum error is ≤ eps. To find the maximum array create a numpy array in your derivative function. Call it "maxe" where each element of the array would contain |dƒj+¹(x;) – dƒ³ (xi)|. j + 1 refers to the finer grid where the j + 1 grid would use twice as many points as the j grid. For example, j = 1 (the starting grid) would have N = 10 points, and the j + 1 grid would use 2N = 20 points, the j + 2 grid would use 40 points and so on. Now for the 1st pass through the while-loop you cannot converge you haven't started the comparison. So construct you code to avoid this situation. For this part of the laboratory, let's use for our function, f(x) = x logx

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
Next, add to you derivative function the capability to check for accuracy by comparing
maximum errors between successive calculations of the derivative. You will need a while loop
that checks when the maximum error is ≤ eps. To find the maximum array create a numpy
array in your derivative function. Call it "maxe" where each element of the array would contain
|dƒj+¹(x;) – dƒ³ (xi)|.
j + 1 refers to the finer grid where the j + 1 grid would use twice as many points as the j
grid. For example, j = 1 (the starting grid) would have N = 10 points, and the j + 1 grid
would use 2N = 20 points, the j + 2 grid would use 40 points and so on.
Now for the 1st pass through the while-loop you cannot converge you haven't started the
comparison. So construct you code to avoid this situation.
For this part of the laboratory, let's use for our function, f(x) = x logx
Transcribed Image Text:Next, add to you derivative function the capability to check for accuracy by comparing maximum errors between successive calculations of the derivative. You will need a while loop that checks when the maximum error is ≤ eps. To find the maximum array create a numpy array in your derivative function. Call it "maxe" where each element of the array would contain |dƒj+¹(x;) – dƒ³ (xi)|. j + 1 refers to the finer grid where the j + 1 grid would use twice as many points as the j grid. For example, j = 1 (the starting grid) would have N = 10 points, and the j + 1 grid would use 2N = 20 points, the j + 2 grid would use 40 points and so on. Now for the 1st pass through the while-loop you cannot converge you haven't started the comparison. So construct you code to avoid this situation. For this part of the laboratory, let's use for our function, f(x) = x logx
AI-Generated Solution
AI-generated content may present inaccurate or offensive content that does not represent bartleby’s views.
steps

Unlock instant AI solutions

Tap the button
to generate a solution

Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education