Schröder matrix as inverse of Delannoy matrix

Using Riordan arrays, we introduce a generalized Delannoy matrix by weighted Delannoy numbers. It turns out that Delannoy matrix, Pascal matrix, and Fibonacci matrix are all special cases of the generalized Delannoy matrices, meanwhile Schröder matrix and Catalan matrix also arise in involving inverses of the generalized Delannoy matrices. These connections are the focus of our paper. The half of generalized Delannoy matrix is also considered. In addition, we obtain a combinatorial interpretation for the generalized Fibonacci numbers.     

The <Emphasis Type="Italic">k</Emphasis>-Fibonacci matrix and the Pascal matrix

We define the k-Fibonacci matrix as an extension of the classical Fibonacci matrix and relationed with the k-Fibonacci numbers. Then we give two factorizations of the Pascal matrix involving the k-Fibonacci matrix and two new matrices, L and R. As a consequence we find some combinatorial formulas involving the k-Fibonacci numbers.     

Split‐type octonion matrix

The split and hyperbolic (countercomplex) octonions are eight‐dimensional nonassociative algebras over the real numbers, which are in the form , where e_m's have different properties for them. The main purpose of this paper is to define the split‐type octonion and its matrix whose inputs are split‐type octonions and give some properties for them by using the real quaternions, split, and hyperbolic (countercomplex) octonions. On the other hand, to make some definitions, we present some operations on the split‐type octonions. Also, we show that every split‐type octonions can be represented by 2 × 2 real quaternion matrix and 4 × 4 complex number matrix. The information about the determinants of these matrix representations is also given. Besides, the main features of split‐type octonion matrix concept are given by using properties of  real quaternion matrices. Then, 8n × 8nreal matrix representations of split‐type octonion matrices are shown, and some algebraic structures are examined. Additionally, we introduce real quaternion adjoint matrices of split‐type octonion matrices. Moreover, necessary and sufficient conditions and definitions are given for split‐type octonion matrices to be special split‐type octonion matrices. We describe some special split‐type octonion matrices. Finally, oct‐determinant of split‐type octonion matrices is defined. Definitive and understandable examples of all definitions, theorems, and conclusions were given for a better understanding of all these concepts.     

Hermitian semidefinite matrix means and related matrix inequalities—an introduction

A survey of matrix means and matrix inequalities is presented with the work of Ando, Anderson and Duffin being showcased. The classical Arithmetic-Geometric-Harmonic Mean for two Hermitian positive semidefinite matrices is given. Other classical means such as the Gaussian Mean, power means and the symmetric function means are also discussed.     

The Sylvester–Kac matrix space

The Sylvester–Kac matrix is a tridiagonal matrix with integer entries and integer eigenvalues that appears in a variety of applicative problems. We show that it belongs to a four dimensional linear space of tridiagonal matrices that can be simultaneously reduced to triangular form. We name this space after the matrix.     

Effective matrix models ford>1 strings

We examine the critical behavior of non-linear 1-matrix models, which arise as effective models of d>1 discretized strings in the form of large N twist-reduced (TEK) matrix models.Published in Teoreticheskaya i Matematicheskaya Fizika, Vol. 95, No. 2, pp. 197–210, May, 1993.     

Inversion of a block Löwner matrix

In this paper, we give a fast algorithm to compute the parameters of an inversion formula for any nonsingular block Löwner matrix. The connection with matrix rational interpolation is given.     

Computing the determinants of matrix Padé approximation

This paper is devoted to a computational problem of two special determinants which appear in the construction of generalized inverse matrix Padé approximants of type [n/2k] for the given power series with matrix coefficients. The main tools to be used are well-known Schur complement theorem and Arnoldi process for skew-symmetric systems.     

Lur’e equations and even matrix pencils

In this work, we consider the so-called Lur’e matrix equations that arise e.g. in model reduction and linear-quadratic infinite time horizon optimal control. We characterize the set of solutions in terms of deflating subspaces of even matrix pencils. In particular, it is shown that there exist solutions which are extremal in terms of definiteness. It is shown how these special solutions can be constructed via deflating subspaces of even matrix pencils.     

A matrix reverse Hölder inequality

A matrix reverse Hölder inequality is given. This result is a counterpart to the concavity property of matrix weighted geometric means. It extends a scalar inequality due to Gheorghiu and contains several Kantorovich type inequalities.     

Newton‐Krylov iterative matrix representative spectrum

The concept of a representative spectrum is introduced in the context of Newton‐Krylov methods. This concept allows a better understanding of convergence rate accelerating techniques for Krylov‐subspace iterative methods in the context of CFD applications of the Newton‐Krylov approach to iteratively solve sets of non‐linear equations. The dependence of the representative spectrum on several parameters such as mesh, Mach number or discretization techniques is studied and analyzed. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

Oscillation of self-adjoint linear matrix Hamiltonian systems

By means of monotone functionals defined on suitable matrix spaces and new methods, oscillation criteria for self-adjoint linear Hamiltonian matrix system of the form

     

Extremal ranks of matrix expression of A − BXC with respect to Hermitian matrix

The extremal ranks of matrix expression of A − BXC with respect to X^H = X have been discussed by applying the quotient singular value decomposition Q-SVD and some rank equalities of matrices in this paper.     

A remark on Hilbert's matrix

We exhibit a Jacobi matrix T which has simple spectrum and integer entries, and 0 commutes with Hilbert's matrix. As an application we replace the computation of the eigenvectors of Hilbert's matrix (a very ill-conditioned problem) by the computation of the eigenvectors of T (a nicely stable numerical problem).     

<Emphasis Type="Italic">k</Emphasis>-Idempotency of linear combinations of an idempotent matrix and a tripotent matrix that commute

A complete solution is established to the problem of characterizing all situations in which a linear combination C = c ₁ A+c ₂ B of an idempotent matrix A and a tripotent matrix B is k-idempotent. As a special case of this, a set of necessary and sufficient conditions for a linear combination C = c ₁ A+c ₂ B to be k-idempotent when A and B are idempotent matrices, is also studied in this paper.     

Directional ‐matrix compression for high‐frequency problems

Standard numerical algorithms, such as the fast multipole method or ‐matrix schemes, rely on low‐rank approximations of the underlying kernel function. For high‐frequency problems, the ranks grow rapidly as the mesh is refined, and standard techniques are no longer attractive. Directional compression techniques solve this problem by using decompositions based on plane waves. Taking advantage of hierarchical relations between these waves' directions, an efficient approximation is obtained. This paper is dedicated to directional ‐matrices that employ local low‐rank approximations to handle directional representations efficiently. The key result is an algorithm that takes an arbitrary matrix and finds a quasi‐optimal approximation of this matrix as a directional ‐matrix using a prescribed block tree. The algorithm can reach any given accuracy, and the approximation requires only units of storage, where n is the matrix dimension, κ is the wave number, and k is the local rank. In particular, we have a complexity of if κ is constant and for high‐frequency problems characterized by κ²～n. Because the algorithm can be applied to arbitrary matrices, it can serve as the foundation of fast techniques for constructing preconditioners.     

Generalized matrix version of reverse Hölder inequality

A generalized matrix version of reverse Cauchy-Schwarz/Hölder inequality is proved. This includes the recent results proved by Bourin, Fujii, Lee, Niezgoda and Seo.     

Sub-stochastic matrix analysis for bounds computation—Theoretical results

Performance evaluation of complex systems is a critical issue and bounds computation provides confidence about service quality, reliability, etc. of such systems. The stochastic ordering theory has generated a lot of works on bounds computation. Maximal lower and minimal upper bounds of a Markov chain by a st-monotone one exist and can be efficiently computed. In the present work, we extend simultaneously this last result in two directions. On the one hand, we handle the case of a maximal monotone lower bound of a family of Markov chains where the coefficients are given by numerical intervals. On the other hand, these chains are sub-chains associated to sub-stochastic matrices. We prove the existence of this maximal bound and we provide polynomial time algorithms to compute it both for discrete and continuous Markov chains. Moreover, it appears that the bounding sub-chain of a family of strictly sub-stochastic ones is not necessarily strictly sub-stochastic. We establish a characterization of the families of sub-chains for which these bounds are strictly sub-stochastic. Finally, we show how to apply these results to a classical model of repairable system. A forthcoming paper will present detailed numerical results and comparison with other methods.     

Modifiable low‐rank approximation to a matrix

A truncated ULV decomposition (TULVD) of an m×n matrix X of rank k is a decomposition of the form X = ULV^T+E, where U and V are left orthogonal matrices, L is a k×k non‐singular lower triangular matrix, and E is an error matrix. Only U,V, L, and ∥E∥_F are stored, but E is not stored. We propose algorithms for updating and downdating the TULVD. To construct these modification algorithms, we also use a refinement algorithm based upon that in (SIAM J. Matrix Anal. Appl. 2005; 27 (1):198–211) that reduces ∥E∥_F, detects rank degeneracy, corrects it, and sharpens the approximation. Copyright © 2009 John Wiley & Sons, Ltd.     

König chain for compact matrix sets

A topological proof (via the generalized Gelfand spectral radius formula) is given of the fact that every compact set of complex n×n matrices admits a König chain.