For this test, you need to write two functions: polyNewton (X,Y) and interpNewton(a,x,x) vectors which contains the values to be interpolated. polyNewton (X,Y) returns a vector with s of the Newton's polynomial. interpNewton (a,x,x) uses the output of polyNewton and e the interpolated values at points contained in x. The twist is that you are allowed one and -loop in each function AND you are not allowed to allocate any extra memory aside from es the output in polyNewton, and y which stores the output in interpNewton (the dummy
For this test, you need to write two functions: polyNewton (X,Y) and interpNewton(a,x,x) vectors which contains the values to be interpolated. polyNewton (X,Y) returns a vector with s of the Newton's polynomial. interpNewton (a,x,x) uses the output of polyNewton and e the interpolated values at points contained in x. The twist is that you are allowed one and -loop in each function AND you are not allowed to allocate any extra memory aside from es the output in polyNewton, and y which stores the output in interpNewton (the dummy
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
Related questions
Question
![Question 1. For this test, you need to write two functions: polyNewton (X,Y) and interpNewton(a,x,x).
X and Y are vectors which contains the values to be interpolated. polyNewton (X,Y) returns a vector with
the coefficients of the Newton's polynomial. interpNewton (a, X,x) uses the output of polyNewton and
X to calculate the interpolated values at points contained in x. The twist is that you are allowed one and
only ONE for-loop in each function AND you are not allowed to allocate any extra memory aside from
a, which stores the output in polyNewton, and y which stores the output in interpNewton (the dummy
% Newton's Polynomial solver
X=sort(rand([10,1])*2*pi);
Y=sin(X);
%(X,Y) are the points to interpolate.
x=linspace(0,2*pi,200);
a=polyNewton(X,Y);
y=arrayfun(@(x) interpNewton(a,x,x), x);
function a=polyNewton(X,Y)
a=zeros(size(Y));
end
function y-interpNewton(a,x,x)
end](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Ffa3769d6-5bdb-4366-8adb-dd8310df7605%2F4fdc8d34-681a-439b-a614-f11a24e9521d%2Fh83ndik_processed.png&w=3840&q=75)
Transcribed Image Text:Question 1. For this test, you need to write two functions: polyNewton (X,Y) and interpNewton(a,x,x).
X and Y are vectors which contains the values to be interpolated. polyNewton (X,Y) returns a vector with
the coefficients of the Newton's polynomial. interpNewton (a, X,x) uses the output of polyNewton and
X to calculate the interpolated values at points contained in x. The twist is that you are allowed one and
only ONE for-loop in each function AND you are not allowed to allocate any extra memory aside from
a, which stores the output in polyNewton, and y which stores the output in interpNewton (the dummy
% Newton's Polynomial solver
X=sort(rand([10,1])*2*pi);
Y=sin(X);
%(X,Y) are the points to interpolate.
x=linspace(0,2*pi,200);
a=polyNewton(X,Y);
y=arrayfun(@(x) interpNewton(a,x,x), x);
function a=polyNewton(X,Y)
a=zeros(size(Y));
end
function y-interpNewton(a,x,x)
end
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps

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.Recommended textbooks for you

Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON

Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning

Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education