Kipadia, Nirav Harish. M.S.E.E., Purdue University. May 1994. Pi SIMD Sparse Matrix-Vector Multiplication Algorithm for Computational Electromagnetics and Scattering Matrix Models. Major Professor: Jose Fortes. A large number of problems in numerical analysis require the multiplication of a sparse matrix by a vector. In spite of the large amount of fine-grained parallelism available in the proc...

Abstract We prove that for all $$n\in {\mathbb {N}}$$ n ∈ N , there exists a constant $$C_{n}$$ C such $$d \in d every row contraction T consisting of d commuting $$n \times n$$ ×...

In this paper, a method has been developed to construct the membership surfaces of row and column vectors and arithmetic operations of imprecise matrix. A matrix with imprecise elements would be called an imprecise matrix. The membership surface of imprecise vector has been already shown based on Randomness-Impreciseness Consistency Principle. The RandomnessImpreciseness Consistency Principle l...

A permuted graph matrix is a matrix V ∈ C(m+n)×m such that every row of the m×m identity matrix Im appears at least once as a row of V . Permuted graph matrices can be used in some contexts in place of orthogonal matrices, for instance when giving a basis for a subspace U ⊆ Cm+n, or to normalize matrix pencils in a suitable sense. In these applications the permuted graph matrix can be chosen wi...

A hidden positive row diagonally dominant (hprdd) matrix is a square matrix A for which there exist square matrices C and B so that AC = B and each diagonal entry of B and C is greater than the sum of the absolute values of the off-diagonal entries in its row. A linear program with 5n2 − 4n variables and 2n2 constraints is defined that takes as input an n × n matrix A and produces C and B satis...