Linear differential equations as a data structure
B Salvy - Foundations of Computational Mathematics, 2019 - Springer
Foundations of Computational Mathematics, 2019•Springer
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.
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.
Abstract
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.
Springer
Showing the best result for this search. See all results