scientific article; zbMATH DE number 18296

MaRDI QIDQ3975665zbMATH OpenFDO

Authors Michel Cosnard

Publication date 26 June 1992

zbMATH Keywords

Cholesky factorizationcomplexitydense linear systemsdistributed memory architecturesDoolittle methodGauss eliminationGauss-Jordan methodGivens factorizationgraph-theoretic methodparallel factorization algorithmsQR factorizationscheduling algorithmssequential algorithmshared memory model of computationsurvey article

Mathematics Subject Classification ID

Factorization of matrices (15A23) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Direct numerical methods for linear systems and matrix inversion (65F05) Parallel numerical computation (65Y05) Numerical algorithms for specific classes of architectures (65Y10) Distributed algorithms (68W15)

Recommendations

• Parallel Cholesky factorization on a shared-memory multiprocessor
• Computational models and task scheduling for parallel sparse Cholesky factorization
• scientific article; zbMATH DE number 641618
• Assignment and scheduling in parallel matrix factorization
• scientific article; zbMATH DE number 878999

Cited in

(5)

• Assignment and scheduling in parallel matrix factorization
• Parallel Cholesky factorization on a shared-memory multiprocessor
• scientific article; zbMATH DE number 4155892 (Why is no real title available?)
• Parallélisation de l'algorithme du chemin critique pour une machine à mémoire partagée
• Parallel two-stage reduction to Hessenberg form using dynamic scheduling on shared-memory architectures

This page was built for publication:

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