Two issues concerning the construction of square matrices with prescribed singular values and eigenvalues are addressed. First, a necessary and sufficient condition for the existence of an n × n complex matrix with n given nonnegative numbers as singular values and m(≤ n) given complex numbers to be m of the eigenvalues is determined. This extends the classical result of Weyl and Horn treating ...

In this paper we will generalize a singular value inequality that was proved before. In particular we obtain an inequality for numerical radius as follows: begin{equation*} 2 sqrt{t (1-t)} omega(t A^{nu}B^{1-nu}+(1-t)A^{1-nu}B^{nu}) leq omega(t A + (1- t) B), end{equation*} where, $ A $ and $ B $ are positive semidefinite matrices, $ 0 leq t leq 1 $ and $ 0 leq nu leq frac{3}{2}.$

We derive an explicit count for the number of singular n × n Hankel (Toeplitz) matrices whose entries range over a finite field with q elements by observing the execution of the Berlekamp/ Massey algorithm on its elements. Our method yields explicit counts also when some entries above or on the anti-diagonal (diagonal) are fixed. For example, the number of singular n × n Toeplitz matrices with ...

In this paper, we present four numerical methods for computing the singular value decomposition (SVD) of large sparse matrices on a multiprocessor architecture. We particularly emphasize Lanczos and subspace iteration-based methods for determining several of the largest singular triplets (singular values and corresponding left-and right-singular vectors) for sparse matrices arising from two pra...

This article may be used for research, teaching, and private study purposes. Any substantial or systematic reproduction, redistribution, reselling, loan, sub-licensing, systematic supply, or distribution in any form to anyone is expressly forbidden. The publisher does not give any warranty express or implied or make any representation that the contents will be complete or accurate or up to date...

Let complex matrices $A$ and $B$ have the same sizes. Using the singular value decomposition, we characterize the $g$-inverse $B^{(1)}$ of $B$ such that the distance between a given $g$-inverse of $A$ and the set of all $g$-inverses of the matrix $B$ reaches minimum under the unitarily invariant norm. With this result, we derive additive and multiplicative perturbation bounds of the nearest per...

It is well known that any nonsingular M–matrix admits an LU factorization into M–matrices (with L and U lower and upper triangular respectively) and any singular M–matrix is permutation similar to an M–matrix which admits an LU factorization into M–matrices. Varga and Cai establish necessary and sufficient conditions for a singular M–matrix (without permutation) to allow an LU factorization wit...

This paper studies the exponential stability for random impulsive non-linear singular differential systems. We established some new sufficient conditions proposed system by using Lyapunov function method with time points. Further, to validate theoretical results' effectiveness, we finally gave two numerical examples that study graphical illustration and an additional example involving matrices ...

In this paper, a method for through-wall human detection based on the singular values decomposition of the measurement matrices is presented. After demonstrating the sparsity of the matrices using CLEAN algorithm, an SVD algorithm based on Lanczos process is applied to compute their singular values. We also analyze the singular values of matrices constructed by difference square techniques for ...

In this paper we derive a new algorithm for constructing a uni-tary decomposition of a sequence of matrices in product or quotient form. The unitary decomposition requires only unitary left and right transformations on the individual matrices and amounts to computing the generalized singular value decomposition of the sequence. The proposed algorithm is related to the classical Golub-Kahan proc...