scholarly journals Extreme Spectra Realization by Nonsymmetric Tridiagonal and Nonsymmetric Arrow Matrices

2019 ◽  
Vol 2019 ◽  
pp. 1-7 ◽  
Author(s):  
H. Pickmann-Soto ◽  
S. Arela-Pérez ◽  
Juan C. Egaña ◽  
Ricardo L. Soto
Keyword(s):  
Sufficient Conditions ◽  
Real Vector ◽  
The Real ◽  
Extreme Eigenvalue ◽  
The Matrix ◽  
Maximal Eigenvalues ◽  
Principal Submatrices ◽  
Solution Matrix ◽  
Arrow Matrix ◽  
Algorithmic Procedure

We consider the following inverse extreme eigenvalue problem: given the real numbers {λ1j,λjj}j=1n and the real vector x(n)=x1,x2,…,xn, to construct a nonsymmetric tridiagonal matrix and a nonsymmetric arrow matrix such that {λ1j,λjj}j=1n are the minimal and the maximal eigenvalues of each one of their leading principal submatrices, and x(n),λn(n) is an eigenpair of the matrix. We give sufficient conditions for the existence of such matrices. Moreover our results generate an algorithmic procedure to compute a unique solution matrix.

On generalized inverses of matrices

1966 ◽  
Vol 62 (4) ◽  
pp. 673-677 ◽  
Author(s):  
M. H. Pearl
Keyword(s):  
Generalized Inverse ◽  
Sufficient Conditions ◽  
Maximal Rank ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
The Real ◽  
Finite Dimensional ◽  
The Matrix ◽  
Generalized Inverses Of Matrices ◽  
Necessary And Sufficient

The notion of the inverse of a matrix with entries from the real or complex fields was generalized by Moore (6, 7) in 1920 to include all rectangular (finite dimensional) matrices. In 1951, Bjerhammar (2, 3) rediscovered the generalized inverse for rectangular matrices of maximal rank. In 1955, Penrose (8, 9) independently rediscovered the generalized inverse for arbitrary real or complex rectangular matrices. Recently, Arghiriade (1) has given a set of necessary and sufficient conditions that a matrix commute with its generalized inverse. These conditions involve the existence of certain submatrices and can be expressed using the notion of EPr matrices introduced in 1950 by Schwerdtfeger (10). The main purpose of this paper is to prove the following theorem:Theorem 2. A necessary and sufficient condition that the generalized inverse of the matrix A (denoted by A+) commute with A is that A+ can be expressed as a polynomial in A with scalar coefficients.

scholarly journals Extremal Inverse Eigenvalue Problem for a Special Kind of Matrices

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Zhibing Liu ◽  
Yeying Xu ◽  
Kanmin Wang ◽  
Chengfeng Xu
Keyword(s):  
Eigenvalue Problem ◽  
Special Kind ◽  
Inverse Eigenvalue Problem ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Inverse Eigenvalue ◽  
Maximal Eigenvalues ◽  
Principal Submatrices ◽  
Necessary And Sufficient ◽  
Arrow Matrix

We consider the following inverse eigenvalue problem: to construct a special kind of matrix (real symmetric doubly arrow matrix) from the minimal and maximal eigenvalues of all its leading principal submatrices. The necessary and sufficient condition for the solvability of the problem is derived. Our results are constructive and they generate algorithmic procedures to construct such matrices.

On inverse eigenvalue problems for two kinds of special banded matrices

Filomat ◽  
2017 ◽  
Vol 31 (2) ◽  
pp. 371-385 ◽  
Author(s):  
Wei-Ru Xu ◽  
Guo-Liang Chen
Keyword(s):  
Eigenvalue Problems ◽  
Sufficient Conditions ◽  
Numerical Algorithms ◽  
Tridiagonal Matrices ◽  
Inverse Eigenvalue Problems ◽  
Banded Matrices ◽  
Inverse Eigenvalue ◽  
Maximal Eigenvalues ◽  
Principal Submatrices ◽  
Necessary And Sufficient

This paper presents two kinds of symmetric tridiagonal plus paw form (hereafter TPPF) matrices, which are the combination of tridiagonal matrices and bordered diagonal matrices. In particular, we exploit the interlacing properties of their eigenvalues. On this basis, the inverse eigenvalue problems for the two kinds of symmetric TPPF matrices are to construct these matrices from the minimal and the maximal eigenvalues of all their leading principal submatrices respectively. The necessary and sufficient conditions for the solvability of the problems are derived. Finally, numerical algorithms and some examples of the results developed here are given.

Spectral analysis of M/G/1 and G/M/1 type Markov chains

1996 ◽  
Vol 28 (01) ◽  
pp. 114-165 ◽  
Author(s):  
H. R. Gail ◽  
S. L. Hantler ◽  
B. A. Taylor
Keyword(s):  
Markov Chains ◽  
Generating Functions ◽  
Complex Analysis ◽  
Linear Equations ◽  
Sufficient Conditions ◽  
Equilibrium Analysis ◽  
Transform Method ◽  
Technical Problems ◽  
The Matrix ◽  
Transient Case

When analyzing the equilibrium behavior of M/G/1 type Markov chains by transform methods, restrictive hypotheses are often made to avoid technical problems that arise in applying results from complex analysis and linear algebra. It is shown that such restrictive assumptions are unnecessary, and an analysis of these chains using generating functions is given under only the natural hypotheses that first moments (or second moments in the null recurrent case) exist. The key to the analysis is the identification of an important subspace of the space of bounded solutions of the system of homogeneous vector-valued Wiener–Hopf equations associated with the chain. In particular, the linear equations in the boundary probabilities obtained from the transform method are shown to correspond to a spectral basis of the shift operator on this subspace. Necessary and sufficient conditions under which the chain is ergodic, null recurrent or transient are derived in terms of properties of the matrix-valued generating functions determined by transitions of the Markov chain. In the transient case, the Martin exit boundary is identified and shown to be associated with certain eigenvalues and vectors of one of these generating functions. An equilibrium analysis of the class of G/M/1 type Markov chains by similar methods is also presented.

Vertex Subgroups of Irreducible Representations of Solvable Groups

1971 ◽  
Vol 23 (1) ◽  
pp. 12-21
Author(s):  
J. Malzan
Keyword(s):  
Vector Space ◽  
Unit Sphere ◽  
Convex Subset ◽  
Orthogonal Group ◽  
Solvable Groups ◽  
Fundamental Region ◽  
Irreducible Representations ◽  
Theoretical Problem ◽  
Real Vector ◽  
The Real

If ρ(G) is a finite, real, orthogonal group of matrices acting on the real vector space V, then there is defined [5], by the action of ρ(G), a convex subset of the unit sphere in V called a fundamental region. When the unit sphere is covered by the images under ρ(G) of a fundamental region, we obtain a semi-regular figure.The group-theoretical problem in this kind of geometry is to find when the fundamental region is unique. In this paper we examine the subgroups, ρ(H), of ρ(G) with a view of finding what subspace, W of V consists of vectors held fixed by all the matrices of ρ(H). Any such subspace lies between two copies of a fundamental region and so contributes to a boundary of both. If enough of these boundaries might be found, the fundamental region would be completely described.

scholarly journals Instable Trivial Solution of Autonomous Differential Systems with Quadratic Right-Hand Sides in a Cone

2011 ◽  
Vol 2011 ◽  
pp. 1-23 ◽  
Author(s):  
D. Ya. Khusainov ◽  
J. Diblík ◽  
Z. Svoboda ◽  
Z. Šmarda
Keyword(s):  
Trivial Solution ◽  
Sufficient Conditions ◽  
Zero Solution ◽  
Dimensional System ◽  
Global Instability ◽  
Degree Polynomial ◽  
Differential Systems ◽  
Right Hand ◽  
The Matrix ◽  
Full Derivative

The present investigation deals with global instability of a generaln-dimensional system of ordinary differential equations with quadratic right-hand sides. The global instability of the zero solution in a given cone is proved by Chetaev's method, assuming that the matrix of linear terms has a simple positive eigenvalue and the remaining eigenvalues have negative real parts. The sufficient conditions for global instability obtained are formulated by inequalities involving norms and eigenvalues of auxiliary matrices. In the proof, a result is used on the positivity of a general third-degree polynomial in two variables to estimate the sign of the full derivative of an appropriate function in a cone.

scholarly journals On circulant codes with prescribed distances

1977 ◽  
Vol 16 (3) ◽  
pp. 361-369
Author(s):  
M. Deza ◽  
Peter Eades
Keyword(s):  
Sufficient Conditions ◽  
Difference Sets ◽  
Necessary And Sufficient Conditions ◽  
Necessary Condition ◽  
Weighing Matrices ◽  
Cyclic Difference Sets ◽  
The Matrix ◽  
Circulant Codes ◽  
Necessary And Sufficient ◽  
Square Matrix

Necessary and sufficient conditions are given for a square matrix to te the matrix of distances of a circulant code. These conditions are used to obtain some inequalities for cyclic difference sets, and a necessary condition for the existence of circulant weighing matrices.

scholarly journals Cross-Ratio in Real Vector Space

2019 ◽  
Vol 27 (1) ◽  
pp. 47-60
Author(s):  
Roland Coghetto
Keyword(s):  
Vector Space ◽  
Real Line ◽  
Cross Ratio ◽  
Real Vector Space ◽  
Vector Spaces ◽  
Real Vector ◽  
Complex Vector ◽  
The Real ◽  
Mizar Mathematical Library ◽  
The Cross

Summary Using Mizar [1], in the context of a real vector space, we introduce the concept of affine ratio of three aligned points (see [5]). It is also equivalent to the notion of “Mesure algèbrique”1, to the opposite of the notion of Teilverhältnis2 or to the opposite of the ordered length-ratio [9]. In the second part, we introduce the classic notion of “cross-ratio” of 4 points aligned in a real vector space. Finally, we show that if the real vector space is the real line, the notion corresponds to the classical notion3 [9]: The cross-ratio of a quadruple of distinct points on the real line with coordinates x1, x2, x3, x4 is given by: $$({x_1},{x_2};{x_3},{x_4}) = {{{x_3} - {x_1}} \over {{x_3} - {x_2}}}.{{{x_4} - {x_2}} \over {{x_4} - {x_1}}}$$ In the Mizar Mathematical Library, the vector spaces were first defined by Kusak, Leonczuk and Muzalewski in the article [6], while the actual real vector space was defined by Trybulec [10] and the complex vector space was defined by Endou [4]. Nakasho and Shidama have developed a solution to explore the notions introduced by different authors4 [7]. The definitions can be directly linked in the HTMLized version of the Mizar library5. The study of the cross-ratio will continue within the framework of the Klein- Beltrami model [2], [3]. For a generalized cross-ratio, see Papadopoulos [8].

scholarly journals An induced real quaternion spherical ensemble of random matrices

2017 ◽  
Vol 06 (01) ◽  
pp. 1750001
Author(s):  
Anthony Mays ◽  
Anita Ponsaing
Keyword(s):  
Real Line ◽  
Relative Size ◽  
Functional Differentiation ◽  
The Real ◽  
Real Quaternion ◽  
Large Matrix ◽  
Wall Boundary Conditions ◽  
The Matrix ◽  
Soft Wall ◽  
Point Correlation

We study the induced spherical ensemble of non-Hermitian matrices with real quaternion entries (considering each quaternion as a [Formula: see text] complex matrix). We define the ensemble by the matrix probability distribution function that is proportional to [Formula: see text] These matrices can also be constructed via a procedure called ‘inducing’, using a product of a Wishart matrix (with parameters [Formula: see text]) and a rectangular Ginibre matrix of size [Formula: see text]. The inducing procedure imposes a repulsion of eigenvalues from [Formula: see text] and [Formula: see text] in the complex plane with the effect that in the limit of large matrix dimension, they lie in an annulus whose inner and outer radii depend on the relative size of [Formula: see text], [Formula: see text] and [Formula: see text]. By using functional differentiation of a generalized partition function, we make use of skew-orthogonal polynomials to find expressions for the eigenvalue [Formula: see text]-point correlation functions, and in particular the eigenvalue density (given by [Formula: see text]). We find the scaled limits of the density in the bulk (away from the real line) as well as near the inner and outer annular radii, in the four regimes corresponding to large or small values of [Formula: see text] and [Formula: see text]. After a stereographic projection, the density is uniform on a spherical annulus, except for a depletion of eigenvalues on a great circle corresponding to the real axis (as expected for a real quaternion ensemble). We also form a conjecture for the behavior of the density near the real line based on analogous results in the [Formula: see text] and [Formula: see text] ensembles; we support our conjecture with data from Monte Carlo simulations of a large number of matrices drawn from the [Formula: see text] induced spherical ensemble. This ensemble is a quaternionic analog of a model of a one-component charged plasma on a sphere, with soft wall boundary conditions.

The algebra of differential forms on a full matric bialgebra

1993 ◽  
Vol 114 (1) ◽  
pp. 111-130 ◽  
Author(s):  
A. Sudbery
Keyword(s):  
Vector Space ◽  
Commutative Algebra ◽  
Differential Algebra ◽  
Differential Forms ◽  
Sufficient Conditions ◽  
Classical Case ◽  
Algebra Of Functions ◽  
The Matrix ◽  
Constant Coefficients ◽  
Necessary And Sufficient

AbstractWe construct a non-commutative analogue of the algebra of differential forms on the space of endomorphisms of a vector space, given a non-commutative algebra of functions and differential forms on the vector space. The construction yields a differential bialgebra which is a skew product of an algebra of functions and an algebra of differential forms with constant coefficients. We give necessary and sufficient conditions for such an algebra to exist, show that it is uniquely determined by the differential algebra on the vector space, and show that it is a non-commutative superpolynomial algebra in the matrix elements and their differentials (i.e. that it has the same dimensions of homogeneous components as in the classical case).

Sign in / Sign up

Export Citation Format

Share Document