Write a program that finds the minimum of a function ƒ(x,y) starting from an initial search position (x0, Yo) and using a step size A. To accomplish this task, the program would calculate the value of the function at the 8 nearby points (xo ± A, Yo ±A) and move to the point where f(x,y) has the smallest value. The program should keep repeating this until the values of the function at every one of the 8 neighboring points is larger than f(x, y). The program would receive the starting point x0, y0 and delta as command line parameters and print the coordinates of the minimum point rmin, Ymin and f(xmin, Ymin) On the screen as output. EXAMPLE: Suppose we want to find the minimum of the function f(r, y) = (x – 3)² + (y + 2)² + 5 The prototype for the function would be double f(double x, double y) If we use an initial starting point (xo, Yo) = (1,2) and step size A = 0.01 we would run the program from the command line as findmin.exe 1 2 0.01 the output of the program would be (approximately): 3.0 -2.0 5 1 /1
Write a program that finds the minimum of a function ƒ(x,y) starting from an initial search position (x0, Yo) and using a step size A. To accomplish this task, the program would calculate the value of the function at the 8 nearby points (xo ± A, Yo ±A) and move to the point where f(x,y) has the smallest value. The program should keep repeating this until the values of the function at every one of the 8 neighboring points is larger than f(x, y). The program would receive the starting point x0, y0 and delta as command line parameters and print the coordinates of the minimum point rmin, Ymin and f(xmin, Ymin) On the screen as output. EXAMPLE: Suppose we want to find the minimum of the function f(r, y) = (x – 3)² + (y + 2)² + 5 The prototype for the function would be double f(double x, double y) If we use an initial starting point (xo, Yo) = (1,2) and step size A = 0.01 we would run the program from the command line as findmin.exe 1 2 0.01 the output of the program would be (approximately): 3.0 -2.0 5 1 /1
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY