International audienceWe present a symbolic-numeric Las Vegas algorithm for factoring Fuchsian ordinary differential operators with rational function coefficients. The new algorithm combines ideas of van Hoeij's "local-to-global" method and of the "analytic" approach proposed by van der Hoeven. It essentially reduces to the former in "easy" cases where the local-to-global method succeeds, and to an optimized variant of the latter in the "hardest" cases, while handling intermediate cases more efficiently than both
AbstractThe recently developed algorithm of Niederreiter for the factorization of polynomials over f...
Abstract: It is shown that computation technique of the operator factorization method prov...
AbstractThe neglect for over 108 years of a useful method that L. Fuchs introduced in 1884 to solve ...
International audienceWe present a symbolic-numeric Las Vegas algorithm for factoring Fuchsian ordin...
We present Fuchsia — an implementation of the Lee algorithm, which for a given system of ordinary di...
Software presentation accepted at ISSAC' 21 (Saint Petersburg, Russia, July 18-23, 2021)Internationa...
We present Fuchsia — an implementation of the Lee algorithm, which for a given system of ordinary di...
AbstractWe present a new algorithm for computing exponential solutions of differential operators wit...
Cette thèse porte sur les algorithmes de factorisation absolue. Elle débute par un état de l'art (av...
AbstractIn this paper we will give a new efficient method for factorizing differential operators wit...
AbstractThis paper presents a new, practical, efficient algorithm for factorizing the U-resultant of...
International audienceWe present an algorithm for factoring linear differential operators with coeff...
AbstractThe greatest factorial factorization (GFF) of a polynomial provides an analogue to square-fr...
In this paper, the Wiener–Hopf factorization problem is presented in a unified framework with the Ri...
AbstractIn this paper we describe software for an efficient factorization of polynomials over global...
AbstractThe recently developed algorithm of Niederreiter for the factorization of polynomials over f...
Abstract: It is shown that computation technique of the operator factorization method prov...
AbstractThe neglect for over 108 years of a useful method that L. Fuchs introduced in 1884 to solve ...
International audienceWe present a symbolic-numeric Las Vegas algorithm for factoring Fuchsian ordin...
We present Fuchsia — an implementation of the Lee algorithm, which for a given system of ordinary di...
Software presentation accepted at ISSAC' 21 (Saint Petersburg, Russia, July 18-23, 2021)Internationa...
We present Fuchsia — an implementation of the Lee algorithm, which for a given system of ordinary di...
AbstractWe present a new algorithm for computing exponential solutions of differential operators wit...
Cette thèse porte sur les algorithmes de factorisation absolue. Elle débute par un état de l'art (av...
AbstractIn this paper we will give a new efficient method for factorizing differential operators wit...
AbstractThis paper presents a new, practical, efficient algorithm for factorizing the U-resultant of...
International audienceWe present an algorithm for factoring linear differential operators with coeff...
AbstractThe greatest factorial factorization (GFF) of a polynomial provides an analogue to square-fr...
In this paper, the Wiener–Hopf factorization problem is presented in a unified framework with the Ri...
AbstractIn this paper we describe software for an efficient factorization of polynomials over global...
AbstractThe recently developed algorithm of Niederreiter for the factorization of polynomials over f...
Abstract: It is shown that computation technique of the operator factorization method prov...
AbstractThe neglect for over 108 years of a useful method that L. Fuchs introduced in 1884 to solve ...