Skip to main navigation Skip to search Skip to main content

Polynomialization of Ordinary Differential Equations Given by Straight-Line Programs

  • Laboratoire d'Informatique (LIX)

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Given a system of ordinary differential equations represented by a straight-line program, we show how to compute an equivalent ordinary differential system represented by a straight-line program which only uses ring operations. Under mild assumptions, our method essentially runs in linear time.

Original languageEnglish
Title of host publicationISSAC 2026 - Proceedings of the 2026 International Symposium on Symbolic and Algebraic Computation
EditorsChristoph Koutschan, Alin Bostan, Clement Pernet, Thi Xuan Vu
PublisherAssociation for Computing Machinery
Pages201-208
Number of pages8
ISBN (Electronic)9798400725951
DOIs
Publication statusPublished - 12 Jul 2026
EventInternational Symposium on Symbolic and Algebraic Computation, ISSAC 2026 - Oldenburg, Germany
Duration: 13 Jul 202617 Jul 2026

Publication series

NameProceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC
ISSN (Electronic)1532-1029

Conference

ConferenceInternational Symposium on Symbolic and Algebraic Computation, ISSAC 2026
Country/TerritoryGermany
CityOldenburg
Period13/07/2617/07/26

Keywords

  • Complexity
  • Ordinary differential equations
  • Polynomialization
  • Software
  • Straight-line program

Fingerprint

Dive into the research topics of 'Polynomialization of Ordinary Differential Equations Given by Straight-Line Programs'. Together they form a unique fingerprint.

Cite this