Displaying similar documents to “Complementary triangular forms”

Elementary triangular matrices and inverses of k-Hessenberg and triangular matrices

Luis Verde-Star (2015)

Special Matrices

Similarity:

We use elementary triangular matrices to obtain some factorization, multiplication, and inversion properties of triangular matrices. We also obtain explicit expressions for the inverses of strict k-Hessenberg matrices and banded matrices. Our results can be extended to the cases of block triangular and block Hessenberg matrices. An n × n lower triangular matrix is called elementary if it is of the form I + C, where I is the identity matrix and C is lower triangular and has all of its...

Condition numbers of Hessenberg companion matrices

Michael Cox, Kevin N. Vander Meulen, Adam Van Tuyl, Joseph Voskamp (2024)

Czechoslovak Mathematical Journal

Similarity:

The Fiedler matrices are a large class of companion matrices that include the well-known Frobenius companion matrix. The Fiedler matrices are part of a larger class of companion matrices that can be characterized by a Hessenberg form. We demonstrate that the Hessenberg form of the Fiedler companion matrices provides a straight-forward way to compare the condition numbers of these matrices. We also show that there are other companion matrices which can provide a much smaller condition...

Pentadiagonal Companion Matrices

Brydon Eastman, Kevin N. Vander Meulen (2016)

Special Matrices

Similarity:

The class of sparse companion matrices was recently characterized in terms of unit Hessenberg matrices. We determine which sparse companion matrices have the lowest bandwidth, that is, we characterize which sparse companion matrices are permutationally similar to a pentadiagonal matrix and describe how to find the permutation involved. In the process, we determine which of the Fiedler companion matrices are permutationally similar to a pentadiagonal matrix. We also describe how to find...

Complex Hadamard Matrices contained in a Bose–Mesner algebra

Takuya Ikuta, Akihiro Munemasa (2015)

Special Matrices

Similarity:

Acomplex Hadamard matrix is a square matrix H with complex entries of absolute value 1 satisfying HH* = nI, where * stands for the Hermitian transpose and I is the identity matrix of order n. In this paper, we first determine the image of a certain rational map from the d-dimensional complex projective space to Cd(d+1)/2. Applying this result with d = 3, we give constructions of complex Hadamard matrices, and more generally, type-II matrices, in the Bose–Mesner algebra of a certain 3-class...

Combinatorial aspects of generalized complementary basic matrices

Miroslav Fiedler, Frank Hall (2013)

Open Mathematics

Similarity:

This paper extends some properties of the generalized complementary basic matrices, in particular, in a combinatorial direction. These include inheritance (such as for Alternating Sign Matrices), spectral, and sign pattern matrix (including sign nonsingularity) properties.

Characterization of α1 and α2-matrices

Rafael Bru, Ljiljana Cvetković, Vladimir Kostić, Francisco Pedroche (2010)

Open Mathematics

Similarity:

This paper deals with some properties of α1-matrices and α2-matrices which are subclasses of nonsingular H-matrices. In particular, new characterizations of these two subclasses are given, and then used for proving algebraic properties related to subdirect sums and Hadamard products.

Studying the various properties of MIN and MAX matrices - elementary vs. more advanced methods

Mika Mattila, Pentti Haukkanen (2016)

Special Matrices

Similarity:

Let T = {z1, z2, . . . , zn} be a finite multiset of real numbers, where z1 ≤ z2 ≤ · · · ≤ zn. The purpose of this article is to study the different properties of MIN and MAX matrices of the set T with min(zi , zj) and max(zi , zj) as their ij entries, respectively.We are going to do this by interpreting these matrices as so-called meet and join matrices and by applying some known results for meet and join matrices. Once the theorems are found with the aid of advanced methods, we also...