The Matrix Equation MX +XN = B in the VLSI Model

Articolo
Data di Pubblicazione:
1986
Abstract:
The complexity of solving the matrix equation MX + XN = B is studied, with respect to the VLSI model. Upper and lower bounds are shown, which allow comparing this problem to other numerical computations such as matrix inversion and matrix multiplication.
Tipologia CRIS:
01.01 Articolo in rivista
Keywords:
VLSI models; Area-time complexity; Matrix equation; Lower bound
Elenco autori:
Link alla scheda completa:
https://iris.cnr.it/handle/20.500.14243/377414
Pubblicato in:
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS
Journal