How tight is Hadamard's bound?
Abbott, John, Mulders, Thom (2001)
Experimental Mathematics
Similarity:
Displaying similar documents to “The Achilles' heel of ?”
How tight is Hadamard's bound?
Generating valid correlation matrices.
Budden, Mark, Hadavas, Paul, Hoffman, Lorrie, Pretz, Chris (2007)
Applied Mathematics E-Notes [electronic only]
Similarity:
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.
A simple cocyclic Jacket matrices.
Lee, Moon Ho, Feng, Gui-Liang, Chen, Zhu (2008)
Mathematical Problems in Engineering
Similarity:
New error bounds for linear complementarity problems of weakly chained diagonally dominantB-matrices
Deshu Sun, Feng Wang (2017)
Open Mathematics
Similarity:
Some new error bounds for the linear complementarity problems are obtained when the involved matrices are weakly chained diagonally dominant B-matrices. Numerical examples are given to show the effectiveness of the proposed bounds.
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...
A survey of error analysis of matrix algorithms
James Hardy Wilkinson (1968)
Aplikace matematiky
Similarity:
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...