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

DOI10.1080/00207168608803507MaRDI QIDQ3799562zbMATH OpenOpenAlexFDO

Authors 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 multiplicationmatrix equationmatrix inversionUpper and lower boundsarea-time complexityVLSI model

Mathematics Subject Classification ID

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

Recommendations

• Computational Methods for Linear Matrix Equations
• Modifying a numerical algorithm for solving the matrix equation X + AX T B = C
• On the matrix equation \(X-\sum^m_{i=1}N^\ast_iX^{-1}N_i=I\) arising in an interpolation problem
• An analysis of the matrix equation \(AX + =\overline{X}B = C\)
• The matrix equation \(X+A^TX^{-1}A=Q\) and its application in nano research

Cites work

• scientific article; zbMATH DE number 3385504 (Why is no real title available?)
• Area-time optimal VLSI networks for multiplying matrices
• Area-time tradeoff for rectangular matrix multiplication in VLSI models
• 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

This page was built for publication: The matrix equation MX + XN = B in the VLSI model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3799562)