Matrix inversion algorithm for linear array processor
نویسندگان
چکیده
منابع مشابه
Conical Systolic Array for Matrix Inversion
Matrices have been used in many analytical and simulation models and numerical solutions. Matrix operations have essential role in many scientific and engineering applications. One of the most time-consuming operations among matrix operations is matrix inversion. Many hardware designs and software algorithms have been proposed to reduce the time of computation. They will be more important for t...
متن کاملA matrix LSQR algorithm for solving constrained linear operator equations
In this work, an iterative method based on a matrix form of LSQR algorithm is constructed for solving the linear operator equation $mathcal{A}(X)=B$ and the minimum Frobenius norm residual problem $||mathcal{A}(X)-B||_F$ where $Xin mathcal{S}:={Xin textsf{R}^{ntimes n}~|~X=mathcal{G}(X)}$, $mathcal{F}$ is the linear operator from $textsf{R}^{ntimes n}$ onto $textsf{R}^{rtimes s}$, $ma...
متن کاملA hexagonally connected processor array for Jacobi-type matrix algorithms∗
Indexing terms : Parallel algorithms, systolic arrays, matrix computation Jacobi-type matrix algorithms are mostly implemented on orthogonally connected processor arrays. In this letter, an alternative partitioning is described, resulting in a grid of hexagonally connected processors. This partitioning is shown to be over four times more efficient, as compared to the original configuration. Int...
متن کاملAn Iterative Pipelined Array Architecture for the Generalized Matrix Inversion
This paper introduces a matrix inversion procedure suitable for iteratbve pipelining [5] and VLSI chip design. This procedure requires computation of the matrix-vector product, the inner and outer vector products as basic operations. Unlike other algorithms previously described in [4,6], the algorithm to be described here is fail-safe since it computes the Moore-Penrose generalized inverse of a...
متن کاملa matrix lsqr algorithm for solving constrained linear operator equations
in this work, an iterative method based on a matrix form of lsqr algorithm is constructed for solving the linear operator equation $mathcal{a}(x)=b$ and the minimum frobenius norm residual problem $||mathcal{a}(x)-b||_f$ where $xin mathcal{s}:={xin textsf{r}^{ntimes n}~|~x=mathcal{g}(x)}$, $mathcal{f}$ is the linear operator from $textsf{r}^{ntimes n}$ onto $textsf{r}^{rtimes s}$, $ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 1992
ISSN: 0895-7177
DOI: 10.1016/0895-7177(92)90026-h