AbstractIf N is normal and invertible, the matrices A with N∗AN = ϱA for various ϱ span all matrices and decompose into blocks mapping eigenspaces of N to other eigenspaces. There are only two types of block structure that can occur in this way for an invertible A
It is well known that if a matrix A∈Cn×n solves the matrix equation f(A,A^H)=0,where f(x,y) is a lin...
AbstractThe problem of the existence of a J-normal matrix A when its spectrum and the spectrum of so...
AbstractMotivated by the definition of the inertia, introduced by Ostrowski and Schneider, a notion ...
AbstractIf N is normal and invertible, the matrices A with N∗AN = ϱA for various ϱ span all matrices...
AbstractLet A be a normal matrix, v be any of its indices, A-v be the matrix obtained from A by dele...
AbstractLet A be a normal matrix, v be any of its indices, A-v be the matrix obtained from A by dele...
AbstractIn hopes that it will be useful to a wide audience, a long list of conditions on an n-by-n c...
AbstractIn this short note we present two simple necessary and sufficient conditions under which a m...
An n-by-n matrix is called almost normal if the maximal cardinality of a set of orthogonal eigenvect...
AbstractTwelve known symmetry patterns of matrices are combined with three modest patterns to form a...
AbstractLet P be an n×n permutation matrix, and let p be the corresponding permutation. Let A be a m...
AbstractWe describe the possible eigenvalues of 2 × 2 block matrices Mx of the form MX=ACXB, where A...
AbstractThis paper deals with block diagonalization of partitioned (not necessarily square) matrices...
AbstractA previous paper by D. Hershkowitz [Linear and Multilinear Algebra 14 (1983) 315–342] descri...
It is well known that if a matrix A∈Cn×n solves the matrix equation f(A,A^H)=0,where f(x,y) is a lin...
It is well known that if a matrix A∈Cn×n solves the matrix equation f(A,A^H)=0,where f(x,y) is a lin...
AbstractThe problem of the existence of a J-normal matrix A when its spectrum and the spectrum of so...
AbstractMotivated by the definition of the inertia, introduced by Ostrowski and Schneider, a notion ...
AbstractIf N is normal and invertible, the matrices A with N∗AN = ϱA for various ϱ span all matrices...
AbstractLet A be a normal matrix, v be any of its indices, A-v be the matrix obtained from A by dele...
AbstractLet A be a normal matrix, v be any of its indices, A-v be the matrix obtained from A by dele...
AbstractIn hopes that it will be useful to a wide audience, a long list of conditions on an n-by-n c...
AbstractIn this short note we present two simple necessary and sufficient conditions under which a m...
An n-by-n matrix is called almost normal if the maximal cardinality of a set of orthogonal eigenvect...
AbstractTwelve known symmetry patterns of matrices are combined with three modest patterns to form a...
AbstractLet P be an n×n permutation matrix, and let p be the corresponding permutation. Let A be a m...
AbstractWe describe the possible eigenvalues of 2 × 2 block matrices Mx of the form MX=ACXB, where A...
AbstractThis paper deals with block diagonalization of partitioned (not necessarily square) matrices...
AbstractA previous paper by D. Hershkowitz [Linear and Multilinear Algebra 14 (1983) 315–342] descri...
It is well known that if a matrix A∈Cn×n solves the matrix equation f(A,A^H)=0,where f(x,y) is a lin...
It is well known that if a matrix A∈Cn×n solves the matrix equation f(A,A^H)=0,where f(x,y) is a lin...
AbstractThe problem of the existence of a J-normal matrix A when its spectrum and the spectrum of so...
AbstractMotivated by the definition of the inertia, introduced by Ostrowski and Schneider, a notion ...
DOI
Add to ORKG