The modern origin of matrices and their applications

This paper deals with the modern development of matrices, linear transformations, quadratic forms and their applications to geometry and mechanics, eigenvalues, eigenvectors and characteristic equations with applications. Included are the representations of real and complex numbers, and quaternions by matrices, and isomorphism in order to show that matrices form a ring in abstract algebra. Some special matrices, including Hilbert’s matrix, Toeplitz’s matrix, Pauli’s and Dirac’s matrices in quantum mechanics, and Einstein’s Pythagorean formula are discussed to illustrate diverse applications of matrix algebra. Included also is a modern piece of information that puts mathematics, science and mathematics education professionals at the forefront of advanced study and research on linear algebra and its applications.     

A brief historical introduction to Euler's formula for polyhedra,topology, graph theory and networks

This article is essentially devoted to a brief historical introduction to Euler's formula for polyhedra, topology, theory of graphs and networks with many examples from the real-world. Celebrated Königsberg seven-bridge problem and some of the basic properties of graphs and networks for some understanding of the macroscopic behaviour of real physical systems are included. We also mention some important and modern applications of graph theory or network problems from transportation to telecommunications. Graphs or networks are effectively used as powerful tools in industrial, electrical and civil engineering, communication networks in the planning of business and industry. Graph theory and combinatorics can be used to understand the changes that occur in many large and complex scientific, technical and medical systems. With the advent of fast large computers and the ubiquitous Internet consisting of a very large network of computers, large-scale complex optimization problems can be modelled in terms of graphs or networks and then solved by algorithms available in graph theory. Many large and more complex combinatorial problems dealing with the possible arrangements of situations of various kinds, and computing the number and properties of such arrangements can be formulated in terms of networks. The Knight's tour problem, Hamilton's tour problem, problem of magic squares, the Euler Graeco-Latin squares problem and their modern developments in the twentieth century are also included.     

A review of infinite matrices and their applications

Infinite matrices, the forerunner and a main constituent of many branches of classical mathematics (infinite quadratic forms, integral equations, differential equations, etc.) and of the modern operator theory, is revisited to demonstrate its deep influence on the development of many branches of mathematics, classical and modern, replete with applications. This review does not claim to be exhaustive, but attempts to present research by the authors in a variety of applications. These include the theory of infinite and related finite matrices, such as sections or truncations and their relationship to the linear operator theory on separable and sequence spaces. Matrices considered here have special structures like diagonal dominance, tridiagonal, sign distributions, etc. and are frequently nonsingular. Moreover, diagonally dominant finite and infinite matrices occur largely in numerical solutions of elliptic partial differential equations.The main focus is the theoretical and computational aspects concerning infinite linear algebraic and differential systems, using techniques like conformal mapping, iterations, truncations etc. to derive estimates based solutions. Particular attention is paid to computable precise error estimates, and explicit lower and upper bounds. Topics include Bessel’s, Mathieu equations, viscous fluid flow, simply and doubly connected regions, digital dynamics, eigenvalues of the Laplacian, etc. Also presented are results in generalized inverses and semi-infinite linear programming.     

Wiener's lemma for infinite matrices

The classical Wiener lemma and its various generalizations are important and have numerous applications in numerical analysis, wavelet theory, frame theory, and sampling theory. There are many different equivalent formulations for the classical Wiener lemma, with an equivalent formulation suitable for our generalization involving commutative algebra of infinite matrices . In the study of spline approximation, (diffusion) wavelets and affine frames, Gabor frames on non-uniform grid, and non-uniform sampling and reconstruction, the associated algebras of infinite matrices are extremely non-commutative, but we expect those non-commutative algebras to have a similar property to Wiener's lemma for the commutative algebra . In this paper, we consider two non-commutative algebras of infinite matrices, the Schur class and the Sjöstrand class, and establish Wiener's lemmas for those matrix algebras.

     

A generalized eigenmode algorithm for reducible regular matrices over the max-plus algebra with applications to the Metro-bus public transport system in Mexico city

In this paper, an algorithm for computing a generalized eigenmode of reducible regular matrices over the max-plus algebra is applied to the Metro-bus public transport system in Mexico city. A timed event Petri net model is constructed from the data table that characterizes the transport system. A max-plus recurrence equation, with a reducible and regular matrix, is associated with the transport system timed event Petri net. Next, given the reducible and regular matrix, the problem consists of giving an algorithm which will tell us how to compute its generalized eigenmode over the max plus algebra. The solution to the problem is achieved by studying some type of recurrence equations. In fact, by transforming the reducible regular matrix into its normal form, and considering a very specific recurrence equation, an explicit mathematical characterization is obtained, upon which the algorithm is constructed. The generalized eigenmode obtained sets a timetable for the transport system.     

On a class of matrices generated by certain generalized permutation matrices and applications

ABSTRACT

In this paper, we study a particular class of matrices generated by generalized permutation matrices corresponding to a subgroup of some permutation group. As applications, we first present a technique from which we can get closed formulas for the roots of many families of polynomial equations with degree between 5 and 10, inclusive. Then, we describe a tool that shows how to find solutions to Fermat's last theorem and Beal's conjecture over the square integer matrices of any dimension. Finally, simple generalizations of some of the concepts in number theory to integer square matrices are presented.     

Invertible commutativity preservers of matrices over max algebra

The max algebra consists of the nonnegative real numbers equipped with two binary operations, maximization and multiplication. We characterize the invertible linear operators that preserve the set of commuting pairs of matrices over a subalgebra of max algebra.     

Asymptotic spectra of large matrices coming from the symmetrization of Toeplitz structure functions and applications to preconditioning

The singular value distribution of the matrix‐sequence {Y_nT_n[f]}_n , with T_n[f] generated by $f\in L^1([?\pi ,\pi ])$, was shown in [J. Pestana and A.J. Wathen, SIAM J Matrix Anal Appl. 2015;36(1):273‐288]. The results on the spectral distribution of {Y_nT_n[f]}_n were obtained independently in [M. Mazza and J. Pestana, BIT, 59(2):463‐482, 2019] and [P. Ferrari, I. Furci, S. Hon, M.A. Mursaleen, and S. Serra‐Capizzano, SIAM J. Matrix Anal. Appl., 40(3):1066‐1086, 2019]. In the latter reference, the authors prove that {Y_nT_n[f]}_n is distributed in the eigenvalue sense as $${?}_{|f|}(\theta )=\left\{\begin{array}{ll}|f(\theta )|,& \theta \in [0,2\pi ],\\ ?|f(?\theta )|,& \theta \in [?2\pi ,0),\end{array}\right.$$ under the assumptions that f belongs to $L^1([?\pi ,\pi ])$ and has real Fourier coefficients. The purpose of this paper is to extend the latter result to matrix‐sequences of the form {h(T_n[f])}_n , where h is an analytic function. In particular, we provide the singular value distribution of the sequence {h(T_n[f])}_n , the eigenvalue distribution of the sequence {Y_nh(T_n[f])}_n , and the conditions on f and h for these distributions to hold. Finally, the implications of our findings are discussed, in terms of preconditioning and of fast solution methods for the related linear systems.     

A class of Lie algebras arising from intersection matrices

We find a class of Lie algebras, which are defined from the symmetrizable generalized intersection matrices. However, such algebras are different from generalized intersection matrix algebras and intersection matrix algebras. Moreover, such Lie algebras generated by semi-positive definite matrices can be classified by the modified Dynkin diagrams.     

A characterization of even doubly-stochastic matrices

Even doubly-stochastic matrices are characterized with the aid of the minima of functionals defined by the even diagonals contained in the matrix.     

On lower and upper bounds of matrices

Using an approach of Bergh, we give an alternate proof of Bennett's result on lower bounds for non-negative matrices acting on non-increasing non-negative sequences in lp when p?1 and its dual version, the upper bounds when 0<p?1. We also determine such bounds explicitly for some families of matrices.     

Spectrum of certain tridiagonal matrices when their dimension goes to infinity

This paper deals with the spectra of matrices similar to infinite tridiagonal Toeplitz matrices with perturbations and with positive off-diagonal elements. We will discuss the asymptotic behavior of the spectrum of such matrices and we use them to determine the values of a matrix function, for an entire function. In particular we determine the matrix powers and matrix exponentials.     

Generalized Cauchy–Hankel matrices and their applications to subnormal operators

It is well‐known that for a general operator T on Hilbert space, if T is subnormal, then is subnormal for all natural numbers . It is also well‐known that if T is hyponormal, then T ² need not be hyponormal. However, for a unilateral weighted shift , the hyponormality of (detected by the condition for all ) does imply the hyponormality of every power . Conversely, we easily see that for a weighted shift is not hyponormal, therefore not subnormal, but is subnormal for all . Hence, it is interesting to note when for some , the subnormality of implies the subnormality of T . In this article, we construct a non trivial large class of weighted shifts such that for some , the subnormality of guarantees the subnormality of . We also prove that there are weighted shifts with non‐constant tail such that hyponormality of a power or powers does not guarantee hyponormality of the original one. Our results have a partial connection to the following two long‐open problems in Operator Theory: (i) characterize the subnormal operators having a square root; (ii) classify all subnormal operators whose square roots are also subnormal. Our results partially depend on new formulas for the determinant of generalized Cauchy–Hankel matrices and on criteria for their positive semi‐definiteness.     

High relative accuracy with some special matrices related to Γ and β functions

For some families of totally positive matrices using $\mathrm{\Gamma }$ and $\beta$ functions, we provide their bidiagonal factorization. Moreover, when these functions are defined over integers, we prove that the bidiagonal factorization can be computed with high relative accuracy and so we can compute with high relative accuracy their eigenvalues, singular values, inverses and the solutions of some associated linear systems. We provide numerical examples illustrating this high relative accuracy.     

On parametrization of totally nonpositive matrices and applications

The problem of accurate computations for totally non‐negative matrices has been studied; however, it remains open for other sign regular matrices. One major obstacle is that there is no known parametrization of these matrices. The main contribution of the present work is that we provide such parametrization of nonsingular totally nonpositive matrices. A useful application of our results is that these parameters can determine accurately the entries of the inverse of a nonsingular totally nonpositive matrix. Copyright © 2011 John Wiley & Sons, Ltd.     

Linear recurrence relations in the algebra of matrices and applications

We study here some linear recurrence relations in the algebra of square matrices. With the aid of the Cayley–Hamilton Theorem, we derive some explicit formulas for Aⁿ (nr) and e^tA for every r×r matrix A, in terms of the coefficients of its characteristic polynomial and matrices A^j, where 0jr−1.     

Superstochastic matrices and magic Markov chains

A brief account of the conceptual formulation of the two entities in this paper’s title, plus an initial preliminary investigation of some of their mathematical properties, is given.