We describe the design and computational performance of parallel row-oriented tensor algorithms for the solution of dense systems of nonlinear equations and nonlinear least squares problems on a distributed-memory MIMD multiprocessor. Tensor methods are general purpose methods that base each iteration upon a quadratic model of the nonlinear function, rather than the standard linear model, where...

A matrix lower bound is defined that generalizes ideas apparently due to S. Banach and J. von Neumann. The matrix lower bound has a natural interpretation in functional analysis, and it satisfies many of the properties that von Neumann stated for it in a restricted case. Applications for the matrix lower bound are demonstrated in several areas. In linear algebra, the matrix lower bound of a ful...

there are varying patterns for growing different varieties of branched or non-branched sesame. this experiment was conducted during a two-year period (2000-2001) to identify the optimal practice for cultivation of the uni-branched sesame in the safi-abad agricultural research center, khuzestan province. the statistical design was set up as strip-plot in a randomized complete block with four rep...

The articulated arm coordinate measuring machine (AACMM) is a kind of new coordinate measuring device based on non-Cartesian system. The measuring accuracy of the AACMM can be effectively improved by parameter identification. However, some of the structural parameters are coupling (linearly related), so the structural parameters usually cannot be identified correctly. The Jacobian matrix was ob...

The rank distance was introduced in 1985 by E. Gabidulin [1]. He determined a lower bound for the minimum rank distance of a code. Moreover, he constructed a class of codes which meet this bound: the so-called Gabidulin codes. In this paper, we first characterize the linear isometries for the rank distance. Then we determine the isometry group and the permutation group of Gabidulin codes of ful...

Abstract. This manuscript focuses on the development of a parallel QR-factorization of structured rank matrices, which can then be used for solving systems of equations. First, we will prove the existence of two types of Givens transformations, named rank decreasing and rank expanding Givens transformations. Combining these two types of Givens transformations leads to different patterns for ann...

0