A flexible multicomputer algorithm for elementary matrix operations
From MaRDI portal
Publication:1968597
DOI10.1016/S0305-0548(99)00034-9zbMath0947.65046OpenAlexW2082222234MaRDI QIDQ1968597
Publication date: 2 November 2000
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(99)00034-9
sparse matricesmatrix multiplicationmatrix calculationsparallel optimization algorithmsflexible multicomputer algorithmhigh-performance algorithm
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
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
This page was built for publication: A flexible multicomputer algorithm for elementary matrix operations
