数学与应用数学专业毕业论文英文文献翻译

上传人:鲁** 文档编号:556227867 上传时间:2022-10-09 格式:DOC 页数:17 大小:164KB
返回 下载 相关 举报
数学与应用数学专业毕业论文英文文献翻译_第1页
第1页 / 共17页
数学与应用数学专业毕业论文英文文献翻译_第2页
第2页 / 共17页
数学与应用数学专业毕业论文英文文献翻译_第3页
第3页 / 共17页
数学与应用数学专业毕业论文英文文献翻译_第4页
第4页 / 共17页
数学与应用数学专业毕业论文英文文献翻译_第5页
第5页 / 共17页
点击查看更多>>
资源描述

《数学与应用数学专业毕业论文英文文献翻译》由会员分享,可在线阅读,更多相关《数学与应用数学专业毕业论文英文文献翻译(17页珍藏版)》请在金锄头文库上搜索。

1、2013届数学与应用数学专业毕业设计(论文)英文文献翻译Chapter 3InterpolationInterpolation is the process of defining a function that takes on specified values at specified points. This chapter concentrates on two closely related interpolants, the piecewise cubic spline and the shape-preserving piecewise cubic named “pchip”.3

2、.1 The Interpolating PolynomialWe all know that two points determine a straight line. More precisely, any two points in the plane, and, with , determine a unique first degree polynomial in whose graph passes through the two points. There are many different formulas for the polynomial, but they all l

3、ead to the same straight line graph.This generalizes to more than two points. Given points in the plane, ,, with distinct s, there is a unique polynomial in of degree less than whose graph passes through the points. It is easiest to remember that , the number of data points, is also the number of co

4、efficients, although some of the leading coefficients might be zero, so the degree might actually be less than . Again, there are many different formulas for the polynomial, but they all define the same function.This polynomial is called the interpolating polynomial because it exactly re- produces t

5、he given data.,Later, we examine other polynomials, of lower degree, that only approximate the data. They are not interpolating polynomials.The most compact representation of the interpolating polynomial is the La- grange form.There are terms in the sum and terms in each product, so this expression

6、defines a polynomial of degree at most . Ifis evaluated at , all the products except the th are zero. Furthermore, the th product is equal to one, so the sum is equal to and the interpolation conditions are satisfied.For example, consider the following data set:x=0:3;y=-5 -6 -1 16;The commanddisp(x;

7、y)displays 0123-5-6-116The Lagrangian form of the polynomial interpolating this data isWe can see that each term is of degree three, so the entire sum has degree at most three. Because the leading term does not vanish, the degree is actually three. Moreover, if we plug in or 3, three of the terms va

8、nish and the fourth produces the corresponding value from the data set.Polynomials are usually not represented in their Lagrangian form. More fre- quently, they are written as something likeThe simple powers of x are called monomials and this form of a polynomial is said to be using the power form.T

9、he coefficients of an interpolating polynomial using its power form,can, in principle, be computed by solving a system of simultaneous linear equationsThe matrix of this linear system is known as a Vandermonde matrix. Its elements areThe columns of a Vandermonde matrix are sometimes written in the o

10、pposite order, but polynomial coefficient vectors in Matlab always have the highest power first.The Matlab function vander generates Vandermonde matrices. For our ex- ample data set,V = vander(x)generatesV =00011111842127931Thenc = Vycomputes the coefficientsc =1.00000.0000-2.0000-5.0000In fact, the

11、 example data was generated from the polynomial .One of the exercises asks you to show that Vandermonde matrices are nonsin- gular if the points are distinct. But another one of the exercises asks you to show that a Vandermonde matrix can be very badly conditioned. Consequently, using the power form

12、 and the Vandermonde matrix is a satisfactory technique for problems involving a few well-spaced and well-scaled data points. But as a general-purpose approach, it is dangerous.In this chapter, we describe several Matlab functions that implement various interpolation algorithms. All of them have the

13、 calling sequencev = interp(x,y,u)The first two input arguments, and , are vectors of the same length that define the interpolating points. The third input argument, , is a vector of points where the function is to be evaluated. The output, v, is the same length as u and has elements Our first such

14、interpolation function, polyinterp, is based on the Lagrange form. The code uses Matlab array operations to evaluate the polynomial at all the components of u simultaneously.function v = polyinterp(x,y,u)n = length(x);v = zeros(size(u);for k = 1:nw = ones(size(u);for j = 1:k-1 k+1:nw = (u-x(j)./(x(k

15、)-x(j).*w;endendv = v + w*y(k); To illustrate polyinterp, create a vector of densely spaced evaluation points.u = -.25:.01:3.25;Thenv = polyinterp(x,y,u);plot(x,y,o,u,v,-)creates figure 3.1.Figure 3.1. polyinterpThe polyinterp function also works correctly with symbolic variables. For example, createsymx = sym(x)Then evaluate and display the symbolic form of the interpolating polynomial withP = polyinterp(x,y,symx)pretty(P)produces-5 (-1/3 x + 1)(-1/2 x + 1)(-x + 1) - 6 (-1/2 x + 3/2)(-x +

展开阅读全文
相关资源
相关搜索

当前位置:首页 > 商业/管理/HR > 营销创新

电脑版 |金锄头文库版权所有
经营许可证:蜀ICP备13022795号 | 川公网安备 51140202000112号