Alin Bostan
ABSTRACT
We address complexity issues for linear differential equations in characteristic p >;0: resolution and computation of the p-curvature. For these tasks, our main focus is on algorithms whose complexity behaves well with respect to p. We prove bounds linear in p on the degree of polynomial solutions and propose algorithms for testing the existence of polynomial solutions in sublinear time Õ(p1/2), and for determining a whole basis of the solution space in quasi-linear time Õ(p); the Õ notation indicates that we hide logarithmic factors. We show that for equations of arbitrary order, the p-curvature can be computed in subquadratic time Õ(p1.79), and that this can be improved to O(log(p)) for first order equations and to Õ(p) for classes of second order equations.
- S. A. Abramov, M. Bronstein, and M. Petkovšek. On polynomial solutions of linear operator equations. In ISSAC'95, pages 290--296. ACM Press, 1995. Google Scholar
Digital Library
- S. J. Berkowitz. On computing the determinant in small parallel time using a small number of processors. Inform. Process. Lett., 18(3):147--150, 1984. Google ScholarDigital Library
- A. Bostan. Algorithmique efficace pour des opérations de base en calcul formel. PhD thesis, École polytechnique, 2003.Google Scholar
- A. Bostan, S. Boukraa, S. Hassani, J. M. Maillard, J. A. Weil, and N. Zenine. Globally nilpotent differential operators and the square Ising model. J. Phys. A: Math. Theor., 42(12), 2009.Google ScholarCross Ref
- A. Bostan, F. Chyzak, and N. Le Roux. Products of ordinary differential operators by evaluation and interpolation. In ISSAC'08, pages 23--30. ACM, 2008. Google ScholarDigital Library
- A. Bostan, T. Cluzeau, and B. Salvy. Fast algorithms for polynomial solutions of linear differential equations. In ISSAC'05, pages 45--52. ACM Press, 2005. Google ScholarDigital Library
- A. Bostan and M. Kauers. The complete generating function for Gessel walks is algebraic. In preparation.Google Scholar
- A. Bostan and M. Kauers. Automatic classification of restricted lattice walks. In FPSAC'09, to appear.Google Scholar
- R. P. Brent and H. T. Kung. Fast algorithms for manipulating formal power series. J. ACM, 25(4):581--595, 1978. Google ScholarDigital Library
- D. G. Cantor and E. Kaltofen. On fast multiplication of polynomials over arbitrary algebras. Acta Inform., 28(7):693--701, 1991. Google ScholarDigital Library
- T. Cluzeau. Factorization of differential systems in characteristic p. In ISSAC'03, pages 58--65. ACM Press, 2003. Google ScholarDigital Library
- T. Cluzeau. Algorithmique modulaire des équations différentielles linéaires. PhD thesis, Univ. Limoges, 2004.Google Scholar
- D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. J. Symb. Comp., 9(3):251--280, 1990. Google ScholarDigital Library
- B. Dwork. Lectures on p-adic differential equations, volume 253 of Grundlehren der mathematischen Wissenschaften. Springer-Verlag, New York, Heidelberg, Berlin, 1982.Google Scholar
- B. Dwork. Differential operators with nilpotent p-curvature. Amer. J. Math., 112(5):749--786, 1990.Google ScholarCross Ref
- C. M. Fiduccia. An efficient formula for linear recurrences. SIAM Journal on Computing, 14(1):106--112, 1985. Google ScholarDigital Library
- J. von zur Gathen and J. Gerhard. Fast algorithms for Taylor shifts and certain difference equations. In ISSAC'97, pages 40--47. ACM, 1997. Google ScholarDigital Library
- J. von zur Gathen and J. Gerhard. Modern computer algebra. Cambridge University Press, 1999. Google ScholarDigital Library
- T. Honda. Algebraic differential equations. In Symposia Mathematica, Vol. XXIV, pp. 169--204. Academic Press, 1981.Google Scholar
- N. M. Katz. Nilpotent connections and the monodromy theorem: Applications of a result of Turrittin. Publ. Math. Inst. Hautes Études Sci., (39):175--232, 1970.Google Scholar
- N. M. Katz. A conjecture in the arithmetic theory of differential equations. Bull. Soc. Math. France, (110):203--239, 1982.Google Scholar
- A. Schönhage and V. Strassen. Schnelle Multiplikation groß er Zahlen. Computing, 7:281--292, 1971.Google ScholarCross Ref
- J. van der Hoeven. FFT-like multiplication of linear differential operators. J. Symb. Comp., 33(1):123--127, 2002. Google ScholarDigital Library
- M. van der Put. Differential equations in characteristic p. Compositio Mathematica, 97:227--251, 1995.Google Scholar
- M. van der Put. Reduction modulo p of differential equations. Indag. Mathem., 7(3):367--387, 1996.Google ScholarCross Ref
- M. van der Put and M. Singer. Galois theory of linear differential equations. Springer, 2003.Google ScholarCross Ref
- J. F. Voloch. A note on the arithmetic of differential equations. Indag. Mathem., 11(44):617--621, 2000.Google ScholarCross Ref
Index Terms
- Fast algorithms for differential equations in positive characteristic
Recommendations
Fast algorithms for polynomial solutions of linear differential equations
ISSAC '05: Proceedings of the 2005 international symposium on Symbolic and algebraic computationWe investigate polynomial solutions of homogeneous linear differential equations with coefficients that are polynomials with integer coefficients. The problems we consider are the existence of nonzero polynomial solutions, the determination of the ...
Regarding polynomial approximation for ordinary differential equations
In this article, we consider an application of the approximate iterative method of Dzyadyk [V.K. Dzyadyk, Approximation methods for solutions of differential and integral equations, VSP, Utrecht, The Netherlands, 1995] to the construction of approximate ...
A fast algorithm for computing the characteristic polynomial of the p-curvature
ISSAC '14: Proceedings of the 39th International Symposium on Symbolic and Algebraic ComputationWe discuss theoretical and algorithmic questions related to the p-curvature of differential operators in characteristic p. Given such an operator L, and denoting by Ξ(L) the characteristic polynomial of its p-curvature, we first prove a new, alternative,...
Comments