VLSI implementation of fast solvers for band linear systems with constant coefficient matrix

DOI10.1016/0020-0190(85)90022-5zbMath0591.65025OpenAlexW2043007994MaRDI QIDQ1075016

Grazia Lotti, Francesco Romani, Bruno Codenotti

Publication date: 1985

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(85)90022-5

zbMATH Keywords

linear systemVLSI designdiscrete Fourier transformbandlinear transform

Mathematics Subject Classification ID

Related Items (4)

On the additive structure of the inverses of banded matrices ⋮ Area-time complexity of the unconstrained minimization problem ⋮ On the VLSI complexity of some arithmetic and numerical problems ⋮ Storage compression of inverses of band matrices

Cites Work

• Inverses of banded matrices
• The Methods of Cyclic Reduction, Fourier Analysis and the FACR Algorithm for the Discrete Solution of Poisson’s Equation on a Rectangle
• Marching Algorithms for Elliptic Boundary Value Problems. I: The Constant Coefficient Case
• Unnamed Item
• Unnamed Item

This page was built for publication: VLSI implementation of fast solvers for band linear systems with constant coefficient matrix