Parallel Lagrange Interpolation on Extended Fibonacci Cubes
نویسنده
چکیده
In this paper is presented a parallel algorithm for computing a Lagrange interpolation on a Extended Fibonacci Cube EFC 1(n).The algorithm consists of three phases: initialisation phase, main phase in wich the Lagrange polynomials are computed and final phase in wich the terms of the interpolation formula are added together.
منابع مشابه
Parallel Hermite Interpolation on Extended Fibonacci Cubes
This work suggests a parallel algorithm for Hermite interpolation on Extended Fibonacci Cube (n) EFC1 . The proposed algorithm has 3 phases: initialization, main and final. The main phase of the algorithm involves 3 2 N multiplications, N additions, N 2 subtractions and N divisions. In final phase we propose an efficient algorithm to accumulate the partial sums of Hermite interpolation in 2 )...
متن کاملOn Embeddings of Hamiltonian Paths and Cycles in Extended Fibonacci Cubes
The interconnection network is an essential component of a distributed system or of a supercomputer based on large-sale parallel processing. Because in distributed systems the communication between processors is based on message exchange, the network topology is of a great importance. The interconnection network can be seen as a graph and the properties of a network can be studied using combina...
متن کاملEmbeddings of Linear Arrays, Rings and 2-D Meshes on Extended Lucas Cube Networks
A Fibonacci string is a length n binary string containing no two consecutive 1s. Fibonacci cubes (FC), Extended Fibonacci cubes (ELC) and Lucas cubes (LC) are subgraphs of hypercube defined in terms of Fibonacci strings. All these cubes were introduced in the last ten years as models for interconnection networks and shown that their network topology posseses many interesting properties that are...
متن کاملExtended Fibonacci cubes
The Fibonacci Cube is an interconnection network that possesses many desirable properties that are important in network design and application. The Fibonacci Cube can efficiently emulate many hypercube algorithms and uses fewer links than the comparable hypercube, while its size does not increase as fast as the hypercube. However, most Fibonacci Cubes (more than 2/3 of all) are not Hamiltonian....
متن کاملOn median nature and enumerative properties of Fibonacci-like cubes
Fibonacci cubes, extended Fibonacci cubes, and Lucas cubes are induced subgraphs of hypercubes 9 defined in terms of Fibonacci strings. It is shown that all these graphs are median. Several enumeration results on the number of their edges and squares are obtained. Some identities involving Fibonacci 11 and Lucas numbers are also presented. © 2005 Published by Elsevier B.V. 13
متن کامل