Page 1 Next

Displaying 1 – 20 of 80

Showing per page

A Brauer’s theorem and related results

Rafael Bru, Rafael Cantó, Ricardo Soto, Ana Urbano (2012)

Open Mathematics

Given a square matrix A, a Brauer’s theorem [Brauer A., Limits for the characteristic roots of a matrix. IV. Applications to stochastic matrices, Duke Math. J., 1952, 19(1), 75–91] shows how to modify one single eigenvalue of A via a rank-one perturbation without changing any of the remaining eigenvalues. Older and newer results can be considered in the framework of the above theorem. In this paper, we present its application to stabilization of control systems, including the case when the system...

A formula for all minors of the adjacency matrix and an application

R. B. Bapat, A. K. Lal, S. Pati (2014)

Special Matrices

We supply a combinatorial description of any minor of the adjacency matrix of a graph. This description is then used to give a formula for the determinant and inverse of the adjacency matrix, A(G), of a graph G, whenever A(G) is invertible, where G is formed by replacing the edges of a tree by path bundles.

A geometric proof of the Perron-Frobenius theorem.

Alberto Borobia, Ujué R. Trías (1992)

Revista Matemática de la Universidad Complutense de Madrid

We obtain an elementary geometrical proof of the classical Perron-Frobenius theorem for non-negative matrices A by using the Brouwer fixed-point theorem and by studying the dynamics of the action of A on convenient subsets of Rn.

A lower bound sequence for the minimum eigenvalue of Hadamard product of an M -matrix and its inverse

Wenlong Zeng, Jianzhou Liu (2022)

Czechoslovak Mathematical Journal

We propose a lower bound sequence for the minimum eigenvalue of Hadamard product of an M -matrix and its inverse, in terms of an S -type eigenvalues inclusion set and inequality scaling techniques. In addition, it is proved that the lower bound sequence converges. Several numerical experiments are given to demonstrate that the lower bound sequence is sharper than some existing ones in most cases.

A modified Cayley transform for the discretized Navier-Stokes equations

K. A. Cliffe, T. J. Garratt, Alastair Spence (1993)

Applications of Mathematics

This paper is concerned with the problem of computing a small number of eigenvalues of large sparse generalized eigenvalue problems. The matrices arise from mixed finite element discretizations of time dependent equations modelling viscous incompressible flow. The eigenvalues of importance are those with smallest real part and are used to determine the linearized stability of steady states, and could be used in a scheme to detect Hopf bifurcations. We introduce a modified Cayley transform of the...

Currently displaying 1 – 20 of 80

Page 1 Next