An optimization approach for real time evacuation reroute planning

In this article, we study the properties of some matrix classes using principal pivot transform (PPT). These matrices with some additional conditions have nonnegative principal minors. We show that a subclass of almost fully copositive matrices intorduced in (Linear Algebra Appl 400:243–252 2005) with \(Q_{0}\)-property is captured by sufficient matrices introduced by Cottle et al. in (Linear Algebra Appl 114/115:231–249 1989) and the solution set of a linear complementarity problem is the same as the set of Karush–Kuhn–Tucker stationary points of the corresponding quadratic programming problem. We introduce some more PPT based matrix classes in continuation of (Linear Algebra Appl 400:243–252 2005) and study the properties of these classes.     

The generalized linear complementarity problem revisited

Given a vertical block matrixA, we consider in this paper the generalized linear complementarity problem VLCP(q, A) introduced by Cottle and Dantzig. We formulate this problem as a linear complementarity problem with a square matrixM, a formulation which is different from a similar formulation given earlier by Lemke. Our formulation helps in extending many well-known results in linear complementarity to the generalized linear complementarity problem. We also show that the class of vertical block matrices which Cottle and Dantzig's algorithm can process is the same as the class of equivalent square matrices which Lemke's algorithm can process. We also present some degree-theoretic results on a vertical block matrix.     

On some subclasses of P‐matrices

A matrix with positive row sums and all its off‐diagonal elements bounded above by their corresponding row averages is called a B‐matrix by J. M. Peña in References (SIAM J. Matrix Anal. Appl. 2001; 22 :1027–1037) and (Numer. Math. 2003; 95 :337–345). In this paper, it is generalized to more extended matrices—MB‐matrices, which is proved to be a subclass of the class of P‐matrices. Subsequently, we establish relationships between defined and some already known subclasses of P‐matrices (see, References SIAM J. Matrix Anal. Appl. 2000; 21 :67–78; Linear Algebra Appl. 2004; 393 :353–364; Linear Algebra Appl. 1995; 225 :117–123). As an application, some subclasses of P‐matrices are used to localize the real eigenvalues of a real matrix. Copyright © 2007 John Wiley & Sons, Ltd.     

Imprimitive non-powerful sign pattern matrices with maximum base

You et al. [L.H. You, J.Y. Shao, and H.Y. Shan, Bounds on the bases of irreducible generalized sign pattern matrices, Linear Algebra Appl. 427 (2007), pp. 285–300], obtained an upper bound of the bases for imprimitive non-powerful sign pattern matrices. In this article, we characterize those imprimitive non-powerful sign pattern matrices whose bases reach this upper bound.     

Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity

In this paper we study the behavior of infeasible-interior-point-paths for solving horizontal linear complementarity problems that are sufficient in the sense of Cottle et al. (R. W. Cottle, J.-S. Pang, Venkateswaran, Linear Algebra Appl. 114/115 (1989) 231–249). We show that these paths converge to a central point of the set of solutions. It is also shown that these are analytic functions of the path parameter even at the limitpoint, if the complementarity problem has a strictly complementary solution, and have a simple branchpoint, if it is solveable, but has no strictly complementarity solution.     

On diagonal-Schur complements of block diagonally dominant matrices

It is known that the diagonal-Schur complements of strictly diagonally dominant matrices are strictly diagonally dominant matrices [J.Z. Liu, Y.Q. Huang, Some properties on Schur complements of H-matrices and diagonally dominant matrices, Linear Algebra Appl. 389 (2004) 365-380], and the same is true for nonsingular H-matrices [J.Z. Liu, J.C. Li, Z.T. Huang, X. Kong, Some properties of Schur complements and diagonal-Schur complements of diagonally dominant matrices, Linear Algebra Appl. 428 (2008) 1009-1030]. In this paper, we research the properties on diagonal-Schur complements of block diagonally dominant matrices and prove that the diagonal-Schur complements of block strictly diagonally dominant matrices are block strictly diagonally dominant matrices, and the same holds for generalized block strictly diagonally dominant matrices.     

Implicit complementarity problems on isotone projection cones

Isac and Németh [G. Isac and A. B. Németh, Projection methods, isotone projection cones and the complementarity problem, J. Math. Anal. Appl. 153 (1990), pp. 258–275] proved that solving a coincidence point equation (fixed point problem) in turn solves the corresponding implicit complementarity problem (nonlinear complementarity problem) and they exploited the isotonicity of the metric projection onto isotone projection cones to solve implicit complementarity problems (nonlinear complementarity problems) defined by these cones. In this article an iterative algorithm is studied in connection with an implicit complementarity problem. It is proved that if the sequence generated through the defined algorithm is convergent, then its limit is a solution of the coincidence point equation and thus solves the implicit complementarity problem. Sufficient conditions are given for this sequence to be convergent for implicit complementarity problems defined by isotone projection cones, extending the results of Németh [S.Z. Németh, Iterative methods for nonlinear complementarity problems on isotone projection cones, J. Math. Anal. Appl. 350 (2009), pp. 340–370]. Some existing concepts from the latter paper are extended to solve the problem of finding nonzero solutions of the implicit complementarity problem.     

Komlós's tiling theorem via graphon covers

Komlós [Komlós: Tiling Turán Theorems, Combinatorica, 2000] determined the asymptotically optimal minimum-degree condition for covering a given proportion of vertices of a host graph by vertex-disjoint copies of a fixed graph H, thus essentially extending the Hajnal–Szemerédi theorem that deals with the case when H is a clique. We give a proof of a graphon version of Komlós's theorem. To prove this graphon version, and also to deduce from it the original statement about finite graphs, we use the machinery introduced in [Hladký, Hu, Piguet: Tilings in graphons, arXiv:1606.03113]. We further prove a stability version of Komlós's theorem.     

On the strong convergence of sequences of Halpern type in Hilbert spaces

ABSTRACT

In this paper, we introduce a concept of A-sequences of Halpern type where A is an averaging infinite matrix. If A is the identity matrix, this notion become the well-know sequence generated by Halpern's iteration. A necessary and sufficient condition for the strong convergence of A-sequences of Halpern type is given whenever the matrix A satisfies some certain concentrating conditions. This class of matrices includes two interesting classes of matrices considered by Combettes and Pennanen [J. Math. Anal. Appl. 2002;275:521–536]. We deduce all the convergence theorems studied by Cianciaruso et al. [Optimization. 2016;65:1259–1275] and Muglia et al. [J. Nonlinear Convex Anal. 2016;17:2071–2082] from our result. Moreover, these results are established under the weaker assumptions. We also show that the same conclusion remains true under a new condition.     

Two inequalities involving Hadamard products of positive semi-definite Hermitian matrices

We extend two inequalities involving Hadamard products of positive definite Hermitian matrices to positive semi-definite Hermitian matrices. Simultaneously, we also show the sufficient conditions for equalities to hold. Moreover, some other matrix inequalities are also obtained. Our results and methods are different from those which are obtained by S. Liu in [J. Math. Anal. Appl. 243:458–463(2000)] and B.-Y. Wang et al. in [Lin. Alg. Appl. 302–303: 163–172(1999)].     

Characterizing Q-Matrices beyond L-Matrices

The characterization of Q-matrices, within the class of P₀ matrices due to Aganagič and Cottle, is well known. Afterward, Pang proved a similar characterization for the class L which does not contain class P₀. In this note, we establish furher the same result of Pang for a new class of matrices which properly contains class L. Furthermore, the equivalence between a Q-matrix and a Q_b-matrix, which consists of matrices such that the linear complementarity problem LCP(q,M) has a nonempty and compact solution set for all , is discussed within such a new class. Positive subdefinite matrices with rank one are specially analyzed. This work was supported by CONICYT-Chile through FONDECYT 104-0610, FONDAP-Matemáticas Aplicadas II, and Proyecto MECESUP UCO 9907.     

On the eigenvalues of quaternion matrices

This article is a continuation of the article [F. Zhang, Ger?gorin type theorems for quaternionic matrices, Linear Algebra Appl. 424 (2007), pp. 139–153] on the study of the eigenvalues of quaternion matrices. Profound differences in the eigenvalue problems for complex and quaternion matrices are discussed. We show that Brauer's theorem for the inclusion of the eigenvalues of complex matrices cannot be extended to the right eigenvalues of quaternion matrices. We also provide necessary and sufficient conditions for a complex square matrix to have infinitely many left eigenvalues, and analyse the roots of the characteristic polynomials for 2?×?2 matrices. We establish a characterisation for the set of left eigenvalues to intersect or be part of the boundary of the quaternion balls of Ger?gorin.     

Smith meets Smith: Smith normal form of Smith matrix

In 1861, Henry John Stephen Smith [H.J.S. Smith, On systems of linear indeterminate equations and congruences, Philos. Trans. Royal Soc. London. 151 (1861), pp. 293–326] published famous results concerning solving systems of linear equations. The research on Smith normal form and its applications started and continues. In 1876, Smith [H.J.S. Smith, On the value of a certain arithmetical determinant, Proc. London Math. Soc. 7 (1875/76), pp. 208–212] calculated the determinant of the n?×?n matrix ((i,?j)), having the greatest common divisor (GCD) of i and j as its ij entry. Since that, many results concerning the determinants and related topics of GCD matrices, LCM matrices, meet matrices and join matrices have been published in the literature. In this article these two important research branches developed by Smith, in 1861 and in 1876, meet for the first time. The main purpose of this article is to determine the Smith normal form of the Smith matrix ((i,?j)). We do this: we determine the Smith normal form of GCD matrices defined on factor closed sets.     

A note on extrema of linear combinations of elementary symmetric functions

This note provides a new approach to a result of Foregger [T.H. Foregger, On the relative extrema of a linear combination of elementary symmetric functions, Linear Multilinear Algebra 20 (1987) pp. 377–385] and related earlier results by Keilson [J. Keilson, A theorem on optimum allocation for a class of symmetric multilinear return functions, J. Math. Anal. Appl. 15 (1966), pp. 269–272] and Eberlein [P.J. Eberlein, Remarks on the van der Waerden conjecture, II, Linear Algebra Appl. 2 (1969), pp. 311–320]. Using quite different techniques, we prove a more general result from which the others follow easily. Finally, we argue that the proof in [Foregger, 1987] is flawed.     

Generalized quadraticity of linear combination of two generalized quadratic matrices

It is investigated the necessary and sufficient conditions for the generalized quadraticity of a linear combination of any two generalized quadratic matrices. The main result obtained is, in a sense, a generalization of the main results given in [Uç M, Özdemir H, Özban AY. On the quadraticity of linear combinations of quadratic matrices. Linear Multilinear Algebra. 2015;63:1125–1137.] which contains many of the results in the literature related to idempotency or involutivity of the linear combinations of idempotent and/or involutive matrices, to the generalized quadratic matrices.     

A new class of generalized f-projected dynamical system in Banach spaces

In this article, a new class of generalized f-projected dynamical systems is introduced and studied in Banach spaces. A global existence and uniqueness result of generalized f-projected dynamical system is proved, which generalizes the existence result of Xia and Vincent [Y.S. Xia and T.L. Vincent, On the stability of global projected dynamical systems, J. Optim. Theory Appl. 106 (2009), pp. 129–150]. The global convergence stability of the generalized f-projected dynamical system and the sensitivity result of solutions set with perturbations of the constraint sets are also obtained under some suitable conditions.     

Characterization of subdual latticial cones in Hilbert spaces by the isotonicity of the metric projection

The subdual latticial cones in Hilbert spaces are characterized by the isotonicity of a generalization of the positive part mapping which can be expressed in terms of the metric projection only. Although Németh characterized the positive cone of Hilbert lattices with the metric projection and ordering only [A.B. Németh, Characterization of a Hilbert vector lattice by the metric projection onto its positive cone, J. Approx. Theory 123 (2) (2003), pp. 295–299.], this has been done for the first time for subdual latticial cones in this article. We also note that the normal generating pointed closed convex cones for which the projection onto the cone is isotone are subdual latticial cones, but there are subdual latticial cones for which the metric projection onto the cone is not isotone [G. Isac, A.B. Németh, Monotonicity of metric projections onto positive cones of ordered Euclidean spaces, Arch. Math. 46 (6) (1986), pp. 568–576; G. Isac, A.B. Néemeth, Every generating isotone projection cone is latticial and correct, J. Math. Anal. Appl. 147 (1) (1990), pp. 53–62; G. Isac, A.B. Németh, Isotone projection cones in Hilbert spaces and the complementarity problem, Boll. Un. Mat. Ital. B 7 (4) (1990), pp. 773–802; G. Isac, A.B. Németh, Projection methods, isotone projection cones, and the complementarity problem, J. Math. Anal. Appl. 153 (1) (1990), pp. 258–275; G. Isac, A.B. Németh, Isotone projection cones in Eucliden spaces, Ann. Sci. Math Québec 16 (1) (1992), pp. 35–52].     

A structural characterization of real k-potent matrices

Some well-known characterizations of nonnegative k-potent matrices have been obtained by Flor [P. Flor, On groups of nonnegative matrices, Compositio Math. 21 (1969), pp. 376–382.] and Jeter and Pye [M. Jeter and W. Pye, Nonnegative (s,?t)-potent matrices, Linear Algebra Appl. 45 (1982), pp. 109–121.]. In this article, we obtain a structural characterization of a real k-potent matrix A, provided that (sgn(A)) ^k+1 is unambiguously defined, regardless of whether A is nonnegative or not.     

Singular Sturmian separation theorems for nonoscillatory symplectic difference systems

ABSTRACT

In this paper, we derive new singular Sturmian separation theorems for nonoscillatory symplectic difference systems on unbounded intervals. The novelty of the presented theory resides in two aspects. We introduce the multiplicity of a focal point at infinity for conjoined bases, which we incorporate into our new singular Sturmian separation theorems. At the same time we do not impose any controllability assumption on the symplectic system. The presented results naturally extend and complete the known Sturmian separation theorems on bounded intervals by J. V. Elyseeva [Comparative index for solutions of symplectic difference systems, Differential Equations 45(3) (2009), pp. 445–459, translated from Differencial'nyje Uravnenija 45 (2009), no. 3, 431–444], as well as the singular Sturmian separation theorems for eventually controllable symplectic systems on unbounded intervals by O. Do?lý and J. Elyseeva [Singular comparison theorems for discrete symplectic systems, J. Difference Equ. Appl. 20(8) (2014), pp. 1268–1288]. Our approach is based on developing the theory of comparative index on unbounded intervals and on the recent theory of recessive and dominant solutions at infinity for possibly uncontrollable symplectic systems by the authors [P. ?epitka and R. ?imon Hilscher, Recessive solutions for nonoscillatory discrete symplectic systems, Linear Algebra Appl. 469 (2015), pp. 243–275; P. ?epitka and R. ?imon Hilscher, Dominant and recessive solutions at infinity and genera of conjoined bases for discrete symplectic systems, J. Difference Equ. Appl. 23(4) (2017), pp. 657–698]. Some of our results, including the notion of the multiplicity of a focal point at infinity, are new even for an eventually controllable symplectic difference system.