Upper Hessenberg zero-column sum matrix

In summary, Let A be an (n x n) upper Hessenberg matrix with the constraints that a_{j,j} < 0 for j=1,...,n, a_{j,j}= - sum a_{i,j} for j=1,...,n-1 and a_{n,n} > - sum a_{i,n} for j=1,...,n. The example given is a 5x5 matrix with complex eigenvalues, indicating that it is diagonalizable over the complex field. This is supported by the fact that the matrix is tridiagonal and similar to a Hermitian matrix, making it diagonalizable.
  • #1
mansolo
1
0
Let A be an (n x n) upper Hessenberg matrix with the following constraints:
a_{j,j} < 0 , j=1,...,n
a_{j,j}= - sum a_{i,j} [i≠j] , j=1,...,n-1
a_{n,n} > - sum a_{i,n} [i≠n]
Example:

-1 2 0 2 0
1 -5 4 0 0
0 3 -9 1 0
0 0 5 -5 3
0 0 0 2 -7

I want to prove A is diagonalizable (I am pretty sure it is, but haven't
found a formal demostration)

Hint: If we make a_{1,4}=0; a_{4,4}=-3, then it is a tridiagonal matrix
similar to a Hermitian one, and therefore diagonalizable.

Thanks for your help,
_M.
 
Physics news on Phys.org
  • #2
mansolo said:
Let A be an (n x n) upper Hessenberg matrix with the following constraints:
a_{j,j} < 0 , j=1,...,n
a_{j,j}= - sum a_{i,j} [i≠j] , j=1,...,n-1
a_{n,n} > - sum a_{i,n} [i≠n]
Example:

-1 2 0 2 0
1 -5 4 0 0
0 3 -9 1 0
0 0 5 -5 3
0 0 0 2 -7

I want to prove A is diagonalizable (I am pretty sure it is, but haven't
found a formal demostration)

Hint: If we make a_{1,4}=0; a_{4,4}=-3, then it is a tridiagonal matrix
similar to a Hermitian one, and therefore diagonalizable.

Thanks for your help,
_M.



I know what is the Heisenberg group of upper 3 x 3 matrices, I know what is an upper matrix and I even

have some idea what is Heisenberg's Matrix mechanics...

Your matrix matrix is neither 3 x 3, nor upper and, as far as I know, now Heisenberg's as, even if we'd talk of higher dimensions

Heisenberg groups, we need upper matrices, so: what exactly is your matrix, anyway??

Anyway, using this nice site http://calculator-online.org/s/matrix/sobstvennyie/ it seems to be your matrix has

5 different complex eigenvalues so it is diagonalizable over the complex field.

DonAntonio
 

FAQ: Upper Hessenberg zero-column sum matrix

What is an Upper Hessenberg zero-column sum matrix?

An Upper Hessenberg zero-column sum matrix is a special type of square matrix where all the elements below the first subdiagonal are equal to zero and the sum of each column is also equal to zero.

What are the properties of an Upper Hessenberg zero-column sum matrix?

An Upper Hessenberg zero-column sum matrix has the following properties:

  • It is a square matrix
  • The elements below the first subdiagonal are equal to zero
  • The sum of each column is equal to zero
  • The first subdiagonal can have non-zero elements

What is the difference between an Upper Hessenberg matrix and an Upper Hessenberg zero-column sum matrix?

An Upper Hessenberg matrix is a square matrix where all the elements below the first subdiagonal are equal to zero, while an Upper Hessenberg zero-column sum matrix has the additional property that the sum of each column is equal to zero.

What are some real-world applications of Upper Hessenberg zero-column sum matrices?

Upper Hessenberg zero-column sum matrices have various applications in fields such as engineering, physics, and computer science. Some examples include:

  • Stability analysis of dynamic systems
  • Optimization problems
  • Solving differential equations
  • Signal processing

How can an Upper Hessenberg zero-column sum matrix be constructed?

An Upper Hessenberg zero-column sum matrix can be constructed by choosing a square matrix with zero elements below the first subdiagonal and then adjusting the first subdiagonal elements to ensure that the sum of each column is equal to zero. This can be done using various techniques such as Gaussian elimination, LU decomposition, or Householder transformations.

Back
Top