Scientific Computing Assignment
Requirement
This is an individual assignment that covers the content of Chapter 8 and Chapter 9. Answer following questions. Some of questions are open questions. Provide your insights and each response is up to 1000 words.
1. What is a Mathematical Programming problem? Please give an example (10 points)
2. How to distinguish local optimal and global optimal? (10 points)
3. Illustrate Golden-Section search with an example. (20 points)
4. Illustrate Parabolic Interpolation? (10 points)
5. Given the below program M, please draw the corresponding DFG (data flow graph).
D[0]=20; D[-1]=30;
For (i= 1 to N)
{ A[i]=D[i-2]+1011;
B[i]=A[i]*2;
C[i]=A[i]-1107;
D[i]=A[i]+8
E[i]=B[i]+C[i]+D[i];
}
6. If we have five processors P1, P2, P3, P4, and P5 available, run program M above 1000 times,
(1) How much is the total execution cycles without retiming?
(2) Using retiming, what is the minimum total execution time we can achieve?
(3) Draw the schedule maps step by step to explain.
Text Book: Numerical Methods for Engineers by Steven C. Chapra and Raymond P. Canale, SEVENTH EDITION.
Format your assignment according to the following formatting requirements:
1. The answer should be typed, double spaced, using Times New Roman font (size 12), with one-inch margins on all sides.
2. The response also include a cover page containing the title of the assignment, the student's name, the course title, and the date. The cover page is not included in the required page length.
3. Also Include a reference page. The Citations and references should follow APA format. The reference page is not included in the required page length.
Attachment:- Diagram.rar