Skip to content

Exact and robust summation/dot product subroutines #23

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

Open
mikolalysenko opened this issue May 22, 2015 · 2 comments
Open

Exact and robust summation/dot product subroutines #23

mikolalysenko opened this issue May 22, 2015 · 2 comments

Comments

@mikolalysenko
Copy link
Member

Would be nice to have some subroutines for doing fast summation and dot products, and maybe more speculatively exact linear solvers (though this could be prohibitively slow/expensive). This article has some neat ideas, also there is the work by Shewchuk we could perhaps adapt:

@prabod
Copy link

prabod commented Feb 14, 2016

I would like to contribute to this.How should i get started?

@rreusser
Copy link
Member

I think the best place to start is with code, as you've done with the flow network algorithms. @jaspervdg summarized some guidelines here for polishing modules and there are lots of templates to follow.

If you're asking about specific technical details though, this isn't my specialty so I don't have immediate answers for you. If that's the case, then the best place to start is probably with a specific proposal for a module or modules. If you can list the functions you'd like to implement (functions, inputs, outputs), then everything else is just a matter of implementation 😄

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

3 participants