Add to ORKGThe rectangular array algorithm is a matrix approach for solving simultaneous linear equations. A systematic treatment of this algorithm is found in the classic "Mathematics in Nine Chapters". The procedure is general and mechanic, while operations involved are performed through employing the rod numeration system, which endows the algorithm with certain distinguishing features. This dissertation is devoted to a detailed study of the algorithm as well as its various applications. Keywords: rectangular arrays, systems of linear equations, eliminations, augmented matrice
This book is devoted to studying algorithms for the solution of a class of quadratic matrix and vect...
We survey general techniques and open problems in numerical linear algebra on parallel architectures...
AbstractConsider the problem of sparsifying a rectangular matrix with more columns than rows. This m...
The rectangular array algorithm is a matrix approach for solving simultaneous linear equations. A sy...
AbstractThis paper gives a classification for the triangular factorization of square matrices. These...
AbstractA brief survey of the different methods of solving linear equations in traditional China thr...
In this work we present a study on the vectorization of code segments that are typical for solving l...
The QR-method is a method for the solution of linear system of equations. The matrix R is upper tria...
AbstractOne of the significant contributions of Chinese mathematicians is the method of solving nume...
In a few number of applications, a need arises to do some usual linear algebra operations on a very ...
The paper presents two parallel algorithms for finding the rank of a rectangular matrix and two para...
Triangular arrays are a unifying thread throughout various areas of discrete mathematics such as num...
The triangle algorithm, Kalantari [4], is designed to solve the convex hull membership problem. It c...
The study deals with systems of linear algebraic equations and algorithms of their solution with a g...
AbstractIn the last twenty-five years there has been much research into “fast” matrix multiplication...
This book is devoted to studying algorithms for the solution of a class of quadratic matrix and vect...
We survey general techniques and open problems in numerical linear algebra on parallel architectures...
AbstractConsider the problem of sparsifying a rectangular matrix with more columns than rows. This m...
The rectangular array algorithm is a matrix approach for solving simultaneous linear equations. A sy...
AbstractThis paper gives a classification for the triangular factorization of square matrices. These...
AbstractA brief survey of the different methods of solving linear equations in traditional China thr...
In this work we present a study on the vectorization of code segments that are typical for solving l...
The QR-method is a method for the solution of linear system of equations. The matrix R is upper tria...
AbstractOne of the significant contributions of Chinese mathematicians is the method of solving nume...
In a few number of applications, a need arises to do some usual linear algebra operations on a very ...
The paper presents two parallel algorithms for finding the rank of a rectangular matrix and two para...
Triangular arrays are a unifying thread throughout various areas of discrete mathematics such as num...
The triangle algorithm, Kalantari [4], is designed to solve the convex hull membership problem. It c...
The study deals with systems of linear algebraic equations and algorithms of their solution with a g...
AbstractIn the last twenty-five years there has been much research into “fast” matrix multiplication...
This book is devoted to studying algorithms for the solution of a class of quadratic matrix and vect...
We survey general techniques and open problems in numerical linear algebra on parallel architectures...
AbstractConsider the problem of sparsifying a rectangular matrix with more columns than rows. This m...