Lagrange interpolation on a processor tree with ring connections (Q1344538)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 722144
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lagrange interpolation on a processor tree with ring connections |
scientific article; zbMATH DE number 722144 |
Statements
Lagrange interpolation on a processor tree with ring connections (English)
0 references
18 June 1995
0 references
The author describes an algorithm for evaluating the Lagrange polynomial. This method makes use of a processor tree with ring connections. Without the tree connections, this method requires \(n+1\) steps on \(n\) processors. The added tree connections cut the complexity by approximately half.
0 references
Lagrange interpolation
0 references
algorithm
0 references
Lagrange polynomial
0 references
processor tree with ring connections
0 references
complexity
0 references
0.8085489869117737
0 references
0.8008974194526672
0 references
0.794999361038208
0 references
0.785037636756897
0 references
0.7748139500617981
0 references
