Distributed identification of the lineality space of a cone

Authors:
Mario E. Caire;Francisco J. Lopez;David H. Williams
Affiliations:
ECE Department, University of Texas at El Paso, El Paso, USA 79968;Department of Information and Decision Sciences, University of Texas at El Paso, El Paso, USA 79968;ECE Department, University of Texas at El Paso, El Paso, USA 79968
Venue:
The Journal of Supercomputing
Year:
2009

Citing 12
Cited 0

Fast algorithms for finding randomized strategies in game trees

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Minimal realization in the max algebra is an extended linear complementarity problem

Systems & Control Letters
The extended linear complementarity problem

Mathematical Programming: Series A and B
Engineering and Economic Applications of Complementarity Problems

SIAM Review
A constraint-based approach to rigid body dynamics for virtual reality applications

VRST '98 Proceedings of the ACM symposium on Virtual reality software and technology
UNIX network programming, volume 2 (2nd ed.): interprocess communications

UNIX network programming, volume 2 (2nd ed.): interprocess communications
UNIX Network Programming: Networking APIs: Sockets and XTI

UNIX Network Programming: Networking APIs: Sockets and XTI
An Algorithm for Identifying the Frame of a Pointed Finite Conical Hull

INFORMS Journal on Computing
Algorithms to obtain the frame of a finitely generated unbounded polyhedron

Algorithms to obtain the frame of a finitely generated unbounded polyhedron
A hard-constraint time-stepping approach for rigid multibody dynamics with joints, contact, and friction

Proceedings of the 2003 conference on Diversity in computing
Algorithms for the Frame of a Finitely Generated Unbounded Polyhedron

INFORMS Journal on Computing
Practical solutions for counting scalars and dependences in ATOMIUM-a memory management system for multidimensional signal processing

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A distributed approach is described for solving lineality (or linearity) space (LS) problems with large cardinalities and a large number of dimensions. The LS solution has applications in engineering, science, and business, and includes a subset of solutions of the more general extended linear complementarity problem (ELCP). A parallel MATLAB framework is employed and results are computed on an 8-node Rocks based cluster computer using Remote Procedure Calls (RPCs) and the MPICH2 Message Passing Interface (MPI). Results show that both approaches perform comparably when solving distributed LS problems. This indicates that when deciding which parallel approach to use, the implementation details particular to the method are the decisive factors, which in this investigation give MPICH2 MPI the advantage.