• Publications
  • Influence
Palindromic linearizations of a matrix polynomial of odd degreee obtained from Fiedler pencils with repetition
Many applications give rise to structured, in particular T- palindromic, matrix polynomials. In order to solve a polynomial eigenvalue problem P(�)x = 0, where P(�) is a T-palindromic matrixExpand
  • 29
  • 4
  • PDF
Large vector spaces of block-symmetric strong linearizations of matrix polynomials
Abstract Given a matrix polynomial P ( λ ) = ∑ i = 0 k λ i A i of degree k , where A i are n × n matrices with entries in a field F , the development of linearizations of P ( λ ) that preserveExpand
  • 29
  • 3
  • PDF
Structured strong linearizations from Fiedler pencils with repetition II
Abstract In this paper we give strong linearizations of a matrix polynomial P ( λ ) preserving the skew-symmetry or T-alternating structure of P ( λ ) . The linearizations obtained are of the form SExpand
  • 18
  • 1
  • PDF
Linearizations of Hermitian Matrix Polynomials Preserving the Sign Characteristic
TLDR
The development of strong linearizations preserving whatever structure a matrix polynomial might possess has been a very active area of research in the last years, since such linearizations are the starting point of numerical algorithms for computing eigenvalues of structured matrix poyllomials with the properties imposed by the considered structure. Expand
  • 11
  • 1
  • PDF
Spectral variation under congruence
In this paper we study the possible spectra among matrices congruent to a given AεMn (C). It is important to distinguish singular A from nonsingular and, among non-singular matrices, to distinguishExpand
  • 12
  • 1
Structured distance to normality of tridiagonal matrices
Abstract In this article we study the distance d , measured in the Frobenius norm, of a tridiagonal matrix T to the set I T of similarly structured irreducible normal matrices. The matrices in theExpand
  • 6
A block-symmetric linearization of odd degree matrix polynomials with optimal eigenvalue condition number and backward error
The standard way of solving numerically a polynomial eigenvalue problem (PEP) is to use a linearization and solve the corresponding generalized eigenvalue problem (GEP). In addition, if the PEPExpand
  • 9
  • PDF
Minimal matrices in the Bruhat order for symmetric (0,1)-matrices
Abstract In this paper we study the minimal matrices for the Bruhat order on the class of symmetric ( 0 , 1 ) -matrices with given row sum vector. We will show that, when restricted to the symmetricExpand
  • 5
On the Bruhat order of labeled graphs
TLDR
We investigate two Bruhat (partial) orders on graphs with vertices labeled 1 , 2 , … , n and with a specified degree sequence R . Expand
  • 4
  • PDF
Products of matrices with prescribed spectra and ranks
This paper studies the possibility of writing a given square matrix as the product of two matrices with prescribed spectra and ranks. It extends some previously known results.
  • 5
...
1
2
3
4
5
...