Abstract
A subroutine for very-high-precision numerical solution of a class of ordinary differential equations is provided. For given evaluation point and equation parameters the memory requirement scales linearly with precision , and the number of algebraic operations scales roughly linearly with when becomes sufficiently large. We discuss results from extensive tests of the code, and how one for a given evaluation point and equation parameters may estimate precision loss and computing time in advance.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.