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

add integration of maxima's non-zero detection, see how good it is #3

Open
GoogleCodeExporter opened this issue Aug 24, 2015 · 0 comments

Comments

@GoogleCodeExporter
Copy link

In order to do scalable evolution of numerical functions we need a
heuristic procedure for determining if a particular subexpression is
nonzero over a particular range of inputs (e.g. for an expressions of n
variables, and n-dimensional cube). There are a bunch of ways to do this,
interval arithmetic being the simplest, affine arithmetic being better
(http://en.wikipedia.org/wiki/Affine_arithmetic), etc. Maxima also has a
built-in function for this. How good is it? What method does it use? I
don't know...

Original issue reported on code.google.com by [email protected] on 8 Dec 2008 at 5:22

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

No branches or pull requests

1 participant