scientific article; zbMATH DE number 3915502

MaRDI QIDQ3690949zbMATH OpenFDO

Authors Lennart Johnsson

Publication date 1984

zbMATH Keywords

binary tree algorithmCholeskyconjugate gradient methodCroutDoolittleGaussian eliminationGivensHouseholderparallel computingPreconditioningsystolic architecturesVLSI algorithms

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Theory of operating systems (68N25)

Recommendations

• Parallelism and fast solution of linear systems
• Parallel conjugate gradient-like algorithms for solving sparse nonsymmetric linear systems on a vector multiprocessor
• scientific article; zbMATH DE number 3917546
• Scalable iterative solution of sparse linear systems
• The behavior of conjugate gradient algorithms on a multivector processor with a hierarchical memory

Cited in

(6)

• Algorithms and experiments for structural mechanics on high-performance architectures
• Highly concurrent algorithm for the solution of \(\rho\)-Toeplitz system of equations
• Concurrent cooperating solvers over reals
• The numerical stability analysis of pipelined conjugate gradient methods: historical context and methodology
• On the cost of iterative computations
• Predict-and-Recompute Conjugate Gradient Variants

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 Q3690949)