(R) An Efficient Algorithm for Row Minima Computations in Monotone Matrices
Abstract
- (R) An Efficient Algorithm for Row Minima Computations in Monotone Matrices
Recommendations
An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes
A matrix A of size m n containing items from a totally ordered universe is termed monotone if, for every i, j, 1 i < j m, the minimum value in row j lies below or to the right of the minimum in row i. Monotone matrices, and variations thereof, are known ...
Efficient parallel solution of sparse eigenvalue and eigenvector problems
FOCS '95: Proceedings of the 36th Annual Symposium on Foundations of Computer ScienceThis paper gives a new algorithm for computing the characteristic polynomial of a symmetric sparse matrix. We derive an interesting algebraic version of nested dissection, which constructs a sparse factorization the matrix A-/spl lambda/ where A is the ...
Parallel QR algorithm for the complete eigensystem of symmetric matrices
PDP '95: Proceedings of the 3rd Euromicro Workshop on Parallel and Distributed ProcessingWe propose a parallel organization of the QR algorithm for computing the complete eigensystem of symmetric matrices. We developed Occam versions of standard sequential implementations of the QR algorithm: the procedure qr1 which computes only ...
Comments
Information & Contributors
Information
Published In
Publisher
IEEE Computer Society
United States
Publication History
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0