The matrix equation MX + XN = B in the VLSI model

DOI10.1080/00207168608803507zbMath0653.65029OpenAlexW2038518391MaRDI QIDQ3799562

Bruno Codenotti

Publication date: 1986

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168608803507

zbMATH Keywords

matrix equationmatrix inversionmatrix multiplicationUpper and lower boundsarea-time complexityVLSI model

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of matrix inversion and generalized inverses (15A09) Matrix equations and identities (15A24) Direct numerical methods for linear systems and matrix inversion (65F05)

Cites Work

• Unnamed Item
• Area-time tradeoff for rectangular matrix multiplication in VLSI models
• Area-time optimal VLSI networks for multiplying matrices
• Area-time tradeoffs for matrix multiplication and related problems in VLSI models
• Numerically Stable Solution of Dense Systems of Linear Equations Using Mesh-Connected Processors
• The numerical solution of the matrix equationXA+AY=F