scientific article; zbMATH DE number 2151192
From MaRDI portal
Publication:4660659
zbMath1072.68708MaRDI QIDQ4660659
Pascal Giorgi, Claude-Pierre Jeannerod, Gilles Villard
Publication date: 4 April 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
determinantmatrix polynomialminimal basiscolumn reduced formmatrix gcdpolynomial matrix multiplication
Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30) Matrices over special rings (quaternions, finite fields, etc.) (15B33)
Related Items (34)
High-order lifting and integrality certification ⋮ Computing minimal interpolation bases ⋮ Polynomial evaluation and interpolation on special sets of points ⋮ Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix ⋮ A connection of series approximations and the basis of the Krylov space in block algorithms of Coppersmith and Montgomery ⋮ Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction ⋮ Multi-trial Guruswami-Sudan decoding for generalised Reed-Solomon codes ⋮ Fast Algorithms for Discrete Differential Equations ⋮ Computing syzygies in finite dimension using fast linear algebra ⋮ Triangular \(x\)-basis decompositions and derandomization of linear algebra algorithms over \(K[x\)] ⋮ Fast Kötter-Nielsen-Høholdt interpolation over skew polynomial rings and its application in coding theory ⋮ Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation ⋮ High-order lifting for polynomial Sylvester matrices ⋮ Efficient algorithms for order basis computation ⋮ Algorithms for simultaneous Hermite-Padé approximations ⋮ Generalized fraction-free \(LU\) factorization for singular systems with kernel extraction ⋮ Factoring polynomials over global fields. II. ⋮ Validated numerical computation of the \(\mathcal L_{\infty}\)-norm for linear dynamical systems ⋮ Normal forms for general polynomial matrices ⋮ Deterministic computation of the characteristic polynomial in the time of matrix multiplication ⋮ Output-sensitive modular algorithms for polynomial matrix normal forms ⋮ Row reduction applied to decoding of rank-metric and subspace codes ⋮ Solving structured linear systems with large displacement rank ⋮ Verification protocols with sub-linear communication for polynomial matrix operations ⋮ Essentially optimal computation of the inverse of generic polynomial matrices ⋮ Power decoding Reed-Solomon codes up to the Johnson radius ⋮ Block-Krylov techniques in the context of sparse-FGLM algorithms ⋮ Fast computation of approximant bases in canonical form ⋮ Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding ⋮ The algebraic FreeLunch: efficient Gröbner basis attacks against arithmetization-oriented primitives ⋮ Algorithms for linearly recurrent sequences of truncated polynomials ⋮ Computing the characteristic polynomial of generic Toeplitz-like and Hankel-like matrices ⋮ On Multiple Eigenvalues of a Matrix Dependent on a Parameter ⋮ Simplified High-Speed High-Distance List Decoding for Alternant Codes
This page was built for publication:
