Efficient algorithms for order basis computation

DOI10.1016/J.JSC.2011.12.009zbMATH Open1258.65046OpenAlexW2000760108MaRDI QIDQ420746FDOQ420746

Authors: G. Labahn, Wei Zhou 

Publication date: 23 May 2012

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2011.12.009

Recommendations

• Efficient computation of order bases
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• scientific article; zbMATH DE number 1263330
• Efficient computation of algebraic local cohomology classes and change of ordering for zero-dimensional standard bases
• Online order basis algorithm and its impact on the block Wiedemann algorithm

zbMATH Keywords

algorithmmodule basisorder basisPadé approximation

Mathematics Subject Classification ID

Vector spaces, linear dependence, rank, lineability (15A03)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Normal forms for general polynomial matrices
• Factorization of differential operators with rational functions coefficients
• A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
• Title not available (Why is that?)
• A generalization of the fast LUP matrix decomposition algorithm and applications
• Recursiveness in matrix rational interpolation problems
• Inversion components of block Hankel-like matrices
• Fraction-free computation of matrix rational interpolants and matrix GCDs
• Efficient computation of order bases
• Computing the rank and a small nullspace basis of a polynomial matrix

Cited In (12)

• Online order basis algorithm and its impact on the block Wiedemann algorithm
• Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix
• Title not available (Why is that?)
• Computing minimal interpolation bases
• Deterministic computation of the characteristic polynomial in the time of matrix multiplication
• Algorithms for simultaneous Hermite-Padé approximations
• Efficient computation of order bases
• Row reduction applied to decoding of rank-metric and subspace codes
• Allowable processing orders in the accelerated cascade algorithm
• A deterministic algorithm for inverting a polynomial matrix
• Fast computation of approximant bases in canonical form
• Symbolic computations of first integrals for polynomial vector fields

This page was built for publication: Efficient algorithms for order basis computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q420746)