Massively parallel Poisson and QR factorization solvers

DOI10.1016/0898-1221(95)00212-XzbMATH Open0874.65078MaRDI QIDQ1361265FDOQ1361265

Authors: Maria Lucka, E. Viktorinová, Marián Vajteršic 

Publication date: 2 November 1997

Published in: Computers & Mathematics with Applications (Search for Journal in Brave)

Recommendations

• Parallel QR factorization by Householder and modified Gram-Schmidt algorithms
• Sparse QR factorization on a massively parallel computer
• Parallel marching Poisson solvers
• scientific article; zbMATH DE number 2090652
• Parallel QR factorization using the torus-wrap mapping

zbMATH Keywords

computational complexityDirichlet problemnumerical examplePoisson equationparallel algorithmsQR factorizationPoisson solverfinite-differenceGivens rotationsHouseholder reflectionscyclic odd-even reductionfast sine transformmassively SIMD-type computer arrays

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Finite difference methods for boundary value problems involving PDEs (65N06)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Parallel computation. 2nd international ACPC conference, Gmunden, Austria, October 4-6, 1993. Proceedings
• Efficient Matrix Multiplication on SIMD Computers

Cited In (1)

• Sparse QR factorization on a massively parallel computer

This page was built for publication: Massively parallel Poisson and QR factorization solvers

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