
implicit none
integer, parameter :: n = 1000 ! maximum iteration
real(kind=8), parameter :: EPSILON = 1.d-3
real(kind=8):: x0,x
integer:: iteration
x0=3.0d0
call solve(f(x),fp(x),x0,n,x,iteration)
contains
real (kind=8) function f(x) ! this is f(x)
implicit none
real (kind=8), intent(in)::x
f=x**2.0d0-1.0d0
end function f
real (kind=8) function fp(x) ! This is f'(x)
implicit none
real (kind=8), intent(in)::x
fp=2.0d0*x
end function fp
end program Assignment07
modify this program in fortran byy adding a module (called Newton) which contains subroutine
solve. You should develop subroutine solve based on the aforementioned Newton's method.
▪ Function f(x) is x
2-1 whose zero is known. Set the input argument EPSILON to 1.E-3 and input
argument n to 1000 when you call subroutine solve and run the program
Modify the function to one that is known not to have zeros; e.g. (x
2+1)

Step by stepSolved in 2 steps

- Given the code: void e(int x, int y) { if(y<2) { cout << x << " "; return; } cout << x << " "; e(x+1, y-1); } 1. Trace the function when x and y are 4.arrow_forwardDefine an enumeration type, triangleType, that has the values scalene, isosceles, equilateraland noTriangle. Write a function triangleShape that takes as parameters three numbers, each of which represents the length of a side of the triangle. The function should return the shape of the triangle. (Note, ina triangle, the sum of the lengths of any two sides is greater than the length of the third side). Write a program that prompts the user to input the length of the sides of a triangle and outputs the shape of the triangle. The user can enter the sides in no particular order. C++arrow_forwardGiven the following functions:void sum(int a, int b, int total) { total = a+b;}int main() { int x=1, y=2, s=0; sum(x,y,s); cout << s << "\n"; return 0;}1. Explain the problem with the sum function.2. Explain how to fix the problem without changing the main function.arrow_forward
- The following is a implementation of the Ackermann function: public static long Ackermann(int m, int n){ 0) return n + 1; if (m == else if (n == return Ackermann(m 1, 1); else return Ackermann(m 1, Ackermann(m, n - 1));arrow_forwardConsider the following function shoots : def shoots(x: int) -> int: if x <= 0: return 0 4 elif x == 1: return shoots(x + 2) 6 elif x == 2: return shoots(x - 1) 80 elif x == 2: 9. return -1 10 else: 11 return shoots(x - 2) 2 3arrow_forwardThe MATLAB function arg supports variable arguments, returns the sum of the number of arguments and all arguments, and has a help function. Write the arg so that the next execution results. >> help argIt supports variable arguments. >> [n,m] = arg(5,6)n = 2m = 11>> [n, m] = arg(3,4,5)n = 3m = 12arrow_forward
- -Python- Write a function get_letter_grade, such that when given * a lab grade score and * a list of the grade cutoffsreturns the letter grade of that score.Note: Your function automatically returns A for the values that are >= to the first cutoff-value in the list, then A- for the second cutoff-value, B+ for the third and so on. The function returns None for anything that's below the score for B-. You test that get_letter_grade(97, [93, 90, 87, 83, 80]) correctly returns an A, and get_letter_grade(93, [97, 90, 87, 83, 80]) returns A-. DO NOT hard-code the cutoffs, since they can change! You can copy/paste the following template: def get_letter_grade(score, cutoffs): if score ... : return 'A' ...: return 'A-' ...: return 'B+' ...: return 'B' ...: return 'B-'arrow_forwardWrite a lisp program (please provide photos that it works)arrow_forwardWrite the definition of a function isEven, that receives an integer parameter and returns true if the parameter's value is even, and false otherwise. So, if the parameter's value is 7 or 93 or 11 the function returns false. But if the parameter's value is 44 or 126 or 7778 the function returns true.arrow_forward
- Computer Networking: A Top-Down Approach (7th Edi...Computer EngineeringISBN:9780133594140Author:James Kurose, Keith RossPublisher:PEARSONComputer Organization and Design MIPS Edition, Fi...Computer EngineeringISBN:9780124077263Author:David A. Patterson, John L. HennessyPublisher:Elsevier ScienceNetwork+ Guide to Networks (MindTap Course List)Computer EngineeringISBN:9781337569330Author:Jill West, Tamara Dean, Jean AndrewsPublisher:Cengage Learning
- Concepts of Database ManagementComputer EngineeringISBN:9781337093422Author:Joy L. Starks, Philip J. Pratt, Mary Z. LastPublisher:Cengage LearningPrelude to ProgrammingComputer EngineeringISBN:9780133750423Author:VENIT, StewartPublisher:Pearson EducationSc Business Data Communications and Networking, T...Computer EngineeringISBN:9781119368830Author:FITZGERALDPublisher:WILEY





