A parallel algorithm for the distance embedding problem
Conference
·
OSTI ID:54421
- Marist College, Poughkeepsie, NY (United States)
There are several applications in which it is required to embed a given set of distances between pairs of points in m- dimensional space. In this report, a parallel version of a sequential algorithm for the distance embedding problem due to Sippl and Scheraga is discussed for an SIMD-SM CRCW machine. In contrast with another (sequential) algorithm for the problem due to Pulskamp, this one does not require the solution of a characteristic matrix equation for its eigenvalues and therefore leads to a more efficient parallel implementation.
- OSTI ID:
- 54421
- Report Number(s):
- DOE/ER/25151-1-Vol.1; CONF-930331-Vol.1; TRN: 94:007584-0057
- Resource Relation:
- Conference: 6. Society for Industrial and Applied Mathematics (SIAM) conference on parallel processing for scientific computing, Norfolk, VA (United States), 21-24 Mar 1993; Other Information: PBD: 1993; Related Information: Is Part Of Parallel processing for scientific computing: Proceedings. Volume 1; Sincovec, R.F.; Leuze, M.R. [eds.] [Oak Ridge National Lab., TN (United States)]; Keyes, D.E. [ed.] [Yale Univ., New Haven, CT (United States)]; Petzold, L.R. [ed.] [Minnesota Univ., Minneapolis, MN (United States)]; Reed, D.A. [ed.] [Illinois Univ., Chicago, IL (United States)]; PB: 522 p.
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallelizing the SDI ACCESS algorithm for the Connection Machine-2
Fully parallel algorithm for the symmetric eigenvalue problem
Implementation of a fully parallel algorithm for the symmetric eigenvalue problem
Technical Report
·
Fri Dec 01 00:00:00 EST 1989
·
OSTI ID:54421
+1 more
Fully parallel algorithm for the symmetric eigenvalue problem
Conference
·
Wed Jan 01 00:00:00 EST 1986
·
OSTI ID:54421
Implementation of a fully parallel algorithm for the symmetric eigenvalue problem
Conference
·
Fri Aug 01 00:00:00 EDT 1986
·
OSTI ID:54421