|
|
|
|
Linear Differential Equations as a Data Structure
|
|
|
|
|
|
|
|
نویسنده
|
Salvy Bruno
|
|
منبع
|
foundations of computational mathematics - 2019 - دوره : 19 - شماره : 5 - صفحه:1071 -1112
|
|
چکیده
|
A lot of information concerning solutions of linear differential equations can be computed directly from the equation. it is therefore natural to consider these equations as a data structure, from which mathematical properties can be computed. a variety of algorithms has thus been designed in recent years that do not aim at “solving,” but at computing with this representation. many of these results are surveyed here.
|
|
کلیدواژه
|
Computer algebra ,Linear differential equations ,Algorithms ,Complexity ,68W30 ,33F10
|
|
آدرس
|
Université de Lyon, Laboratoire LIP, France
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|