Essentially optimal computation of the inverse of generic polynomial matrices
From MaRDI portal
Publication:1763425
DOI10.1016/j.jco.2004.03.005zbMath1101.68956OpenAlexW2104025802MaRDI QIDQ1763425
Gilles Villard, Claude-Pierre Jeannerod
Publication date: 22 February 2005
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2004.03.005
Related Items (5)
On the complexity of inverting integer and polynomial matrices ⋮ Inverse linear difference operators ⋮ A deterministic algorithm for inverting a polynomial matrix ⋮ Asymptotically fast polynomial matrix algorithms for multivariable systems ⋮ On the Differential and Full Algebraic Complexities of Operator Matrices Transformations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algorithm for inverting rational matrices
- An improved algorithm for the computation of Kronecker's canonical form of a singular pencil
- A new method for computing a column reduced polynomial matrix
- Fast projection methods for minimal design problems in linear system theory
- Exact solution of linear equations using p-adic expansions
- On fast multiplication of polynomials over arbitrary algebras
- On lattice reduction for polynomial matrices
- On the complexity of computing determinants
- High-order lifting and integrality certification
- Polynomial evaluation and interpolation on special sets of points
- Normal forms for general polynomial matrices
- Gaussian elimination is not optimal
- Unitäre Transformationen großer Matrizen
- Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
- A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
- Triangular Factorization and Inversion by Fast Matrix Multiplication
- Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems
- Computational Solutions of Matrix Problems Over an Integral Domain
This page was built for publication: Essentially optimal computation of the inverse of generic polynomial matrices
