<p>Given a matrix, What is the  computational complexity of the fastest algorithm  to compute Jordan canonical form for the matrix? suppose the value of elements of the matrix and eigenvalue are complex number.</p>

CC BY-SA 4.0
2021-03-04T07:06:20.050Z
That clarification was helpful but still leaves questions. eg, even if you work in a real/complex RAM (or BSS machine over $\mathbb{C}$), the eigenvalues will almost never be polynomials in the entries of the input matrix M. If $\mathbb{Q}(M)$ denotes the field of rationals adjoin the entries of M, the eigenvalues will in general live in an extension field of $\mathbb{Q}(M)$ of degree n! (where M is n x n). They can be specified in a variety of ways (characteristic polynomial and bounding box, first d digits of accuracy, etc.), but how they are specified can affect complexity.
Joshua Grochow
CC BY-SA 4.0
2021-03-04T07:07:07.143Z
You might also be in a situation where you don't need to care about the actual *values* of the eigenvalues, and you can simply ask for combinatorial data to be output such as: the size of the Jordan blocks, and which pairs of Jordan blocks have the *same* eigenvalue (without specifying what its value is). Is there a particular setting you're interested in?
Joshua Grochow
CC BY-SA 4.0
2021-01-24T04:48:28.030Z
Have to be a little more specific. If the eigenvalues don't lie in the ground field (eg if the matrix is rational and the eigenvalues are complex irrational) how do you want the eigenvalues specified?
Joshua Grochow
<complexity><computational-mathematics>
What is the computational complexity of the fastest algorithm to compute Jordan canonical form for a matrix
XL _At_Here_There
# What is the computational complexity of the fastest algorithm to compute Jordan canonical form for a matrix

(Asked by: username_0 on 2021-01-23)

Given a matrix, What is the computational complexity of the fastest algorithm to compute Jordan canonical form for the matrix? suppose the value of elements of the matrix and eigenvalue are complex number.

**Tags:** complexity, computational-mathematics

> **Comments:**
> **username_1**: Have to be a little more specific. If the eigenvalues don't lie in the ground field (eg if the matrix is rational and the eigenvalues are complex irrational) how do you want the eigenvalues specified?  
> **username_1**: That clarification was helpful but still leaves questions. eg, even if you work in a real/complex RAM (or BSS machine over $\mathbb{C}$), the eigenvalues will almost never be polynomials in the entries of the input matrix M. If $\mathbb{Q}(M)$ denotes the field of rationals adjoin the entries of M, the eigenvalues will in general live in an extension field of $\mathbb{Q}(M)$ of degree n! (where M is n x n). They can be specified in a variety of ways (characteristic polynomial and bounding box, first d digits of accuracy, etc.), but how they are specified can affect complexity.  
> **username_1**: You might also be in a situation where you don't need to care about the actual *values* of the eigenvalues, and you can simply ask for combinatorial data to be output such as: the size of the Jordan blocks, and which pairs of Jordan blocks have the *same* eigenvalue (without specifying what its value is). Is there a particular setting you're interested in?  

---

## 0 answers

