Triangular x-basis decompositions and derandomization of linear algebra algorithms over K[x]

  title={Triangular x-basis decompositions and derandomization of linear algebra algorithms over K[x]},
  author={Somi Gupta and Soumojit Sarkar and Arne Storjohann and Jonathan Valeriote},
  journal={J. Symb. Comput.},

Figures from this paper

Recent progress in linear algebra and lattice basis reduction
  • G. Villard
  • Computer Science, Mathematics
    ISSAC '11
  • 2011
This talk introduces basic tools for understanding how to generalize the Lehmer and Knuth-Schönhage gcd algorithms for basis reduction, and considers bases given by square matrices over K[x] or Z, with the notion of reduced form and LLL reduction.
Deterministic Unimodularity Certification and Applications for Integer Matrices
A deterministic method — “double-plus-one” lifting — is presented to compute the highorder residue R as well as a succinct representation of B to give a heuristic, but certified, algorithm for computing the determinant and Hermite normal form of a square, nonsingular integer matrix.
Computing minimal interpolation bases
Deterministic Reduction of Integer Nonsingular Linear System Solving to Matrix Multiplication
This work presents a deterministic reduction to matrix multiplication for the problem of linear system solving and gives an algorithm to produce the 2-adic expansion of 2^eA^-1 b up to a precision high enough such that A+1 b over \Q can be recovered using rational number reconstruction.
Computing Matrix Canonical Forms of Ore Polynomials
This thesis presents algorithms to compute canonical forms of non-singular input matrix of Ore polynomials while controlling intermediate expression swell, and uses the recent advances in polynomial matrix computations to describe an algorithm that computes the transformation matrix U such that UA = P.
Faster Algorithms for Multivariate Interpolation With Multiplicities and Simultaneous Polynomial Approximations
This paper reduces this multivariate interpolation problem to a problem of simultaneous polynomial approximations, which is solved using fast structured linear algebra and improves the best known complexity bounds for the interpolation step of the list-decoding of Reed-Solomon codes, Parvaresh-Vardy codes, and folded Reed- Solomon codes.
Fast Order Basis and Kernel Basis Computation and Related Problems
  • W. Zhou
  • Computer Science, Mathematics
  • 2013
The use of the average column degrees instead of the commonly used matrix degrees, or equivalently the maximum column degrees, makes the computational costs more precise and tighter, and the shifted minimal bases computed by the algorithms are more general than the standard minimal bases.
Computing Canonical Bases of Modules of Univariate Relations
The triangular shape of M is exploited to generalize a divide-and-conquer approach which originates from fast minimal approximant basis algorithms and relies on high-order lifting to perform fast modular products of polynomial matrices of the form P F mod M.
Computing Popov Forms of Polynomial Matrices
A Las Vegas algorithm that computes the Popov decomposition of matrices of full row rank is given and it is shown that the problem of transforming a row reduced matrix to Popov form is at least as hard as polynomial matrix multiplication.
Faster Change of Order Algorithm for Gröbner Bases under Shape and Stability Assumptions
The Hermite normal form of that matrix yields the sought lexicographic Gröbner basis, under assumptions which cover the shape position case, which improves upon both state-of-the-art complexity bounds O~(tD2) and O ~(Dω, since ω<3 and t≤D), and confirms the high practical benefit.


Fast Algorithms for for Linear Algebra Modulo N
An algorithm to recover H together with an invertible transformation matrix P which satisfies PA = H is presented which leads directly to fast algorithms for tasks involving ZN-modules.
Normal forms for general polynomial matrices
A Uniform Approach for the Fast Computation of Matrix-Type Pade Approximants
A recurrence relation is presented for the computation of a basis for the corresponding linear solution space of these approximants, and these methods result in fast (and superfast) reliable algorithms for the inversion of stripedHankel, layered Hankel, and (rectangular) block-Hankel matrices.
Asymptotically fast polynomial matrix algorithms for multivariable systems
This paper presents the asymtotically fastest known algorithms for some basic problems on univariate polynomial matrices, and shows that they essentially can be reduced to two computer algebra techniques, minimal basis computations and matrix fraction expansion/reconstruction, and toPolynomial matrix multiplication.
A local construction of the Smith normal form of a matrix polynomial
On the complexity of polynomial matrix computations
Under the straight-line program model, it is shown that multiplication is reducible to the problem of computing the coefficient of degree <i>d</i> of the determinant and algorithms for minimal approximant computation and column reduction that are based on polynomial matrix multiplication are proposed.
Parallel algorithms for matrix normal forms
Certified dense linear system solving
The shifted number system for fast linear algebra on integer matrices
High-order lifting and integrality certification