Efficient VLSI implementation of iterative solutions to sparse linear systems
From MaRDI portal
In each step of an iterative method to solve a sparse linear system \(Ax=b\), the major computational step is \(x_ k=Px_{k-1}+q\) with a sparse matrix \(P\) (possibly different from \(A\)). The authors propose a way to perform this step on a regular processor grid with a nearest neighbour communication network.
Recommendations
- Scalable iterative solution of sparse linear systems
- scientific article; zbMATH DE number 3974303
- Publication:4725754
- scientific article; zbMATH DE number 554772
- Efficient approximate solution of sparse linear systems
- FAST IMPLEMENTATION OF MULTIVARIABLE LINEAR SYSTEMS VIA VLSI ARRAY PROCESSORS
- Fast and Efficient Parallel Solution of Sparse Linear Systems
- A systolic accelerator for the iterative solution of sparse linear systems
- scientific article; zbMATH DE number 3958727
- Parallel, iterative solution of sparse linear systems: Models and architectures
Cited in
(8)- VLSI implementation of fast solvers for band linear systems with constant coefficient matrix
- Parallel solution of linear systems with striped sparse matrices
- A VLSI fast solver for tridiagonal linear systems
- VPAStab\((J,L)\): an iterative method with look-ahead for the solution of large sparse linear systems
- FAST IMPLEMENTATION OF MULTIVARIABLE LINEAR SYSTEMS VIA VLSI ARRAY PROCESSORS
- Applying iterative methods to the analysis of VLSI circuits
- Low Byte/Flop Implementation of Iterative Solver for Sparse Matrices Derived from Stencil Computations
- Design and implementation of numerical linear algebra algorithms on fixed point DSPs
This page was built for publication: Efficient VLSI implementation of iterative solutions to sparse linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1801374)
