Efficient decomposition of separable algebras.
type: Item
instance of: scholarly article
title: Efficient decomposition of separable algebras.
zbMATH Open document ID: 1059.16018
DOI: 10.1016/S0747-7171(03)00071-3
published in: Journal of Symbolic Computation
publication date: 2004-06-22T00:00:00Z
Mathematics Subject Classification ID: 16S50
Mathematics Subject Classification ID: 16H05
Mathematics Subject Classification ID: 16Z05
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 2077002
zbMATH Keywords: efficient algorithms
zbMATH Keywords: separable matrix algebras
zbMATH Keywords: generators of centers
zbMATH Keywords: Las Vegas algorithms
zbMATH Keywords: minimal polynomials
author: Wayne Eberly
author: Mark Giesbrecht
MaRDI profile type: Publication
cites work: Q4004078
cites work: Triangular Factorization and Inversion by Fast Matrix Multiplication
cites work: Q4331740
cites work: Finding the radical of an algebra of linear transformations
cites work: On the Asymptotic Complexity of Matrix Multiplication
cites work: Q5340151
cites work: A probabilistic remark on algebraic program testing
cites work: Q4227340
cites work: Efficient decomposition of associative algebras over finite fields
cites work: Nearly Optimal Algorithms for Canonical Matrix Forms
cites work: Q4312071
cites work: A generalization of the fast LUP matrix decomposition algorithm and applications
cites work: Finding the radical of matrix algebras using Fitting decompositions
cites work: Fast randomized algorithms for the structure of matrix algebras over finite fields (extended abstract)
cites work: Finding maximal orders in semisimple algebras over \(\mathbb{Q}\)
cites work: Parallel algorithms for matrix normal forms
cites work: Fast algorithms for the characteristic polynomial
cites work: Q3218280
cites work: Q3961610
cites work: Zero divisors in quaternion algebras
cites work: Computing the structure of finite algebras
cites work: Algorithmic properties of maximal orders in simple algebras over \(\mathbb{Q}\)
cites work: Computing with endomorphism rings of modular representations
cites work: Fast multiplication of polynomials over fields of characteristic 2
cites work: Fast multiplication of large numbers
cites work: Fast Probabilistic Algorithms for Verification of Polynomial Identities
cites work: Modern computer algebra
cites work: Q3851616
description: scientific article; zbMATH DE number 2077002