Updating URV decompositions in parallel (Q1319521): Difference between revisions

The paper deals with the URV decomposition of a matrix and parallelization methods. A URV decomposition of a matrix is a factorization of the matrix into the product of a unitary matrix \(U\), an upper triangular matrix \(R\), and another unitary matrix \(V\). The update of a URV decomposition can reveal the effective rank of the matrix. The goal is the construction of a parallel updating procedure. The algorithm is describing piece by piece: architectural details, precedence diagrams and parallel code, plane rotations and simple updating and updating in parallel, the refinement steps. The requested parallel system is a linear MIMD array which is capable of fine grained communications and where each processor will run the same program with different data.