Fast parallel algorithms for matrix reduction to normal forms
type: Item
instance of: scholarly article
title: Fast parallel algorithms for matrix reduction to normal forms
zbMATH Open document ID: 0905.65054
author: Gilles Villard
published in: Applicable Algebra in Engineering, Communication and Computing
publication date: 1998-07-28T00:00:00Z
review text: Fast parallel algorithms are examined to compute normal forms of matrices and the corresponding transformations. The computational complexity is given for the Frobenius and Smith normal forms as well as for the Hermite and Jordan normal forms.
Mathematics Subject Classification ID: 65F30
Mathematics Subject Classification ID: 15A21
Mathematics Subject Classification ID: 65Y05
zbMATH DE Number: 1180592
zbMATH Keywords: matrix reduction
zbMATH Keywords: efficiency
zbMATH Keywords: Frobenius normal form
zbMATH Keywords: canonical forms
zbMATH Keywords: fast parallel algorithms
zbMATH Keywords: computational complexity
zbMATH Keywords: Smith normal forms
zbMATH Keywords: Jordan normal forms
reviewed by: F. Szidarovszky
describes a project that uses: Givaro
MaRDI profile type: Publication
full work available at URL: s002000050089
OpenAlex ID: W2170966175
DOI: 10.1007/S002000050089
description: scientific article; zbMATH DE number 1180592