Iterative algorithms for solution of large sparse systems of linear equations on hypercubes

DOI10.1109/12.9733zbMath0657.65046OpenAlexW2127111677MaRDI QIDQ3805756

Ponnuswamy Sadayappan, Cevdet Aykanat, Füsun Özgüner, Fikret Erçal

Publication date: 1988

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/49593

zbMATH Keywords

finite element methodconjugate gradient methodparallel algorithmsmultiprocessorsgranularityIterative algorithmshypercube topology

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Iterative numerical methods for linear systems (65F10) Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Parallel numerical computation (65Y05)

Related Items (5)

EFFICIENT OVERLAPPED FFT ALGORITHMS FOR HYPERCUBE-CONNECTED MULTICOMPUTERS∗ ⋮ Parallelism and fast solution of linear systems ⋮ Parallel Boolean operations for information retrieval ⋮ A parallel approach for determining confidence intervals of variable statistics in large and sparse linear equations with RHS ranges ⋮ Adaptive dynamic relaxation algorithm for non-linear hyperelastic structures. III: Parallel implementation.

This page was built for publication: Iterative algorithms for solution of large sparse systems of linear equations on hypercubes