Loading...
Please wait, while we are loading the content...
Similar Documents
A functional implementation of the jacobi eigen-solver (1993).
| Content Provider | CiteSeerX |
|---|---|
| Author | Böhm, A. P. W. Hiromoto, R. E. |
| Abstract | In this paper, we describe the systematic development of two implementations of the Jacobi eigen-solver and give their performance results for the MIT/Motorola Monsoon data ow machine. Our study is carried out using MINT, the MIT Monsoon simulator. The design of these implementations follows from the mathematics of the Jacobi method, and not from a translation of an existing sequential code. The functional semantics with respect to array updates, which cause excessive array copying, has lead us to a new implementation of a parallel "group-rotations" algorithm first described by Sameh. Our version of this algorithm requires O(n 3) operations, whereas Sameh's original version requires O(n 4) operations. The implementations are programmed in the language Id, and although Id has non-functional features, we have restricted the development of our eigen-solvers to the functional sub-set of the language. |
| File Format | |
| Publisher Date | 1993-01-01 |
| Access Restriction | Open |
| Subject Keyword | Jacobi Eigen-solver Functional Implementation Functional Sub-set Functional Semantics Language Id Mit Motorola Monsoon Data Non-functional Feature Whereas Sameh Systematic Development New Implementation Excessive Array Copying Original Version Sequential Code Mit Monsoon Simulator Performance Result Jacobi Method Parallel Group-rotations |
| Content Type | Text |
