A flexible multicomputer algorithm for elementary matrix operations

DOI10.1016/S0305-0548(99)00034-9MaRDI QIDQ1968597zbMATH OpenOpenAlexFDO

Authors Ralf Östermark

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

zbMATH Keywords

sparse matricesmatrix multiplicationmatrix calculationsparallel optimization algorithmsflexible multicomputer algorithmhigh-performance algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Nonlinear programming (90C30) Software, source code, etc. for problems pertaining to linear algebra (15-04)

Recommendations

• A new parallel matrix multiplication algorithm on distributed-memory concurrent computers
• Architecture independent parallel algorithm design: theory vs practice
• Parallel matrix multiplication: a systematic journey
• Scalable parallel matrix multiplication on distributed memory parallel computers
• Software Libraries for Linear Algebra Computations on High Performance Computers

Cited in

(4)

• Scalability of the genetic hybrid algorithm on a parallel supercomputer
• A multipurpose parallel genetic hybrid algorithm for nonlinear nonconvex programming problems
• Dynamic portfolio management under competing representations
• Designing a superstructure for parametric search for optimal search spaces in non‐trivial optimization problems

Describes a project that uses

Uses Software

• ScaLAPACK

This page was built for publication: A flexible multicomputer algorithm for elementary matrix operations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1968597)