The general recurrence relation for divided differences and the general Newton-interpolation-algorithm with applications to trigonometric interpolation

1979 ◽  
Vol 32 (4) ◽  
pp. 393-408 ◽  
Author(s):  
G. M�hlbach
2012 ◽  
Vol 2012 ◽  
pp. 1-17 ◽  
Author(s):  
Aimin Xu

We employ the generalized factorials to define a Stirling-type pair{s(n,k;α,β,r),S(n,k;α,β,r)}which unifies various Stirling-type numbers investigated by previous authors. We make use of the Newton interpolation and divided differences to obtain some basic properties of the generalized Stirling numbers including the recurrence relation, explicit expression, and generating function. The generalizations of the well-known Dobinski's formula are further investigated.


2020 ◽  
Vol 2020 ◽  
pp. 1-15
Author(s):  
Le Zou ◽  
Liangtu Song ◽  
Xiaofeng Wang ◽  
Thomas Weise ◽  
Yanping Chen ◽  
...  

Newton’s interpolation is a classical polynomial interpolation approach and plays a significant role in numerical analysis and image processing. The interpolation function of most classical approaches is unique to the given data. In this paper, univariate and bivariate parameterized Newton-type polynomial interpolation methods are introduced. In order to express the divided differences tables neatly, the multiplicity of the points can be adjusted by introducing new parameters. Our new polynomial interpolation can be constructed only based on divided differences with one or multiple parameters which satisfy the interpolation conditions. We discuss the interpolation algorithm, theorem, dual interpolation, and information matrix algorithm. Since the proposed novel interpolation functions are parametric, they are not unique to the interpolation data. Therefore, its value in the interpolant region can be adjusted under unaltered interpolant data through the parameter values. Our parameterized Newton-type polynomial interpolating functions have a simple and explicit mathematical representation, and the proposed algorithms are simple and easy to calculate. Various numerical examples are given to demonstrate the efficiency of our method.


2014 ◽  
Vol 556-562 ◽  
pp. 5705-5709 ◽  
Author(s):  
Can Xin Wei

Streaming media technology is also known as streaming media technology. Users can experience playing while downloading function, which improves the transmission speed of multimedia information on the internet. In this paper, we use streaming media technology, combined with the parabolic interpolation and Newton interpolation algorithm, design multimedia interactive platform of the college students' ideological and political education and comprehensive education. The overall structure of the platform is composed of multimedia, streaming media distribution equipment, school network, clients of teachers and students. On the internet between the teachers and students, student and students they can communicate ideological and political. In order to test the performance of network, we use the iperf software to test packet loss rate and delay characteristics of the network. The results show that Newton interpolation method has better delay characteristics, parabolic interpolation algorithm has low packet loss rate. It provides technical reference for the application of multimedia technology in the ideological and political education.


Author(s):  
Musraini M Musraini M ◽  
Rustam Efendi ◽  
Rolan Pane ◽  
Endang Lily

Barisan Fibonacci dan Lucas telah digeneralisasi dalam banyak cara, beberapa dengan mempertahankan kondisi awal, dan lainnya dengan mempertahankan relasi rekurensi. Makalah ini menyajikan sebuah generalisasi baru barisan Fibonacci-Lucas yang didefinisikan oleh relasi rekurensi B_n=B_(n-1)+B_(n-2),n≥2 , B_0=2b,B_1=s dengan b dan s bilangan bulat  tak negatif. Selanjutnya, beberapa identitas dihasilkan dan diturunkan menggunakan formula Binet dan metode sederhana lainnya. Juga dibahas beberapa identitas dalam bentuk determinan.   The Fibonacci and Lucas sequence has been generalized in many ways, some by preserving the initial conditions, and others by preserving the recurrence relation. In this paper, a new generalization of Fibonacci-Lucas sequence is introduced and defined by the recurrence relation B_n=B_(n-1)+B_(n-2),n≥2, with ,  B_0=2b,B_1=s                          where b and s are non negative integers. Further, some identities are generated and derived by Binet’s formula and other simple methods. Also some determinant identities are discussed.


Sign in / Sign up

Export Citation Format

Share Document