Given a real matrix, we analyze an open interval, called row exclusion interval, such that the real eigenvalues do not belong to it. We characterize when the row exclusion interval is nonempty. In addition to the exclusion interval, inclusion intervals for the real eigenvalues, alternative to those provided by the Gerschgorin disks, are also considered for matrices whose off-diagonal entries pr...

A Laplacian matrix, L = (lij) ∈ R , has nonpositive off-diagonal entries and zero row sums. As a matrix associated with a weighted directed graph, it generalizes the Laplacian matrix of an ordinary graph. A standardized Laplacian matrix is a Laplacian matrix with − 1 n ≤ lij ≤ 0 at j 6= i. We study the spectra of Laplacian matrices and relations between Laplacian matrices and stochastic matrice...

We study the nonsymmetric algebraic Riccati equation whose four coefficient matrices are the blocks of a nonsingular M -matrix or an irreducible singular M -matrix M . The solution of practical interest is the minimal nonnegative solution. We show that Newton’s method with zero initial guess can be used to find this solution without any further assumptions. We also present a qualitative perturb...

Let p be a homogeneous polynomial of degree n in n variables, p(z1, . . . , zn) = p(Z), Z ∈ C. We call such a polynomial p H-Stable if p(z1, . . . , zn) 6= 0 provided the real parts Re(zi) > 0, 1 ≤ i ≤ n. This notion from Control Theory is closely related to the notion of Hyperbolicity used intensively in the PDE theory. The main theorem in this paper states that if p(x1, . . . , xn) is a homog...

this paper presents an approach for solving a nonlinear stochastic differential equations (nsdes) using a new basis functions (nbfs). these functions and their operational matrices areused for representing matrix form of the nbfs. with using this method in combination with the collocation method, the nsdes are reduced a stochastic nonlinear system of equations and unknowns. then, the error anal...

2.1.1 matrix games A 2-player zero-sum game, or a matrix game, is defined by a matrix A ∈ Rm×n, called the payoff matrix. There are two players with opposing interests: the row player (minimizer) and the column player (maximizer). At each step of the play, the row player selects a row i, and the column player selects a column j, then the row player pays to the column player the value aij of the...

this paper introduces a numerical method for solving the vasicek model by using a stochastic operational matrix based on the triangular functions (tfs) in combination with the collocation method. the method is stated by using conversion the vasicek model to a stochastic nonlinear system of $2m+2$ equations and $2m+2$ unknowns. finally, the error analysis and some numerical examples are provided...

The necessary condition for eigenvalue values of a circulant matrix is studied It is then proved that the necessary condition also su ces the existence of a circulant matrix with the prescribed eigenvalue values Introduction An n n matrix C of the form C c c cn cn c c cn cn cn c cn c c cn c is called a circulant matrix As each row of a circulant matrix is just the previous row cycled forward on...

We present an algorithm for computing a d-dimensional subspace of the row space of a matrix. For an n×n matrix A with m nonzero entries and with rank(A) ≥ d the algorithm generates a d × n matrix with full row rank and which is a subspace of Rows(A). If rank(A) < d the algorithm generates a rank(A)×n row-equivalent matrix. The running time of the algorithm is