scholarly journals Local Lagrange interpolation using cubic C1 splines on type-4 cube partitions

2010 ◽  
Vol 162 (3) ◽  
pp. 494-511 ◽  
Author(s):  
Michael A. Matt ◽  
Günther Nürnberger
2015 ◽  
Vol 133 (4) ◽  
pp. 685-705 ◽  
Author(s):  
Wolfgang Erb ◽  
Christian Kaethner ◽  
Mandy Ahlborg ◽  
Thorsten M. Buzug

2013 ◽  
Vol 385-386 ◽  
pp. 1705-1707
Author(s):  
Tzer Long Chen ◽  
Yu Fang Chung ◽  
Jian Mao Hong ◽  
Jeng Hong Jhong ◽  
Chin Sheng Chen ◽  
...  

It is important to notice that the access control mechanism has been widely applied in various areas, such as on-line video systems, wireless network, and electronic documents. We propose an access control mechanism which is constructed based on two mathematical fundamentals: Lagrange interpolation and ElGamal algorithm. We conduct performance analysis to compare the efficiency of our proposed scheme with that of several related published schemes in both key generation phase and key derivation phase. Our new scheme is proven to be more efficient. It is shown, as expected, a more efficient scheme provides relatively less security and a more secure scheme is relatively less efficient for private keys of the same size.


SIAM Review ◽  
2004 ◽  
Vol 46 (3) ◽  
pp. 501-517 ◽  
Author(s):  
Jean-Paul Berrut ◽  
Lloyd N. Trefethen

2000 ◽  
Vol 62 (3) ◽  
pp. 357-368 ◽  
Author(s):  
Michael Revers

A well-known result due to S.N. Bernstein is that sequence of Lagrange interpolation polynomials for |x| at equally spaced nodes in [−1, 1] diverges everywhere, except at zero and the end-points. In this paper we present a quantitative version concerning the divergence behaviour of the Lagrange interpolants for |x|3 at equidistant nodes. Furthermore, we present the exact rate of convergence for the interpolatory parabolas at the point zero.


Sign in / Sign up

Export Citation Format

Share Document