Efficient algorithms for order basis computation
The authors focus on the efficient computation of an order basis. Two algorithms are presented to compute an entire order basis with a reasonable cost of field operations. The new transformation provides a way to extend the results from one transformed problem to another transformed problem of a higher degree and leads to an efficient computation. The first algorithm is used to efficiently compute the elements of an order basis whose shifted degree is a specified parameter. This results in a new problem of smaller dimension and higher degree. The same process is repeated again on this new problem in order to compute the elements with the next highest shifted degree.
- 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
- A generalization of the fast LUP matrix decomposition algorithm and applications
- A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
- Computing the rank and a small nullspace basis of a polynomial matrix
- Efficient computation of order bases
- Factorization of differential operators with rational functions coefficients
- Fraction-free computation of matrix rational interpolants and matrix GCDs
- scientific article; zbMATH DE number 1936673 (Why is no real title available?)
- scientific article; zbMATH DE number 2151192 (Why is no real title available?)
- scientific article; zbMATH DE number 822685 (Why is no real title available?)
- Inversion components of block Hankel-like matrices
- Normal forms for general polynomial matrices
- Recursiveness in matrix rational interpolation problems
- Allowable processing orders in the accelerated cascade algorithm
- Symbolic computations of first integrals for polynomial vector fields
- Algorithms for simultaneous Hermite-Padé approximations
- Deterministic computation of the characteristic polynomial in the time of matrix multiplication
- A deterministic algorithm for inverting a polynomial matrix
- Fast computation of approximant bases in canonical form
- Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix
- Computing minimal interpolation bases
- Efficient computation of order bases
- Online order basis algorithm and its impact on the block Wiedemann algorithm
- scientific article; zbMATH DE number 5556488 (Why is no real title available?)
- Row reduction applied to decoding of rank-metric and subspace codes
- Faster modular composition
- Fast interpolation and multiplication of unbalanced polynomials
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)
