期刊文献+
共找到6篇文章
< 1 >
每页显示 20 50 100
LEIBNIZ′FORMULA OF GENERALIZED DIFFERENCE WITH RESPECT TO A CLASS OF DIFFERENTIAL OPERATORS AND RECURRENCE FORMULA OF THEIR GREEN′S FUNCTION 被引量:1
1
作者 许跃生 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI 1984年第3期1359-1364,共6页
In this paper, Leibniz' formula of generalized divided difference with respect to a class of differential operators whose basic sets of solutions have power form, is considered. The recurrence formula of Green fun... In this paper, Leibniz' formula of generalized divided difference with respect to a class of differential operators whose basic sets of solutions have power form, is considered. The recurrence formula of Green function about the operators is also given. 展开更多
关键词 LEIBNIZ S FUNCTION formula OF GENERALIZED DIFFERENCE WITH RESPECT TO A CLASS OF DIFFERENTIAL OPERATORS AND recurrence formula OF THEIR GREEN
下载PDF
SOME RECURRENCE FORMULAS FOR BOX SPLINES AND CONE SPLINES
2
作者 Patrick J. Van Fleet (University of St. Thomas, USA) 《Approximation Theory and Its Applications》 2002年第1期81-89,共9页
A degree elevation formula for multivariate simplex splines was given by Micchelli [6] and extended to hold for multivariate Dirichlet splines in [8]. We report similar formulae for multivariate cone splines and box-s... A degree elevation formula for multivariate simplex splines was given by Micchelli [6] and extended to hold for multivariate Dirichlet splines in [8]. We report similar formulae for multivariate cone splines and box-splines. To this end, we utilixe a relation due to Dahmen and Micchelli [4] that connects box splines and cone splines and a degree reduction formula given by Cohen , Lyche, and Riesenfcld in [2]. 展开更多
关键词 TH SOME recurrence formulaS FOR BOX SPLINES AND CONE SPLINES FIGURE
下载PDF
The Convergences Comparison between the Halley’s Method and Its Extended One Based on Formulas Derivation and Numerical Calculations
3
作者 Shunji Horiguchi 《Applied Mathematics》 2016年第18期2394-2410,共17页
The purpose of this paper is that we give an extension of Halley’s method (Section 2), and the formulas to compare the convergences of the Halley’s method and extended one (Section 3). For extension of Halley’s met... The purpose of this paper is that we give an extension of Halley’s method (Section 2), and the formulas to compare the convergences of the Halley’s method and extended one (Section 3). For extension of Halley’s method we give definition of function by variable transformation in Section 1. In Section 4 we do the numerical calculations of Halley’s method and extended one for elementary functions, compare these convergences, and confirm the theory. Under certain conditions we can confirm that the extended Halley’s method has better convergence or better approximation than Halley’s method. 展开更多
关键词 recurrence formula Newton’s Method Halley’s Method Extension of Halley’s Method Third-Order Convergence
下载PDF
The Formulas to Compare the Convergences of Newton’s Method and the Extended Newton’s Method (Tsuchikura-Horiguchi Method) and the Numerical Calculations
4
作者 Shunji Horiguchi 《Applied Mathematics》 2016年第1期40-60,共21页
This paper gives the extension of Newton’s method, and a variety of formulas to compare the convergences for the extension of Newton’s method (Section 4). Section 5 gives the numerical calculations. Section 1 introd... This paper gives the extension of Newton’s method, and a variety of formulas to compare the convergences for the extension of Newton’s method (Section 4). Section 5 gives the numerical calculations. Section 1 introduces the three formulas obtained from the cubic equation of a hearth by Murase (Ref. [1]). We find that Murase’s three formulas lead to a Horner’s method (Ref. [2]) and extension of a Newton’s method (2009) at the same time. This shows originality of Wasan (mathematics developed in Japan) in the Edo era (1603-1868). Suzuki (Ref. [3]) estimates Murase to be a rare mathematician in not only the history of Wasan but also the history of mathematics in the world. Section 2 gives the relations between Newton’s method, Horner’s method and Murase’s three formulas. Section 3 gives a new function defined such as . 展开更多
关键词 recurrence formula Newton-Raphson’s Method (Newton’s Method) Extension of Newton’s Method
下载PDF
Note on Barenblatt power series solution to Boussinesq equation
5
作者 宋志尧 李凌 David Lockington 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI 2007年第6期823-828,共6页
To the serf-similar analytical solution of the Boussinesq equation of groundwater flow in a semi-infinite porous medium, when the hydraulic head at the boundary behaved like a power of time, Barenblatt obtained a powe... To the serf-similar analytical solution of the Boussinesq equation of groundwater flow in a semi-infinite porous medium, when the hydraulic head at the boundary behaved like a power of time, Barenblatt obtained a power series solution. However, he listed only the first three coefficients and did not give the recurrent formula among the coefficients. A formal proof of convergence of the series did not appear in his works. In this paper, the recurrent formula for the coefficients is obtained by using the method of power series expansion, and the convergence of the series is proven. The results can be easily understood and used by engineers in the catchment hydrology and baseflow studies as well as to solve agricultural drainage problems. 展开更多
关键词 power series expansion similarity solution recurrent formula CONVERGENCE
下载PDF
A Study on Social Choice Making:the Number of Admissible Preference Orderings for SMV
6
作者 LUO Yunfeng XIAO Renbin YUE Chaoyuan Institute of Systems Engineering, Huazhong University of Science and Technology 《Systems Science and Systems Engineering》 CSCD 1993年第4期318-325,共8页
In this paper, we study, mathematically speaking, the problem-the number of admissible preference orderings for the transitivity of simple majority vote(SMV) derived from Arrow’s Impossibility Theorem. In our researc... In this paper, we study, mathematically speaking, the problem-the number of admissible preference orderings for the transitivity of simple majority vote(SMV) derived from Arrow’s Impossibility Theorem. In our research, we find, by computer enumerating, that some results given by Craven are not correct. By defining a set of constraints, we give the recurrence formula of the local maximal number of admissible preference orderings and some other useful results. 展开更多
关键词 the number of admissible preference orderings simple majority vote(SMV) conditions of transitivity for SMV the recurrence formula.
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部