Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Improvements based on review #328

Merged
merged 3 commits into from
Sep 24, 2024
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -77,5 +77,5 @@

## Related packages

- [probdiffeq](https://pnkraemer.github.io/probdiffeq/): Fast and feature-rich filtering-based probabilistic ODE solvers in JAX.
- [ProbNum](https://probnum.readthedocs.io/en/latest/): Probabilistic numerics in Python. It has not only probabilistic ODE solvers, but also probabilistic linear solvers, Bayesian quadrature, and many filtering and smoothing implementations.
- [ProbDiffEq](https://pnkraemer.github.io/probdiffeq/) is similar in scope to ProbNumDiffEq.jl and it provides fast and feature-rich probabilistic ODE solvers but is implemented in Python and built on JAX.

Check failure on line 80 in README.md

View workflow job for this annotation

GitHub Actions / runner / vale

[vale] reported by reviewdog 🐶 [Vale.Terms] Use 'probdiffeq' instead of 'ProbDiffEq'. Raw Output: {"message": "[Vale.Terms] Use 'probdiffeq' instead of 'ProbDiffEq'.", "location": {"path": "README.md", "range": {"start": {"line": 80, "column": 4}}}, "severity": "ERROR"}
nathanaelbosch marked this conversation as resolved.
Show resolved Hide resolved
- [ProbNum](https://probnum.readthedocs.io/en/latest/) implements a wide range of probabilistic numerical methods, not only for ODEs but also for linear algebra, quadrature, and filtering/smoothing. It is implemented in Python and NumPy, and it focuses more on breadth and didactic purposes than on performance.
4 changes: 2 additions & 2 deletions docs/src/index.md
Original file line number Diff line number Diff line change
Expand Up @@ -40,5 +40,5 @@

## Related packages

- [probdiffeq](https://pnkraemer.github.io/probdiffeq/): Fast and feature-rich filtering-based probabilistic ODE solvers in JAX.
- [ProbNum](https://probnum.readthedocs.io/en/latest/): Probabilistic numerics in Python. It has not only probabilistic ODE solvers, but also probabilistic linear solvers, Bayesian quadrature, and many filtering and smoothing implementations.
- [ProbDiffEq](https://pnkraemer.github.io/probdiffeq/) is similar in scope to ProbNumDiffEq.jl and it provides fast and feature-rich probabilistic ODE solvers but is implemented in Python and built on JAX.

Check failure on line 43 in docs/src/index.md

View workflow job for this annotation

GitHub Actions / runner / vale

[vale] reported by reviewdog 🐶 [Vale.Terms] Use 'probdiffeq' instead of 'ProbDiffEq'. Raw Output: {"message": "[Vale.Terms] Use 'probdiffeq' instead of 'ProbDiffEq'.", "location": {"path": "docs/src/index.md", "range": {"start": {"line": 43, "column": 4}}}, "severity": "ERROR"}
- [ProbNum](https://probnum.readthedocs.io/en/latest/) implements a wide range of probabilistic numerical methods, not only for ODEs but also for linear algebra, quadrature, and filtering/smoothing. It is implemented in Python and NumPy, and it focuses more on breadth and didactic purposes than on performance.
6 changes: 3 additions & 3 deletions docs/src/tutorials/dynamical_odes.md
Original file line number Diff line number Diff line change
Expand Up @@ -92,10 +92,10 @@ As a result, we can use the `EK1` both for first and second order ODEs, but it a
julia> using BenchmarkTools

julia> @btime solve(prob, EK1(order=3), adaptive=false, dt=1e-2);
766.312 ms (400362 allocations: 173.38 MiB)
317.336 ms (140561 allocations: 140.41 MiB)

julia> @btime solve(prob2, EK1(order=4), adaptive=false, dt=1e-2);
388.301 ms (510676 allocations: 102.78 MiB)
julia> @btime solve(prob2, EK1(order=3), adaptive=false, dt=1e-2);
136.654 ms (180647 allocations: 47.95 MiB)
```

## Energy preservation
Expand Down