数学与应用数学专业概率论的发展大学毕业论文英文文献翻译及原文
数学与应用数学专业论文英文文献翻译
数学与应用数学专业论文英文文献翻译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.1 The Interpolating PolynomialWe all know that two points determine a straight line. More precisely, any two points in the plane, ),(11y x and ),(11y x , with )(21x x ≠ , determine a unique first degree polynomial in x whose graph passes through the two points. There are many different formulas for the polynomial, but they all lead to the same straight line graph.This generalizes to more than two points. Given n points in the plane, ),(k k y x ，n k ,,2,1 =, with distinct k x ’s, there is aunique polynomial in x of degree less than n whose graph passes through the points. It is easiest to remember that n , the number of data points, is also the number of coefficients, although some of the leading coefficients might be zero, so the degree might actually be less than 1-n . 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 the given data.n k y x P k k ,,2,1,)( ==，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.∑∏⎪⎪⎭⎫ ⎝⎛--=≠k k k j j k j y x x x x x P )( There are n terms in the sum and 1-n terms in each product, so this expression defines a polynomial of degree at most 1-n . If )(x P is evaluated at k x x = , all the products except the k th are zero. Furthermore, the k th product is equal to one, so the sum is equal to k y and theinterpolation conditions are satisfied.For example, consider the following data set:x=0:3;y=[-5 -6 -1 16];The commanddisp([x;y])displays0 1 2 3-5 -6 -1 16 The Lagrangian form of the polynomial interpolating this data is)16()6()2)(1()1()2()3)(1()6()2()3)(2()5()6()3)(2)(1()(--+----+---+-----=x x x x x x x x x x x x x P We 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 2,1,0=x or 3, three of the terms vanish 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 like523--x xThe simple powers of x are called monomials and this form of a polynomial is said to be using the power form.The coefficients of an interpolating polynomial using its power form,n n n n c x c x c x c x P ++++=---12211)(can, in principle, be computed by solving a system of simultaneous linear equations⎥⎥⎥⎥⎦⎤⎢⎢⎢⎢⎣⎡=⎥⎥⎥⎥⎦⎤⎢⎢⎢⎢⎣⎡⎥⎥⎥⎥⎥⎦⎤⎢⎢⎢⎢⎢⎣⎡------n n n n n n n n n n n y y y c c c x x x x x x x x x 21212122212121111111 The matrix V of this linear system is known as a Vandermonde matrix. Its elements arej n kj k x v -=, The columns of a Vandermonde matrix are sometimes written in the opposite 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 =0 0 0 11 1 1 18 4 2 127 9 3 1Thenc = V\y’computes the coefficientsc =1.00000.0000-2.0000-5.0000In fact, the example data was generated from the polynomial 523--x x .One of the exercises asks you to show that Vandermonde matrices are nonsin- gular if the points k x are distinct. But another one of theexercises asks you to show that a Vandermonde matrix can be very badly conditioned. Consequently, using the power form 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 calling sequencev = interp(x,y,u)The first two input arguments, x and y, are vectors of the same length that define the interpolating points. The third input argument, u, is a vector of points where the function is to be evaluated. The output, v, is the same length as u and has elements ))xterpyvuink(k(,,)(Our first such 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:n]w = (u-x(j))./(x(k)-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 + 2)x-1/2 (-x + 3)(x - 1)x + 16/3 (x - 2)(1/2 x - 1/2)xThis expression is a rearrangement of the Lagrange form of the interpolating poly- nomial. Simplifying the Lagrange form withP = simplify(P)changes P to the power formP =x^3-2*x-5Here is another example, with a data set that is used by the other methods in this chapter.x = 1:6;y = [16 18 21 17 15 12];disp([x; y])u = .75:.05:6.25;v = polyinterp(x,y,u);plot(x,y,’o’,u,v,’-’);produces1 2 3 4 5 616 18 21 17 15 12creates figure 3.2.Figure 3.2. Full degree polynomial interpolation Already in this example, with only six nicely spaced points, we canbegin to see the primary difficulty with full-degree polynomial interpolation. In between the data points, especially in the first and last subintervals, the function shows excessive variation. It overshoots the changes in the data values. As a result, full- degree polynomial interpolation is hardly ever used for data and curve fitting. Its primary application is in the derivation of other numerical methods.第三章 插值多项式插值就是定义一个在特定点取给定值得函数的过程。
数学专业毕业设计文献翻译
附件1：外文资料翻译译文第1章预备知识双曲守恒律系统是应用在出现在交通流，弹性理论，气体动力学，流体动力学等等的各种各样的物理现象的非常重要的数学模型。
一般来说，古典解非线性双曲方程柯西问题解的守恒定律仅仅适时局部存在于初始数据是微小和平滑的.这意味着震波在解决方案里相配的大量时间里出现。
既然解是间断的而且不满足给定的传统偏微分方程式，我们不得不去研究广义的解决方法，或者是满足分布意义的方程式的函数.我们考虑到如下形式的拟线性系统, (1.0.1)这里是代表物理量密度的未知矢量向量，是给定表示保守项的适量函数，这些方程式通常被叫做守恒律.让我们假设一下，是(1.0.1)在初始数据. (1.0.2)下的传统解。
使成为消失在紧凑子集外的函数的一类。
我们用乘以(1.0.1)并且使的部分，得到. (1.0.3)定义1.0.1 有，,有界函数叫做在以原始数据为边界条件下，(1.0.1)初值问题的一个弱解，在(1.0.3)适用于所有.非线性系统守恒理论的一个重要方面是这些方程解的存在疑问性.它正确的帮助解答在手边的已经建立的自然现象的模型的问题，而且如果在问题是适定的.为了得到一个总体的弱解或者一个考虑到双曲守恒律的普遍的解，一个为了在(1.0.1)右手边增加一个微小抛物摄动限：(1.0.4)在这是恒定的.我们首先应该得到一个关于柯西问题(1.0.4),(1.0.2)对于任何一个依据下列抛物方程的一般理论存在的的解的序列：定理1.0.2 (1)对于任意存在的, (1.0.4)的柯西问题在有界可测原始数据(1.0.2)对于无限小的总有一个局部光滑解，仅依赖于以原始数据的.(2)如果解有一个推理的估量对于任意的,于是解在上存在.(3)解满足：如果.( 4)特别的，如果在(1.0.4)系统中的一个解以(1.0.5)形式存在，这里是在上连续函数，,如果(1.0.6) 这里是一个正的恒量，而且当变量趋向无穷大或者趋向于0时，趋向于0.证明.在(1)中的局部存在的结果能简单的通过把收缩映射原则应用到解的积分表现得到，根据半线性抛物系统标准理论.每当我们有一个先验的局部解的评估，明显的本地变量一步一步扩展到，因为逐步变量依据基准.取得局部解的过程清晰地表现在(3)中的解的行为.定理1.0.2的(1)-(3)证明的细节在[LSU,Sm]看到.接下来是Bereux和Sainsaulieu未发表的证明(cf. [Lu9, Pe])我们改写方程式(1.0.5)如下：(1.0.7)当.然后. (1.0.8) 以初值(1.0.8)的解能被格林函数描写：. (1.0.9)由于，,(1.0.9)转化为.(1.0.10)因此对于任意一个，有一个正的下界.在定理1.0.2中获得的解叫做粘性解.然后我们有了粘性解的序列,,如果我们再假如是在关于参数的空间上一致连续，即存在子序列（仍被标记）如下, 在上弱对应(1.0.11) 而且有子序列如下，弱对应(1.0.12) 在习惯于成长适当成长性.如果，a.e.，(1.0.13)然后明显的是(1.01)使在(1.0.4)的趋近于0的一个初始值(1.0.2)的一个弱解.我们如何得到弱连续(1.0.13)的关于粘度解的序列的非线性通量函数？补偿密实度原理就回答了这个问题.为什么这个理论叫补偿密实度？粗略的讲，这个术语源自于下列结果：如果一个函数序列满足(1.0.14)与下列之一或者(1.0.15) 当趋近于0时弱相关，总之，不紧密.然而，明显的，任何一个在(1.0.15)中的弱紧密度能补偿使其成为的紧密度.事实上，如果我们将其相加，得到(1.0.16)当趋近于0时弱相关,与(1.0.14)结合意味着的紧密度.在这本书里，我们的目标是介绍一些补偿紧密度方法对标量守恒律的应用，和一些特殊的两到三个方程式系统.此外，一些具有松弛扰动参量的物理系统也被考虑进来。
数学与应用数学英文文献及翻译
（外文翻译从原文第一段开始翻译，翻译了约2000字）勾股定理是已知最早的古代文明定理之一。
这个著名的定理被命名为希腊的数学家和哲学家毕达哥拉斯。
毕达哥拉斯在意大利南部的科托纳创立了毕达哥拉斯学派。
他在数学上有许多贡献，虽然其中一些可能实际上一直是他学生的工作。
毕达哥拉斯定理是毕达哥拉斯最著名的数学贡献。
据传说，毕达哥拉斯在得出此定理很高兴，曾宰杀了牛来祭神，以酬谢神灵的启示。
后来又发现2的平方根是不合理的，因为它不能表示为两个整数比，极大地困扰毕达哥拉斯和他的追随者。
他们在自己的认知中，二是一些单位长度整数倍的长度。
因此2的平方根被认为是不合理的，他们就尝试了知识压制。
它甚至说，谁泄露了这个秘密在海上被淹死。
毕达哥拉斯定理是关于包含一个直角三角形的发言。
毕达哥拉斯定理指出，对一个直角三角形斜边为边长的正方形面积，等于剩余两直角为边长正方形面积的总和图1根据勾股定理，在两个红色正方形的面积之和A和B，等于蓝色的正方形面积，正方形三区因此，毕达哥拉斯定理指出的代数式是：对于一个直角三角形的边长a，b和c，其中c是斜边长度。
虽然记入史册的是著名的毕达哥拉斯定理，但是巴比伦人知道某些特定三角形的结果比毕达哥拉斯早一千年。
现在还不知道希腊人最初如何体现了勾股定理的证明。
如果用欧几里德的算法使用，很可能这是一个证明解剖类型类似于以下内容：六^维-论~文.网“一个大广场边a+ b是分成两个较小的正方形的边a和b分别与两个矩形A和B，这两个矩形各可分为两个相等的直角三角形，有相同的矩形对角线c。
四个三角形可安排在另一侧广场a+b中的数字显示。
在广场的地方就可以表现在两个不同的方式：1。
由于两个长方形和正方形面积的总和：2。
作为一个正方形的面积之和四个三角形：现在，建立上面2个方程，求解得因此，对c的平方等于a和b的平方和（伯顿1991）有许多的勾股定理其他证明方法。
一位来自当代中国人在中国现存最古老的含正式数学理论能找到对Gnoman和天坛圆路径算法的经典文本。
概率论与数理统计英文文献
Introduction to probability theory andmathematical statisticsThe theory of probability and the mathematical statistic are carries on deductive and the induction science to the stochastic phenomenon statistical rule, from the quantity side research stochastic phenomenon statistical regular foundation mathematics discipline, the theory of probability and the mathematical statistic may divide into the theory of probability and the mathematical statistic two branches. The probability uses for the possible size quantity which portrays the random event to occur. Theory of probability main content including classical generally computation, random variable distribution and characteristic numeral and limit theorem and so on. The mathematical statistic is one of mathematics Zhonglian department actually most directly most widespread branches, it introduced an estimate (rectangular method estimate, enormousestimate), the parameter supposition examination, the non-parameter supposition examination, the variance analysis and the multiple regression analysis, the fail-safe analysis and so on the elementary knowledge and the principle, enable the student to have a profound understanding tostatistics principle function. Through this curriculum study, enables the student comprehensively to understand, to grasp the theory of probability and the mathematical statistic thought and the method, grasps basic and the commonly used analysis and the computational method, and can studies in the solution economy and the management practice question using the theory of probability and the mathematical statistic viewpoint and the method.Random phenomenonFrom random phenomenon, in the nature and real life, some things are interrelated and continuous development. In the relationship between each other and developing, according to whether there is a causal relationship, very different can be divided into two categories: one is deterministic phenomenon. This kind of phenomenon is under certain conditions, will lead to certain results. For example, under normal atmospheric pressure, water heated to 100 degrees Celsius, is bound to a boil. This link is belong to the inevitability between things. Usually in natural science is interdisciplinary studies and know the inevitability, seeking this kind of inevitable phenomenon.Another kind is the phenomenon of uncertainty. This kind of phenomenon is under certain conditions, the resultis uncertain. The same workers on the same machine tools, for example, processing a number of the same kind of parts, they are the size of the there will always be a little difference. As another example, under the same conditions, artificial accelerating germination test of wheat varieties, each tree seed germination is also different, there is strength and sooner or later, respectively, and so on. Why in the same situation, will appear this kind of uncertain results? This is because, we say "same conditions" refers to some of the main conditions, in addition to these main conditions, there are many minor conditions and the accidental factor is people can't in advance one by one to grasp. Because of this, in this kind of phenomenon, we can't use the inevitability of cause and effect, the results of individual phenomenon in advance to make sure of the answer. The relationship between things is belong to accidental, this phenomenon is called accidental phenomenon, or a random phenomenon.In nature, in the production, life, random phenomenon is very common, that is to say, there is a lot of random phenomenon. Issue such as: sports lottery of the winning Numbers, the same production line production, the life of the bulb, etc., is a random phenomenon. So we say: randomphenomenon is: under the same conditions, many times the same test or survey the same phenomenon, the results are not identical, and unable to accurately predict the results of the next. Random phenomena in the uncertainties of the results, it is because of some minor, caused by the accidental factors.Random phenomenon on the surface, seems to be messy, there is no regular phenomenon. But practice has proved that if the same kind of a large number of repeated random phenomenon, its overall present certain regularity. A large number of similar random phenomena of this kind of regularity, as we observed increase in the number of the number of times and more obvious. Flip a coin, for example, each throw is difficult to judge on that side, but if repeated many times of toss the coin, it will be more and more clearly find them up is approximately the same number.We call this presented by a large number of similar random phenomena of collective regularity, is called the statistical regularity. Probability theory and mathematical statistics is the study of a large number of similar random phenomena statistical regularity of the mathematical disciplines.The emergence and development of probability theoryProbability theory was created in the 17th century, it is by the development of insurance business, but from the gambler's request, is that mathematicians thought the source of problem in probability theory.As early as in 1654, there was a gambler may tired to the mathematician PASCAL proposes a question troubling him for a long time: "meet two gamblers betting on a number of bureau, who will win the first m innings wins, all bets will be who. But when one of them wins a (a < m), the other won b (b < m) bureau, gambling aborted. Q: how should bets points method is only reasonable?" Who in 1642 invented the world's first mechanical addition of computer.Three years later, in 1657, the Dutch famous astronomy, physics, and a mathematician huygens is trying to solve this problem, the results into a book concerning the calculation of a game of chance, this is the earliest probability theory works.In recent decades, with the vigorous development of science and technology, the application of probability theory to the national economy, industrial and agricultural production and interdisciplinary field. Many of applied mathematics, such as information theory, game theory, queuing theory, cybernetics, etc., are based on the theory of probability.Probability theory and mathematical statistics is a branch of mathematics, random they similar disciplines are closely linked. But should point out that the theory of probability and mathematical statistics, statistical methods are each have their own contain different content.Probability theory, is based on a large number of similar random phenomena statistical regularity, the possibility that a result of random phenomenon to make an objective and scientific judgment, the possibility of its occurrence for this size to make quantitative description; Compare the size of these possibilities, study the contact between them, thus forming a set of mathematical theories and methods.Mathematical statistics - is the application of probability theory to study the phenomenon of large number of random regularity; To through the scientific arrangement of a number of experiments, the statistical method given strict theoretical proof; And determining various methods applied conditions and reliability of the method, the formula, the conclusion and limitations. We can from a set of samples to decide whether can with quite large probability to ensure that a judgment is correct, and can control the probability of error.- is a statistical method provides methods are used in avariety of specific issues, it does not pay attention to the method according to the theory, mathematical reasoning.Should point out that the probability and statistics on the research method has its particularity, and other mathematical subject of the main differences are:First, because the random phenomena statistical regularity is a collective rule, must to present in a large number of similar random phenomena, therefore, observation, experiment, research is the cornerstone of the subject research methods of probability and statistics. But, as a branch of mathematics, it still has the definition of this discipline, axioms, theorems, the definitions and axioms, theorems are derived from the random rule of nature, but these definitions and axioms, theorems is certain, there is no randomness.Second, in the study of probability statistics, using the "by part concluded all" methods of statistical inference. This is because it the object of the research - the range of random phenomenon is very big, at the time of experiment, observation, not all may be unnecessary. But by this part of the data obtained from some conclusions, concluded that the reliability of the conclusion to all the scope.Third, the randomness of the random phenomenon, refers to the experiment, investigation before speaking. After the real results for each test, it can only get the results of the uncertainty of a certain result. When we study this phenomenon, it should be noted before the test can find itself inherent law of this phenomenon.The content of the theory of probabilityProbability theory as a branch of mathematics, it studies the content general include the probability of random events, the regularity of statistical independence and deeper administrative levels.Probability is a quantitative index of the possibility of random events. In independent random events, if an event frequency in all events, in a larger range of stable around a fixed constant. You can think the probability of the incident to the constant. For any event probability value must be between 0 and 1.There is a certain type of random events, it has two characteristics: first, only a finite number of possible results; Second, the results the possibility of the same. Have the characteristics of the two random phenomenon called"classical subscheme".In the objective world, there are a large number of random phenomena, the result of a random phenomenon poses a random event. If the variable is used to describe each random phenomenon as a result, is known as random variables.Random variable has a finite and the infinite, and according to the variable values is usually divided into discrete random variables and the discrete random variable. List all possible values can be according to certain order, such a random variable is called a discrete random variable; If possible values with an interval, unable to make the order list, the random variable is called a discrete random variable.The content of the mathematical statisticsIncluding sampling, optimum line problem of mathematical statistics, hypothesis testing, analysis of variance, correlation analysis, etc. Sampling inspection is to pair through sample investigation, to infer the overall situation. Exactly how much sampling, this is a very important problem, therefore, is produced in the sampling inspection "small sample theory", this is in the case of the sample is small, the analysis judgment theory.Also called curve fitting and optimal line problem. Some problems need to be according to the experience data to find a theoretical distribution curve, so that the whole problem get understanding. But according to what principles and theoretical curve? How to compare out of several different curve in the same issue? Selecting good curve, is how to determine their error? ...... Is belong to the scope of the optimum line issues of mathematical statistics.Hypothesis testing is only at the time of inspection products with mathematical statistical method, first make a hypothesis, according to the result of sampling in reliable to a certain extent, to judge the null hypothesis.Also called deviation analysis, variance analysis is to use the concept of variance to analyze by a handful of experiment can make the judgment.Due to the random phenomenon is abundant in human practical activities, probability and statistics with the development of modern industry and agriculture, modern science and technology and continuous development, which formed many important branch. Such as stochastic process, information theory, experimental design, limit theory, multivariate analysis, etc.译文：概率论和数理统计简介概率论与数理统计是对随机现象的统计规律进行演绎和归纳的科学，从数量侧面研究随机现象的统计规律性的基础数学学科，概率论与数理统计又可分为概率论和数理统计两个分支。
数学与应用数学专业论文英文文献翻译
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 cu bic named “pchip”.3.1 The Interpolating PolynomialWe all know that two points determine a straight line. More precisely, any two points in the plane, ),(11y x and ),(11y x , with )(21x x ≠ , determine a unique first degree polynomial in x whose graph passes through the two points. There are many different formulas for the polynomial, but they all lead to the same straight line graph.This generalizes to more than two points. Given n points in the plane, ),(k k y x ，n k ,,2,1 =, with distinct k x ’s, there is a uniquepolynomial in x of degree less than n whose graph passes through the points. It is easiest to remember that n , the number of data points, is also the number of coefficients, although some of the leading coefficients might be zero, so the degree might actually be less than 1-n . 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 exactlyre- produces the given data.n k y x P k k ,,2,1,)( ==，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.∑∏⎪⎪⎭⎫ ⎝⎛--=≠k k k j j k j y x x x x x P )( There are n terms in the sum and 1-n terms in each product, so this expression defines a polynomial of degree at most 1-n . If )(x P is evaluated at k x x = , all the products except the k th are zero. Furthermore, the k th product is equal to one, so the sum is equal to k y and the interpolationconditions are satisfied.For example, consider the following data set:x=0:3;y=[-5 -6 -1 16];The commanddisp([x;y])displays0 1 2 3-5 -6 -1 16 The Lagrangian form of the polynomial interpolating this data is)16()6()2)(1()1()2()3)(1()6()2()3)(2()5()6()3)(2)(1()(--+----+---+-----=x x x x x x x x x x x x x P We 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 2,1,0=x or 3, three of the terms vanish 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 like523--x xThe simple powers of x are called monomials and this form of a polynomial is said to be using the power form.The coefficients of an interpolating polynomial using its power form,n n n n c x c x c x c x P ++++=---12211)(can, in principle, be computed by solving a system of simultaneous linear equations⎥⎥⎥⎥⎦⎤⎢⎢⎢⎢⎣⎡=⎥⎥⎥⎥⎦⎤⎢⎢⎢⎢⎣⎡⎥⎥⎥⎥⎥⎦⎤⎢⎢⎢⎢⎢⎣⎡------n n n n n n n n n n n y y y c c c x x x x x x x x x 21212122212121111111 The matrix V of this linear system is known as a Vandermonde matrix. Its elements arej n kj k x v -=, The columns of a Vandermonde matrix are sometimes written in the opposite 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 =0 0 0 11 1 1 18 4 2 127 9 3 1Thenc = V\y’computes the coefficientsc =1.00000.0000-2.0000-5.0000In fact, the example data was generated from the polynomial 523--x x .One of the exercises asks you to show that Vandermonde matrices are nonsin- gular if the points k x are distinct. But another one of the exercisesasks you to show that a Vandermonde matrix can be very badly conditioned. Consequently, using the power form 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 calling sequencev = interp(x,y,u)The first two input arguments, x and y , are vectors of the same length that define the interpolating points. The third input argument, u , is a vector ofpoints where the function is to be evaluated. The output, v, is the same length as u and has elements ))xterpkvyin(k,(,()uOur first such 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:n]w = (u-x(j))./(x(k)-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 + 2)x-1/2 (-x + 3)(x - 1)x + 16/3 (x - 2)(1/2 x - 1/2)xThis expression is a rearrangement of the Lagrange form of the interpolating poly- nomial. Simplifying the Lagrange form withP = simplify(P)changes P to the power formP =x^3-2*x-5Here is another example, with a data set that is used by the other methods in this chapter.x = 1:6;y = [16 18 21 17 15 12];disp([x; y])u = .75:.05:6.25;v = polyinterp(x,y,u);plot(x,y,’o’,u,v,’-’);produces1 2 3 4 5 616 18 21 17 15 12creates figure 3.2.Figure 3.2. Full degree polynomial interpolation Already in this example, with only six nicely spaced points, we can begin to see the primary difficulty with full-degree polynomial interpolation. In between the data points, especially in the first and last subintervals, the function shows excessive variation. It overshoots the changes in the data values. As a result, full- degree polynomial interpolation is hardly ever usedfor data and curve fitting. Its primary application is in the derivation of other numerical methods.第三章 插值多项式插值就是定义一个在特定点取给定值得函数的过程。
数学与应用数学英文文献及翻译
（外文翻译从原文第一段开始翻译，翻译了约2000字）勾股定理是已知最早的古代文明定理之一。
这个著名的定理被命名为希腊的数学家和哲学家毕达哥拉斯。
毕达哥拉斯在意大利南部的科托纳创立了毕达哥拉斯学派。
他在数学上有许多贡献，虽然其中一些可能实际上一直是他学生的工作。
毕达哥拉斯定理是毕达哥拉斯最著名的数学贡献。
据传说，毕达哥拉斯在得出此定理很高兴，曾宰杀了牛来祭神，以酬谢神灵的启示。
后来又发现2的平方根是不合理的，因为它不能表示为两个整数比，极大地困扰毕达哥拉斯和他的追随者。
他们在自己的认知中，二是一些单位长度整数倍的长度。
因此2的平方根被认为是不合理的，他们就尝试了知识压制。
它甚至说，谁泄露了这个秘密在海上被淹死。
毕达哥拉斯定理是关于包含一个直角三角形的发言。
毕达哥拉斯定理指出，对一个直角三角形斜边为边长的正方形面积，等于剩余两直角为边长正方形面积的总和图1根据勾股定理，在两个红色正方形的面积之和A和B，等于蓝色的正方形面积，正方形三区因此，毕达哥拉斯定理指出的代数式是：对于一个直角三角形的边长a，b和c，其中c是斜边长度。
虽然记入史册的是著名的毕达哥拉斯定理，但是巴比伦人知道某些特定三角形的结果比毕达哥拉斯早一千年。
现在还不知道希腊人最初如何体现了勾股定理的证明。
如果用欧几里德的算法使用，很可能这是一个证明解剖类型类似于以下内容：六^维-论~文.网“一个大广场边a+ b是分成两个较小的正方形的边a和b分别与两个矩形A和B，这两个矩形各可分为两个相等的直角三角形，有相同的矩形对角线c。
四个三角形可安排在另一侧广场a+b中的数字显示。
在广场的地方就可以表现在两个不同的方式：1。
由于两个长方形和正方形面积的总和：2。
作为一个正方形的面积之和四个三角形：现在，建立上面2个方程，求解得因此，对c的平方等于a和b的平方和（伯顿1991）有许多的勾股定理其他证明方法。
一位来自当代中国人在中国现存最古老的含正式数学理论能找到对Gnoman和天坛圆路径算法的经典文本。
数学与应用数学专业论文英文文献翻译
数学与应用数学专业论文英文文献翻译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.1 The Interpolating PolynomialWe all know that two points determine a straight line. More precisely, any two points in the plane, ),(11y x and ),(11y x , with )(21x x ≠ , determine a unique first degree polynomial in x whose graph passes through the two points. There are many different formulas for the polynomial, but they all lead to the same straight line graph.This generalizes to more than two points. Given n points in the plane, ),(k k y x ，n k ,,2,1 =, with distinct k x ’s, there is aunique polynomial in x of degree less than n whose graph passes through the points. It is easiest to remember that n , the number of data points, is also the number of coefficients, although some of the leading coefficients might be zero, so the degree might actually be less than 1-n . 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 the given data.n k y x P k k ,,2,1,)( ==，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.∑∏⎪⎪⎭⎫ ⎝⎛--=≠k k k j j k j y x x x x x P )( There are n terms in the sum and 1-n terms in each product, so this expression defines a polynomial of degree at most 1-n . If )(x P is evaluated at k x x = , all the products except the k th are zero. Furthermore, the k th product is equal to one, so the sum is equal to k y and theinterpolation conditions are satisfied.For example, consider the following data set:x=0:3;y=[-5 -6 -1 16];The commanddisp([x;y])displays0 1 2 3-5 -6 -1 16 The Lagrangian form of the polynomial interpolating this data is)16()6()2)(1()1()2()3)(1()6()2()3)(2()5()6()3)(2)(1()(--+----+---+-----=x x x x x x x x x x x x x P We 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 2,1,0=x or 3, three of the terms vanish 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 like523--x xThe simple powers of x are called monomials and this form of a polynomial is said to be using the power form.The coefficients of an interpolating polynomial using its power form,n n n n c x c x c x c x P ++++=---12211)(can, in principle, be computed by solving a system of simultaneous linear equations⎥⎥⎥⎥⎦⎤⎢⎢⎢⎢⎣⎡=⎥⎥⎥⎥⎦⎤⎢⎢⎢⎢⎣⎡⎥⎥⎥⎥⎥⎦⎤⎢⎢⎢⎢⎢⎣⎡------n n n n n n n n n n n y y y c c c x x x x x x x x x 21212122212121111111 The matrix V of this linear system is known as a Vandermonde matrix. Its elements arej n kj k x v -=, The columns of a Vandermonde matrix are sometimes written in the opposite 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 =0 0 0 11 1 1 18 4 2 127 9 3 1Thenc = V\y’computes the coefficientsc =1.00000.0000-2.0000-5.0000In fact, the example data was generated from the polynomial 523--x x .One of the exercises asks you to show that Vandermonde matrices are nonsin- gular if the points k x are distinct. But another one of theexercises asks you to show that a Vandermonde matrix can be very badly conditioned. Consequently, using the power form 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 calling sequencev = interp(x,y,u)The first two input arguments, x and y, are vectors of the same length that define the interpolating points. The third input argument, u, is a vector of points where the function is to be evaluated. The output, v, is the same length as u and has elements ))xterpyvuink(k(,,)(Our first such 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:n]w = (u-x(j))./(x(k)-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 + 2)x-1/2 (-x + 3)(x - 1)x + 16/3 (x - 2)(1/2 x - 1/2)xThis expression is a rearrangement of the Lagrange form of the interpolating poly- nomial. Simplifying the Lagrange form withP = simplify(P)changes P to the power formP =x^3-2*x-5Here is another example, with a data set that is used by the other methods in this chapter.x = 1:6;y = [16 18 21 17 15 12];disp([x; y])u = .75:.05:6.25;v = polyinterp(x,y,u);plot(x,y,’o’,u,v,’-’);produces1 2 3 4 5 616 18 21 17 15 12creates figure 3.2.Figure 3.2. Full degree polynomial interpolation Already in this example, with only six nicely spaced points, we canbegin to see the primary difficulty with full-degree polynomial interpolation. In between the data points, especially in the first and last subintervals, the function shows excessive variation. It overshoots the changes in the data values. As a result, full- degree polynomial interpolation is hardly ever used for data and curve fitting. Its primary application is in the derivation of other numerical methods.第三章 插值多项式插值就是定义一个在特定点取给定值得函数的过程。
数学专业英语论文(含中文版)
Some Properties of Solutions of Periodic Second OrderLinear Differential Equations1. Introduction and main resultsIn this paper, we shall assume that the reader is familiar with the fundamental results and the stardard notations of the Nevanlinna's value distribution theory of meromorphic functions [12, 14, 16]. In addition, we will use the notation )(f σ，)(f μand )(f λto denote respectively the order of growth, the lower order of growth and the exponent of convergence of the zeros of a meromorphic function f ，)(f e σ（[see 8]），the e-type order of f(z), is defined to berf r T f r e ),(log lim)(+∞→=σSimilarly, )(f e λ，the e-type exponent of convergence of the zeros of meromorphic function f , is defined to berf r N f r e )/1,(loglim)(++∞→=λWe say that )(z f has regular order of growth if a meromorphic function )(z f satisfiesrf r T f r log ),(log lim)(+∞→=σWe consider the second order linear differential equation0=+''Af fWhere )()(z e B z A α=is a periodic entire function with period απω/2i =. The complex oscillation theory of (1.1) was first investigated by Bank and Laine [6]. Studies concerning (1.1) have een carried on and various oscillation theorems have been obtained [2{11, 13, 17{19].When )(z A is rational in ze α，Bank and Laine [6] proved the following theoremTheorem A Let )()(z e B z A α=be a periodic entire function with period απω/2i = and rational in zeα.If )(ζB has poles of odd order at both ∞=ζ and 0=ζ, then for everysolution )0)((≠z f of (1.1), +∞=)(f λBank [5] generalized this result: The above conclusion still holds if we just suppose that both ∞=ζ and 0=ζare poles of )(ζB , and at least one is of odd order. In addition, the stronger conclusion)()/1,(l o g r o f r N ≠+ (1.2) holds. When )(z A is transcendental in ze α, Gao [10] proved the following theoremTheorem B Let ∑=+=p j jj b g B 1)/1()(ζζζ,where )(t g is a transcendental entire functionwith 1)(<g σ, p is an odd positive integer and 0≠p b ，Let )()(ze B z A =.Then anynon-trivia solution f of (1.1) must have +∞=)(f λ. In fact, the stronger conclusion (1.2) holds.An example was given in [10] showing that Theorem B does not hold when )(g σis any positive integer. If the order 1)(>g σ , but is not a positive integer, what can we say? Chiang and Gao [8] obtained the following theoremsTheorem 1 Let )()(ze B z A α=,where )()/1()(21ζζζg g B +=,1g and 2g are entire functions with 2g transcendental and )(2g μnot equal to a positive integer or infinity, and 1g arbitrary. If Some properties of solutions of periodic second order linear differential equations )(z f and )2(i z f π+are two linearly independent solutions of (1.1), then+∞=)(f e λOr2)()(121≤+--g f e μλWe remark that the conclusion of Theorem 1 remains valid if we assume )(1g μ isnotequaltoapositiveintegerorinfinity,and2g arbitraryand stillassume )()/1()(21ζζζg g B +=,In the case when 1g is transcendental with its lower order not equal to an integer or infinity and 2g is arbitrary, we need only to consider )/1()()/1()(*21ηηηηg g B B +==in +∞<<η0,ζη/1<.Corollary 1 Let )()(z e B z A α=,where )()/1()(21ζζζg g B +=,1g and 2g are entire functions with 2g transcendental and )(2g μno more than 1/2, and 1g arbitrary.(a) If f is a non-trivial solution of (1.1) with +∞<)(f e λ,then )(z f and )2(i z f π+are linearly dependent.(b)If 1f and 2f are any two linearly independent solutions of (1.1), then +∞=)(21f f e λ.Theorem 2 Let )(ζg be a transcendental entire function and its lower order be no more than 1/2. Let )()(z e B z A =,where ∑=+=p j jj b g B 1)/1()(ζζζand p is an odd positive integer,then +∞=)(f λ for each non-trivial solution f to (1.1). In fact, the stronger conclusion (1.2) holds.We remark that the above conclusion remains valid if∑=--+=pj jjbg B 1)()(ζζζWe note that Theorem 2 generalizes Theorem D when )(g σis a positive integer or infinity but2/1)(≤g μ. Combining Theorem D with Theorem 2, we haveCorollary 2 Let )(ζg be a transcendental entire function. Let )()(z e B z A = where ∑=+=p j jj b g B 1)/1()(ζζζand p is an odd positive integer. Suppose that either (i) or (ii)below holds:(i) )(g σ is not a positive integer or infinity; (ii) 2/1)(≤g μ;then +∞=)(f λfor each non-trivial solution f to (1.1). In fact, the stronger conclusion (1.2) holds.2. Lemmas for the proofs of TheoremsLemma 1 ([7]) Suppose that 2≥k and that 20,.....-k A A are entire functions of period i π2,and that f is a non-trivial solution of0)()()(2)(=+∑-=k i j j z yz A k ySuppose further that f satisfies )()/1,(logr o f r N =+; that 0A is non-constant and rationalin ze ，and that if 3≥k ，then 21,.....-k A A are constants. Then there exists an integer qwith k q ≤≤1 such that )(z f and )2(i q z f π+are linearly dependent. The same conclusionholds if 0A is transcendental in ze ，andf satisfies )()/1,(logr o f r N =+，and if 3≥k ，thenas ∞→r through a set1L of infinite measure, wehave )),((),(j j A r T o A r T =for 2,.....1-=k j .Lemma 2 ([10]) Let )()(z e B z A α=be a periodic entire function with period 12-=απωi and betranscendental in z e α, )(ζB is transcendental and analytic on +∞<<ζ0.If )(ζB has a pole of odd order at ∞=ζ or 0=ζ(including those which can be changed into this case by varying the period of )(z A and Eq . (1.1) has a solution 0)(≠z f which satisfies )()/1,(logr o f r N =+,then )(z f and )(ω+z f are linearly independent. 3. Proofs of main resultsThe proof of main results are based on [8] and [15].Proof of Theorem 1 Let us assume +∞<)(f e λ.Since )(z f and )2(i z f π+are linearly independent, Lemma 1 implies that )(z f and )4(i z f π+must be linearly dependent. Let )2()()(i z f z f z E π+=,Then )(z E satisfies the differential equation222)()()(2))()(()(4z E cz E z E z E z E z A -''-'=, (2.1)Where 0≠c is the Wronskian of 1f and 2f (see [12, p. 5] or [1, p. 354]), and )()2(1z E c i z E =+πor some non-zero constant 1c .Clearly, E E /'and E E /''are both periodic functions with period i π2,while )(z A is periodic by definition. Hence (2.1) shows that 2)(z E is also periodic with period i π2.Thus we can find an analytic function )(ζΦin +∞<<ζ0,so that )()(2z e z E Φ=Substituting this expression into (2.1) yieldsΦΦ''+ΦΦ'-ΦΦ'+Φ=-2222)(43)(4ζζζζcB (2.2)Since both )(ζB and )(ζΦare analytic in }{+∞<<=ζζ1:*C ,the V aliron theory [21, p. 15] gives their representations as)()()(ζζζζb R B n =，)()()(11ζφζζζR n =Φ， （2.3）where n ，1n are some integers, )(ζR and )(1ζR are functions that are analytic and non-vanishing on }{*∞⋃C ，)(ζb and )(ζφ are entire functions. Following the same arguments as used in [8], we have),(),()/1,(),(φρρφρφρS b T N T ++=， （2.4） where )),((),(φρφρT o S =.Furthermore, the following properties hold [8])}(),(max{)()()(222E E E E f eL eR e e e λλλλλ===,)()()(12φλλλ=Φ=E eR ,Where )(2E eR λ(resp, )(2E eL λ) is defined to berE r N R r )/1,(loglim2++∞→(resp, rE r N R r )/1,(loglim2++∞→),Some properties of solutions of periodic second order linear differential equationswhere )/1,(2E r N R (resp. )/1,(2E r N L denotes a counting function that only counts the zeros of 2)(z E in the right-half plane (resp. in the left-half plane), )(1Φλis the exponent of convergence of the zeros of Φ in *C , which is defined to beρρλρlog )/1,(loglim)(1Φ=Φ++∞→NRecall the condition +∞<)(f e λ,we obtain +∞<)(φλ.Now substituting (2.3) into (2.2) yields+'+'+-'+'++=-21112111112)(43)()()()()(4φφζζφφζζζφζζζζζR R n R R n R cb R n n)222)1((1111111112112φφφφζφφζφφζζζ''+''+'''+''+'+'+-R R R R R n R R n n n （2.5）Proof of Corollary 1 We can easily deduce Corollary 1 (a) from Theorem 1 .Proof of Corollary 1 (b). Suppose 1f and 2f are linearlyindependentand +∞<)(21f f e λ,then +∞<)(1f e λ,and +∞<)(2f e λ.We deduce from the conclusion of Corollary 1 (a) that )(z f j and )2(i z f j π+are linearly dependent, j = 1; 2.Let)()()(21z f z f z E =.Then we can find a non-zero constant2c suchthat )()2(2z E c i z E =+π.Repeating the same arguments as used in Theorem 1 by using the fact that 2)(z E is also periodic, we obtain2)()(121≤+--g E e μλ,a contradiction since 2/1)(2≤g μ.Hence +∞=)(21f f e λ.Proof of Theorem 2 Suppose there exists a non-trivial solution f of (1.1) that satisfies)()/1,(logr o f r N =+. We deduce 0)(=f e λ, so )(z f and )2(i z f π+ are linearlydependent by Corollary 1 (a). However, Lemma 2 implies that )(z f and )2(i z f π+are linearly independent. This is a contradiction. Hence )()/1,(log r o f r N ≠+holds for each non-trivial solution f of (1.1). This completes the proof of Theorem 2.Acknowledgments The authors would like to thank the referees for helpful suggestions to improve this paper. References[1] ARSCOTT F M. Periodic Di®erential Equations [M]. The Macmillan Co., New Y ork, 1964. [2] BAESCH A. On the explicit determination of certain solutions of periodic differentialequations of higher order [J]. Results Math., 1996, 29(1-2): 42{55.[3] BAESCH A, STEINMETZ N. Exceptional solutions of nth order periodic linear differentialequations [J].Complex V ariables Theory Appl., 1997, 34(1-2): 7{17.[4] BANK S B. On the explicit determination of certain solutions of periodic differential equations[J]. Complex V ariables Theory Appl., 1993, 23(1-2): 101{121.[5] BANK S B. Three results in the value-distribution theory of solutions of linear differentialequations [J].Kodai Math. J., 1986, 9(2): 225{240.[6] BANK S B, LAINE I. Representations of solutions of periodic second order linear differentialequations [J]. J. Reine Angew. Math., 1983, 344: 1{21.[7] BANK S B, LANGLEY J K. Oscillation theorems for higher order linear differential equationswith entire periodic coe±cients [J]. Comment. Math. Univ. St. Paul., 1992, 41(1): 65{85.[8] CHIANG Y M, GAO Shi'an. On a problem in complex oscillation theory of periodic secondorder lineardifferential equations and some related perturbation results [J]. Ann. Acad. Sci. Fenn. Math., 2002, 27(2):273{290.一些周期性的二阶线性微分方程解的方法1． 简介和主要成果在本文中，我们假设读者熟悉的函数的数值分布理论[12，14，16]的基本成果和数学符号。
- 1、下载文档前请自行甄别文档内容的完整性，平台不提供额外的编辑、内容补充、找答案等附加服务。
- 2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
- 3、如文档侵犯您的权益，请联系客服反馈,我们会尽快为您处理(人工客服工作时间：9:00-18:30)。
毕业设计（论文）外文文献翻译文献、资料中文题目：概率论的发展文献、资料英文题目：The development of probabilitytheory文献、资料来源：文献、资料发表（出版）日期：院（部）：专业：数学与应用数学班级：姓名：学号：指导教师：翻译日期： 2017.02.14毕业论文（设计）英文文献翻译外文文献The development of probability theorySummaryThis paper consist therefore of two parts: The first is concerned with the development of the calyculus of chance before Bernoulli in order to provide a background for the achievement of Ja kob Bernoulli and will emphasize especially the role of Leibniz. The second part deals with the relationship between Leibniz add Bernoulli an d with Bernoulli himself, particularly with the question how it came about that he introduced probability into mathematics.First some preliminary remarks:Ja kob Bernoulli is of special interest to me, because he is the founder of a mathematical theory of probability. That is to say that it is mainly due to him that a concept of probability was introduced into a field of mathematics.TextMathematics could call the calculus of games of chance before Bernoulli. This has another consequence that makes up for a whole programme: The mathematical tools of this calculus should be applied in the whole realm of areas which used a concept of probability. In other words，the Bernoullian probability theory should be applied not only togames of chance and mortality questions but also to fields like jurisprudence, medicine, etc.My paper consists therefore of two parts: The first is concerned with the development of the calculus of chance before Bernoulli in order to provide a background or the achievements of Ja kob Bernoulli and will emphasize especially the role of Leibniz. The second part deals with the relationship between Leibniz and Bernoulli and Bernoulli himself, particularly with the question how it came about that he introduced probability into mathematics.Whenever one asks why something like a calculus of probabilities arose in the 17th century, one already assumes several things: for instance that before the 17th century it did not exist, and that only then and not later did such a calculus emerge. If one examines the quite impressive literature on the history of probability, one finds that it is by no means a foregone conclusion that there was no calculus of probabilities before the 17th century. Even if one disregards numerous references to qualitative and quantitative inquiries in antiquity and among the Arabs and the Jews, which, rather freely interpreted, seem to suggest the application of a kind of probability-concept or the use of statistical methods, it is nevertheless certain that by the end of the 15th century an attempt was being interpreted.People made in some arithmetic works to solve problems of games of chance by computation. But since similar problems form the major part of the early writings on probability in the 17th century, one may be induced to ask why then a calculus of probabilities did not emerge in the late 15th century. One could say many things: For example, that these early game calculations in fact represent one branch of a development which ultimately resulted in a calculus of probabilities. Then why shouldn't one place the origin of the calculus of probabilities before the 17th after all? Quite simply because a suitable concept of probability was missing from the earlier computations. Once the calculus of probabilities had beendeveloped, it became obvious that the older studies of games of chance formed a part of the new discipline.We need not consider the argument that practically all the solutions of problems of games of chance proposed in the 15th and 16th centuries could have been viewed as inexact, and thus at best as approximate, by Fermat in the middle of the 17th century, that is, before the emergence of a calculus of probabilities.The assertion that no concept of probability was applied to games of chance up to the middle of the 17th century can mean either that there existed no concept of probability (or none suitable), or that though such a concept existed it was not applied to games of chance. I consider the latter to be correct, and in this I differ from Hacking, who argues that an appropriate concept of probability was first devised in the 17th century.I should like to mention that Hacking(Mathematician)and I agree ona number of points. For instance, on the significance of the legal tradition and of the practical ("-low") sciences: Hacking makes such factors responsible for the emergence of a new concept of probability, suited to a game calculus, while perceive them as bringing about the transfer and quantification of a pre-existent probability-concept.译文概率论的发展作者；龙腾施耐德摘要本文由两部分构成：首先是提供了一个为有关与发展雅各布 - 前伯努利相关背景，雅各布对数学做出了不可磨灭的贡献。