5 citations · 6 across the 5 of their papers we have counts for
5 papers · 1 filter
Algorithms for Linearly Recurrent Sequences of Truncated Polynomials
Seung Gyu Hyun, Vincent Neiger, Éric Schost
Linear recurrent sequences are those whose elements are defined as linear combinations of preceding elements, and finding recurrence relations is a fundamental problem in computer…
Change of basis for m-primary ideals in one and two variables
Seung Gyu Hyun, Stephen Melczer, Éric Schost +1
Following recent work by van der Hoeven and Lecerf (ISSAC 2017), we discuss the complexity of linear mappings, called untangling and tangling by those authors, that arise in the co…
Implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants
Seung Gyu Hyun, Vincent Neiger, Éric Schost
Complexity bounds for many problems on matrices with univariate polynomial entries have been improved in the last few years. Still, for most related algorithms, efficient implement…
A fast algorithm for solving linearly recurrent sequences
Seung Gyu Hyun, Stephen Melczer, Catherine St-Pierre
We present an algorithm which computes the term of a sequence satisfying a linear recurrence relation of order over a field in $O( \mathsf{M}(\bar d)\log(D) + \mat…
Block-Krylov techniques in the context of sparse-FGLM algorithms
Seung Gyu Hyun, Vincent Neiger, Hamid Rahkooy +1
Consider a zero-dimensional ideal in . Inspired by Faugère and Mou's Sparse FGLM algorithm, we use Krylov sequences based on multiplication matrices…