About numerical solutions of high order (>= 2) ode's

[Furkan Semih Dündar]

Dear All,

I opened a ticket a few months ago: https://trac.sagemath.org/ticket/29915

The basic idea is that Sage should be able to solve an n'th order ode numerically without the user defining it as a system of n 1st order ode's.

I have free time in the upcoming weeks and would like to contribute this feature/code.

However I don't know where to start. Should I download the source code of the latest stable version or the latest beta version?

Can I make this development under MS Windows or Linux? I have a Fedora installation, so if Linux is required this is no problem.

Last but not least, suppose I changed the required part of the Sage code. Should I compile the whole code or is there a way to patch just the difference in the code?

Best regards,

--

F. Semih Dündar

[Matthias Koeppe]

On Saturday, August 8, 2020 at 4:54:46 AM UTC-7, Furkan Semih Dündar wrote:

I opened a ticket a few months ago: https://trac.sagemath.org/ticket/29915

The basic idea is that Sage should be able to solve an n'th order ode numerically without the user defining it as a system of n 1st order ode's.

I have free time in the upcoming weeks and would like to contribute this feature/code.

However I don't know where to start. [...]

My suggestion is to start with expanding the ticket description: Describe the new functionality that you intend to provide, as well as how you intend to expose it to the user; include examples.