A functional implementation of the Jacobi eigen-solver
- Colorado State Univ., Fort Collins, CO (United States). Dept. of Computer Science
- Los Alamos National Lab., NM (United States)
In this paper, we describe the systematic development of two implementations of the Jacobi eigen-solver and give performance results for the MIT/Motorola Monsoon dataflow 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 0(n[sup 3]) operations, whereas Sameh's original version requires 0(n[sup 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.
- Research Organization:
- Los Alamos National Lab., NM (United States)
- Sponsoring Organization:
- USDOE; National Science Foundation (NSF); USDOE, Washington, DC (United States); National Science Foundation, Washington, DC (United States)
- OSTI ID:
- 6606632
- Report Number(s):
- LA-UR-93-298; CONF-9306102-1; ON: DE93007349; CNN: MIP-9113268
- Resource Relation:
- Conference: Conference on functional programming language and computer architectures, Copenhagen (Denmark), 9-11 Jun 1993
- Country of Publication:
- United States
- Language:
- English
Similar Records
Developing dataflow algorithms
On the abstracted dataflow complexity of Fast Fourier Transforms
Related Subjects
MATRICES
NUMERICAL SOLUTION
ALGORITHMS
CONVERGENCE
DATA-FLOW PROCESSING
EIGENVALUES
JACOBIAN FUNCTION
PARALLEL PROCESSING
PROGRAMMING LANGUAGES
FUNCTIONS
MATHEMATICAL LOGIC
PROGRAMMING
990200* - Mathematics & Computers