Part III Matrix decomposition methods for parallel computers

DOI10.1007/BF02925097zbMATH Open0842.65012OpenAlexW4234421939MaRDI QIDQ4866735FDOQ4866735

D. J. Evans

Publication date: 24 July 1996

Published in: Rendiconti del Seminario Matematico e Fisico di Milano (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02925097

zbMATH Keywords

parallel algorithmsLU decompositionquadrant interlocking factorizations

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Parallel numerical computation (65Y05)

Cited In (11)

• Decomposition of integer matrices and multileaf collimator sequencing
• Parallel computation of resolvents by multimodular techniques and decomposition formula
• Title not available (Why is that?)
• Dimension-wise decompositions and their efficient parallelization
• Title not available (Why is that?)
• Matrix structures in parallel matrix computations
• The parallel orthogonal decomposition (POD) of a matrix
• Nonlinear matrix decompositions and an application to parallel processing
• The choleski Q.I.F. algorithm for solving symmetric linear systems
• Title not available (Why is that?)
• Multiple decompositions for computational convenience

   Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Parallel quadrant interlocking factorization on hypercube computers 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Part III Matrix decomposition methods for parallel computers

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