Essentially optimal computation of the inverse of generic polynomial matrices
type: Item
instance of: scholarly article
title: Essentially optimal computation of the inverse of generic polynomial matrices
zbMATH Open document ID: 1101.68956
author: Claude-Pierre Jeannerod
author: Gilles Villard
published in: Journal of Complexity
publication date: 2005-02-22T00:00:00Z
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 2136294
zbMATH Keywords: Polynomial matrix
zbMATH Keywords: Matrix inversion
zbMATH Keywords: Minimal kernel basis
MaRDI profile type: Publication
full work available at URL: j.jco.2004.03.005
OpenAlex ID: W2104025802
cites work: Computational Solutions of Matrix Problems Over an Integral Domain
cites work: A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
cites work: Normal forms for general polynomial matrices
cites work: A new method for computing a column reduced polynomial matrix
cites work: An improved algorithm for the computation of Kronecker's canonical form of a singular pencil
cites work: Q2970775
cites work: Polynomial evaluation and interpolation on special sets of points
cites work: Triangular Factorization and Inversion by Fast Matrix Multiplication
cites work: Q4331740
cites work: On fast multiplication of polynomials over arbitrary algebras
cites work: Exact solution of linear equations using p-adic expansions
cites work: Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
cites work: Modern computer algebra
cites work: Q4660659
cites work: Fast projection methods for minimal design problems in linear system theory
cites work: Q4234262
cites work: Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems
cites work: Q4550785
cites work: On the complexity of computing determinants
cites work: An algorithm for inverting rational matrices
cites work: Q3875204
cites work: On lattice reduction for polynomial matrices
cites work: Unitäre Transformationen großer Matrizen
cites work: Q4660712
cites work: High-order lifting and integrality certification
cites work: Gaussian elimination is not optimal
DOI: 10.1016/J.JCO.2004.03.005
description: scientific article; zbMATH DE number 2136294