Develop a Matlab function that finds a root of a function f(x) starting from the given initial estimates x(−¹) and x(0) with a tolerance in function of at least OK using the secant method. Name the function my Secant using as input the anonymous function f, the initial estimates xm1 and x0, the maximum number of iterations to perform N, and the required tolerance in function epsok. As output, the function shall return four scalar variables: the numerical solution x, its tolerance in function tol Func, its estimated relative error ere, and the number of iterations performed n. If the requested tolerance in function cannot be reached within N iterations, the function shall execute Matlab's error ("...") function with an appropriate error message. Other than this potential error message, do not print out any results to screen or do any plotting within the function. You must minimize the number of function calls required per iteration, by storing function call results in temporary storage variables. You may use only 1 function call to f to update the solution per iteration.

Develop a Matlab function that finds a root of a function f(x) starting from the given initial estimates x(−¹) and x(0) with a tolerance in function of at least OK using the secant method. Name the function my Secant using as input the anonymous function f, the initial estimates xm1 and x0, the maximum number of iterations to perform N, and the required tolerance in function epsok. As output, the function shall return four scalar variables: the numerical solution x, its tolerance in function tol Func, its estimated relative error ere, and the number of iterations performed n. If the requested tolerance in function cannot be reached within N iterations, the function shall execute Matlab's error ("...") function with an appropriate error message. Other than this potential error message, do not print out any results to screen or do any plotting within the function. You must minimize the number of function calls required per iteration, by storing function call results in temporary storage variables. You may use only 1 function call to f to update the solution per iteration.

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

See similar textbooks

Related questions

Q: implement following funtions: std::vector> return_table(int number_of_vars);…

A: Hello there, Assuming that every variable has 2 values. You want to implement a function that first…

Q: The code for a function that is similar tofunction vfunct (a). We used vfunct toillustrate the use…

A: Code: #include <alloca.h> long aframe(long n, long idx, long *q) { long i; long **p =…

Q: 2.)Recurrences. a.)Provide a Sample code for the recurrences below. i.) T(n)=T(n/5)+T(3n/5)+n…

A: a. i.) def recurrences(n): if n == 1: return 1 else: return…

Q: I want to create a generic function increment(start, stop, x) that adds an integer x to every…

A: Introduction: Here we are required to create a generic function which will add an integer x to every…

Q: In C In C, strings are implemented by a contiguous sequence of characters, terminated by NUL…

A: A. A. Write your own version of stropy that receives two character pointers and copies the…

Q: Can you help me write a C++ Program to do the following: Create a generic function…

A: Dear learner, hope you are doing well, I will try my best to answer this question. Thank You!!

Q: In python please Plot the 2-variable function sin(10(?^2+?^2))/10 for ?∈[−1,1] and ?∈[−1,1]

A: first we input math header file for using sine function then we input two variable then we take…

Q: 4. Implement the MPL Allreduce function using (by calling) other MPI functions. The header of the…

A: The question is to write the code for the given program.

Q: Write a function named split-list in Scheme that takes a list and a length as input and returns two…

A: We need to write a function sit-lost in scheme.

Q: Simulation parameters: •Define a step size h. Try something small like 0.001 seconds. Define a…

A: You have presumably gone over the mean previously; it is the most usually utilized kind of normal…

Q: write a recurrence (not Java or pseudocode) defining the function that takes an array of natural…

A: Pseudo Code: If there is single element, return it. Else return maximum of following. a) Last…

Q: With the following C++ code, implement the “indirect sum” method of computing a sum. You will need…

A: The code is given below:

Question

Please use

function [x,tolFunc,ere,n] = mySecant(f,xm1,x0,N,epsok)

Develop a Matlab function that finds a root of a function f(x) starting from the given initial estimates x(−¹) and x(0)
with a tolerance in function of at least EOK using the secant method. Name the function my Secant using as input
the anonymous function f, the initial estimates xm1 and x0, the maximum number of iterations to perform N, and
the required tolerance in function epsok. As output, the function shall return four scalar variables: the numerical
solution X, its tolerance in function tolFunc, its estimated relative error ere, and the number of iterations performed
n. If the requested tolerance in function cannot be reached within N iterations, the function shall execute Matlab's
error("...") function with an appropriate error message. Other than this potential error message, do not print
out any results to screen or do any plotting within the function. You must minimize the number of function calls
required per iteration, by storing function call results in temporary storage variables. You may use only 1
function call to f to update the solution per iteration.

Expert Solution

Step 1

The answer for the above mentioned question is given in the below steps for your reference.

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

I have this function that works for the selection sort. I need a function that would work using the same logic for the BubbleSort and InsertionSort. void Selection_Sort(struct studentTag STUDENTS[], int nStudents){ struct studentTag s, t, temp; int i, j; for(i = 0; i < nStudents; i++) { for(j = i + 1; j < nStudents; j++) { s = STUDENTS[i]; t = STUDENTS[j]; if (strcmp(s.name.last, t.name.last) > 0) { temp = STUDENTS[j]; STUDENTS[j] = STUDENTS[i]; STUDENTS[i] = temp; } else if (strcmp(s.name.last, t.name.last) == 0) { if (strcmp(s.name.first, t.name.first) > 0) { temp = STUDENTS[j]; STUDENTS[j] = STUDENTS[i]; STUDENTS[i] = temp; } } } } }
*Data Structures (a) The function g(n) is a/an [?] bound on f(n). A. upper B. tight C. lower (b) The function f(n) is a/an [?] bound on g(n). A. upper B. tight C. lower (c) The function g(n) is a/an [?] bound on h(n). A. upper B. tight C. lower (d) The function j(n) is a/an [?] bound on g(n). A. upper B. tight C. lower (e) The function h(n) is a/an [?] bound on k(n). A. upper B. tight C. lower (f) The function k(n) is a/an [?] bound on f(n). A. upper B. tight C. lower
Determine the functionality of this function:
Define a number of functions that can be used to analyze and manipulate C-strings. A C-string is a sequence of characters terminated by the null character, '\0'. Since C is part of C++, C-string implementations are valid in C++ as well as C. Recall that an array of characters is the underlying data structure for storing C-strings. For example, this definition creates such an array. char myString[100]; myString will be capable of holding a C-string with up to 99 characters before the terminating null character. Of course, myString can hold a shorter C-string, too. For example, these examples give myString the value "xyz". myString[0] = 'x';myString[1] = 'y';myString[2] = 'z';myString[3] = '\0'; It is legal to initialize a string variable,char example[100] = "First value";Now, the string example[100] contains the following: F i r s t v a l u e \0 * * . . . . . * * * * * * * * note that * char indicates an unknown value. myString = "xyz"; // ILLEGAL: Cannot assign to an array…
How do I create a function in C++ that takes in a file name on input and generates a one dimensional integer vector with 10 elements, and gives back the frequency of each element such as x(0) stores how many times 0 occurs in the file.
Write a function called words_with_char() that takes two input parameters; a 2D-list of strings of any length (e.g., [['789', 'del'], ['a', 'do', ‘abc’], ['bb'], ['dcc']]) and a character c. This function returns a 1D-list that contains all the words in 2D-list that start with the character c. Sample run, >>> print( words_with_char( [['789', 'del'], ['a', 'd'], ['bb', 'do'], ['dcc'], ['dddd', 'duck'], ['efghi', 'd#$%^'], ['zzzzzzzzz']], ‘d’ )) ['del', 'd', 'do', 'dcc', 'dddd', 'duck', 'd#$%^']
Define a Python function split_dict() that takes a number x and a dictionary d whose keys are strings and values are numbers. It returns a tuple (d1, d2) of dictionaries of the same kind, where di consists of the key-value pairs of d whose values are less than or equal to x, and d2 consists of the key-value pairs of d whose values are greater than x. The following is an example execution. >>> d= dict([('a', 2), ('b', 10), ('c', 2), ('d', 9), ('e', 5)]) >>> x = 3 >>> print (split_dict (x, d)) ({'a': 2, 'c': 2}, {'b': 10, 'd': 9, 'e': 5}) >>>
Write a C function, void sum_rows( int a*,int sum*,int n) to compute the sum of row elements in a nxn matrix and store the result in vector sum[]. Can this function be optimized by the compiler? If No, why? Rewrite the function to remove the optimization blocker.
Which of the following is the definition of a higher-order function? func xs = sum (map (^2) xs) func x = x * 2 func (x,y) = (y,x) func (x:y:zs) = y func f [x,y] = [f x, f y]
I need help Implement this python function. Please help me
For the following C++ code find and write the recurrence relation. You need to model the runtime of function "Func" in terms of n. (only the recurrence relation in terms of n, No output of the code or final runtime analysis is required) s= array L[] start index e= array L[] end index void Func(int L[], int s, int e) { if (s < e) { i=s-1; for (int j = s; j <= e - 1; j++) { if (A[j] <= x) { i++; swap (&L[i], &L[j]); } } swap (&L[i + 1], &L[e]); int k = i+1; Func(L, s, k - 1); Func(L, k + 1, e); } } Please explain how you get the relation Thank you!
1. Determine x[z] if [you use your ID as follows the first four numbers from right as x[n] and h[n] as the first five numbers from left respectively ] (for example If Your ID= [439804543]) then x[n] = {4, 3, 9, 8, 0₁, 4, 5, 4, 3}?