Triangular \(x\)-basis decompositions and derandomization of linear algebra algorithms over \(K[x]\)
type: Item
instance of: scholarly article
title: Triangular \(x\)-basis decompositions and derandomization of linear algebra algorithms over \(K[x]\)
zbMATH Open document ID: 1268.68172
author: Somit Gupta
author: Soumojit Sarkar
author: Arne Storjohann
author: Johnny Valeriote
published in: Journal of Symbolic Computation
publication date: 2012-05-04T00:00:00Z
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 15A15
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 65F30
zbMATH DE Number: 6030306
zbMATH Keywords: polynomial matrices
zbMATH Keywords: linear system solving
zbMATH Keywords: row reduction
zbMATH Keywords: derandomization
MaRDI profile type: Publication
full work available at URL: j.jsc.2011.09.006
OpenAlex ID: W2067539682
cites work: A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
cites work: Recursiveness in matrix rational interpolation problems
cites work: Normal forms for general polynomial matrices
cites work: Exact solution of linear equations using p-adic expansions
cites work: Q4406533
cites work: Q4227282
cites work: Q4660659
cites work: Asymptotically Fast Triangularization of Matrices over Rings
cites work: Spans in the module (Zm)s
cites work: A generalization of the fast LUP matrix decomposition algorithm and applications
cites work: Asymptotically fast polynomial matrix algorithms for multivariable systems
cites work: Fast projection methods for minimal design problems in linear system theory
cites work: Parallel algorithms for matrix normal forms
cites work: Elementary Divisors and Modules
cites work: Q3875204
cites work: Rational solutions of singular linear systems
cites work: On lattice reduction for polynomial matrices
cites work: Certified dense linear system solving
cites work: Normalization of row reduced matrices
cites work: Q4660712
cites work: High-order lifting and integrality certification
cites work: The shifted number system for fast linear algebra on integer matrices
cites work: Q4252030
cites work: Generalized subresultants for computing the Smith normal form of polynomial matrices
cites work: A local construction of the Smith normal form of a matrix polynomial
DOI: 10.1016/J.JSC.2011.09.006
Recommended article: Q3447184
Recommended article: Randomized numerical linear algebra: Foundations and algorithms
Recommended article: Q3771486
Recommended article: Randomized algorithms in numerical linear algebra
Recommended article: A randomized algorithm for the decomposition of matrices
Recommended article: An Exact Correspondence of Linear Problems and Randomizing Linear Algorithms
Recommended article: Randomized algorithms for the computation of multilinear rank-\((\mu_1,\mu_2,\mu_3)\) approximations
Recommended article: Direct fail-proof triangularization algorithms for \(AX+XB=C\) with error- free and parallel implementations
Recommended article: Randomization and the parallel solution of linear algebra problems
Recommended article: Fast randomized algorithms for the structure of matrix algebras over finite fields (extended abstract)
description: scientific article; zbMATH DE number 6030306