منابع مشابه
Fast matrix decomposition in F2
In this work an efficient algorithm to perform a block decomposition for large dense rectangular matrices with entries in 2 is presented. Matrices are stored as column blocks of row major matrices in order to facilitate rows operation and matrix multiplications with block of columns. One of the major bottlenecks of matrix decomposition is the pivoting involving both rows and column exchanges. S...
متن کاملFast Polar Decomposition of an Arbitrary Matrix
The polar decomposition of an m x n matrix A of full rank, where rn n, can be computed using a quadratically convergent algorithm of Higham SIAMJ. Sci. Statist. Comput., 7 (1986), pp. 1160-1174]. The algorithm is based on a Newton iteration involving a matrix inverse. It is shown how, with the use of a preliminary complete orthogonal decomposition, the algorithm can be extended to arbitrary A. ...
متن کاملFast Eigen Decomposition for Low-Rank Matrix Approximation
In this paper we present an efficient algorithm to compute the eigen decomposition of a matrix that is a weighted sum of the self outer products of vectors such as a covariance matrix of data. A well known algorithm to compute the eigen decomposition of such matrices is though the singular value decomposition, which is available only if all the weights are nonnegative. Our proposed algorithm ac...
متن کاملMatrix Decomposition
5 QR Decomposition 7 5.1 Householder Reflections and Givens Rotations . . . . . . . . . . . . . . . . . . . . . . . 8 5.2 Gram-Schmidt orthonormalization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 5.3 QR Decomposition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 5.4 Least Square Fitting . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ....
متن کاملFast System Matrix Calculation in CT Iterative Reconstruction
Introduction: Iterative reconstruction techniques provide better image quality and have the potential for reconstructions with lower imaging dose than classical methods in computed tomography (CT). However, the computational speed is major concern for these iterative techniques. The system matrix calculation during the forward- and back projection is one of the most time- cons...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2014
ISSN: 0377-0427
DOI: 10.1016/j.cam.2013.10.026