A VLSI fast solver for tridiagonal linear systems

DOI10.1016/0020-0190(86)90107-9zbMath0654.65026OpenAlexW2009857890MaRDI QIDQ1108739

Grazia Lotti, Bruno Codenotti

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0020-0190(86)90107-9

zbMATH Keywords

lower boundtridiagonal linear systemsarea-time complexityVLSI modelodd-even reduction algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (1)

On the VLSI complexity of some arithmetic and numerical problems

Cites Work

• Unnamed Item
• The complexity of a VLSI adder
• Information transfer and area-time tradeoffs for VLSI multiplication
• Parallel Tridiagonal Equation Solvers
• Fast Parallel Matrix Inversion Algorithms

This page was built for publication: A VLSI fast solver for tridiagonal linear systems