Question: Write a recursive version in matlab of: function p = horner(a,x) % horner's rule to evaluate p = a(1)+a(2)x+...+a(n+1)x^n n = length(a)-1; p = 0*x+a(n+1);

Write a recursive version in matlab of:

function p = horner(a,x) % horner's rule to evaluate p = a(1)+a(2)*x+...+a(n+1)*x^n n = length(a)-1; p = 0*x+a(n+1); for k = n:-1:1 p = p.*x+a(k); end

Please include screenshot of code

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

Horner's method is an algorithm for calculating polynomials. It performs its calculation by evaluating all the terms in the polynomial expression one by one For example, Take the expression: 3x*2 +...

1. A player throws a fair die and simultaneously flips a fair coin. If the coin lands heads, then she wins twice, and if tails, then one-half of the value that appears on the die. Determine her...

Briefly describe ASCII and Unicode and draw attention to any relationship between them. [3 marks] (b) Briefly explain what a Reader is in the context of reading characters from data. [3 marks] A...

Let A, B be sets. Define: (a) the Cartesian product (A B) (b) the set of relations R between A and B (c) the identity relation A on the set A [3 marks] Suppose S, T are relations between A and B, and...

Math 104A Homework #2 Instructor: Lihui Chai General Instructions: Please write your homework papers neatly. You need to turn in both full printouts of your codes and the appropriate runs you made....

The Basics of Financial Mathematics Spring 2003 Richard F. Bass Department of Mathematics University of Connecticut c These notes are 2003 by Richard Bass. They may be used for personal use or class...

# 5: Fourier Interpolant and DFT 1 The Discrete Fourier Transform (DFT) of a periodic array fj , for j = 0, 1, . . . , N 1 (corresponding to data at equally spaced points, starting at the left end...

The following is a shortened version of one of the definition modules described in the Modula-2 user manual: DEFINITION MODULE Processes; TYPE Semaphore; Procedure InitSemaphore (VAR a:Semaphore);...

Math 400 Assignment #3 -- Numerical Integration and Differentiation 1. For the function g x e x 2 2 Due: 6am April 09, 2016 use the centered difference formula with h 101 , 102 , , 1020 to create a...

12-111. Determine the moment reactions at the supports A and B, and then draw the shear and moment diagrams. Solve by expressing the internal moment in the beam in terms of Ay and MA. EI is constant....

Discuss how developing countries today differ from the developed ones. Q2. Explain the two principal measures of income distribution. Q3. Explain how the "Microeconomic Household theory of fertility"...

A pension fund purchases bonds so that the payments from the bonds provide sufficient cash inflow in a timely manner to offset the cash outflows from the pension fund. What is this investment...

CT Corp Comprehensive Question Canadian Tire Corporation, Limited (Canadian Tire) is a family of companies that includes a retail segment and a financial services division, among others. The retail...

Brett Geiger of the human resources department has received complaints from several managers during the past few months about employees surfing the Internet, answering personal e-mail, shopping...

Explain why the following paragraph would be ineffective in closing a persuasive request message. Rewrite the paragraph to be more effective. (Objective 4) If you are willing to participate in the...

What are the purposes of collection messages? (Objective 5)

Question: Write a recursive version in matlab of: function p = horner(a,x) % horner's rule to evaluate p = a(1)+a(2)*x+...+a(n+1)*x^n n = length(a)-1; p = 0*x+a(n+1);

Step by Step Solution

Students Have Also Explored These Related Databases Questions!

Question: Write a recursive version in matlab of: function p = horner(a,x) % horner's rule to evaluate p = a(1)+a(2)x+...+a(n+1)x^n n = length(a)-1; p = 0*x+a(n+1);