Solving sparse least squares problems on massively distributed memory computers

Proceedings of the Conference on Advances in Parallel and Distributed Computing

Volumn , Issue , 1997, Pages 170-177

  Yang, Tianruo ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; DISTRIBUTED COMPUTER SYSTEMS; ITERATIVE METHODS; LEAST SQUARES APPROXIMATIONS; MATHEMATICAL MODELS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; RESPONSE TIME (COMPUTER SYSTEMS);

INCOMPLETE MODIFIED GRAM-SCHMIDT PRECONDITIONER; MASSIVELY DISTRIBUTED MEMORY COMPUTERS; PARALLELIZATION; PRECONDITIONING; RUNTIME; SPARSE LEAST SQUARES PROBLEMS;

PARALLEL ALGORITHMS;

EID: 0030871503     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)