A flexible multicomputer algorithm for elementary matrix operations
From MaRDI portal
Publication:1968597
DOI10.1016/S0305-0548(99)00034-9zbMath0947.65046MaRDI QIDQ1968597
Publication date: 2 November 2000
Published in: Computers \& Operations Research (Search for Journal in Brave)
sparse matrices; matrix multiplication; matrix calculations; parallel optimization algorithms; flexible multicomputer algorithm; high-performance algorithm
65F50: Computational methods for sparse matrices
65K05: Numerical mathematical programming methods
90C30: Nonlinear programming
65Y05: Parallel numerical computation
65Y20: Complexity and performance of numerical algorithms
15-04: Software, source code, etc. for problems pertaining to linear algebra
Related Items
Designing a superstructure for parametric search for optimal search spaces in non‐trivial optimization problems, A multipurpose parallel genetic hybrid algorithm for nonlinear nonconvex programming problems, Dynamic portfolio management under competing representations, Scalability of the genetic hybrid algorithm on a parallel supercomputer
Uses Software