Block-Krylov techniques in the context of sparse-FGLM algorithms
From MaRDI portal
Publication:2284956
DOI10.1016/j.jsc.2019.07.010zbMath1446.68203arXiv1712.04177OpenAlexW2772613967WikidataQ127469576 ScholiaQ127469576MaRDI QIDQ2284956
Éric Schost, Hamid Rahkooy, Vincent Neiger, Seung Gyu Hyun
Publication date: 15 January 2020
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.04177
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Solving polynomial systems; resultants (13P15)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of the generalized MinRank problem
- Extension of the Berlekamp-Massey algorithm to N dimensions
- A general module theoretic framework for vector M-Padé and matrix rational interpolation
- Fast algorithms for the characteristic polynomial
- Fast projection methods for minimal design problems in linear system theory
- Linear multivariable systems
- Solving zero-dimensional systems through the rational univariate representation
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Isolated points, duality and residues
- The Magma algebra system. I: The user language
- Fast algorithms for zero-dimensional polynomial systems using duality
- Radical computations of zero-dimensional ideals and real root counting.
- Algorithms for zero-dimensional ideals using linear recurrent sequences
- Sparse FGLM algorithms
- On the complexity of computing determinants
- High-order lifting and integrality certification
- On the complexity of computing with zero-dimensional triangular sets
- On the complexity of the \(F_5\) Gröbner basis algorithm
- Fast computation of special resultants
- Modern Computer Algebra
- Sub-cubic change of ordering for Gröbner basis
- Online order basis algorithm and its impact on the block Wiedemann algorithm
- Solving sparse linear equations over finite fields
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
- A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
- Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems
- On multiplicities in polynomial system solving
- Fast construction of irreducible polynomials over finite fields
