Publication | Closed Access
FAST PARALLEL COMPUTATION OF THE JORDAN NORMAL FORM OF MATRICES
13
Citations
0
References
1996
Year
Numerical AnalysisSpectral TheoryEngineeringRepresentation TheoryParallel Complexity TheoryParallel ProcessingFinite FieldFast Parallel ComputationParallel ProgrammingComputer ScienceMatrix MethodMatrix TheoryParallel ComputingMatrix AnalysisComputational GeometryJordan Normal FormField F
We establish that the problem of computing the Jordan normal form of a matrix over a field F is in [Formula: see text] for F being a field of characteristic zero or a finite field.