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

Use more efficient multiplication of two Taylor models #29

Open
dpsanders opened this issue Feb 6, 2019 · 5 comments
Open

Use more efficient multiplication of two Taylor models #29

dpsanders opened this issue Feb 6, 2019 · 5 comments

Comments

@dpsanders
Copy link
Member

That does not require duplicating the order of the Taylor series.

@dpsanders
Copy link
Member Author

This is in TaylorN/arithmetic.jl

@dpsanders
Copy link
Member Author

This is usually done by adding a new field order_bounds to each Taylor model.
This gives bounds for the homogeneous polynomial at each order.

@dpsanders
Copy link
Member Author

How do you feel about that @lbenet ?

@lbenet
Copy link
Member

lbenet commented Feb 8, 2019

I agree that this may avoid duplicating the order, which certainly improves memory allocations and speed.

I'll try to spend some time on this tonight or tomorrow (I have to give tomorrow a talk); I'll begin trying to upgrade what you had in TaylorN/arithmetic.jl.

This is usually done by adding a new field order_bounds to each Taylor model.
This gives bounds for the homogeneous polynomial at each order.

I'm not sure I understand the idea here; do you mean a function to compute the bounds of each HomogeneousPolynomial?

@dpsanders
Copy link
Member Author

I mean that the bounds are computed when the TaylorModelN is defined. Alternatively they can just be computed in the moment, but this will be slower if the object is reused in other calculations.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants