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

Sparse Coefficient Matrix Optimization #240

Open
WenyinWei opened this issue May 18, 2019 · 0 comments
Open

Sparse Coefficient Matrix Optimization #240

WenyinWei opened this issue May 18, 2019 · 0 comments

Comments

@WenyinWei
Copy link

Hello guys,

It is very pleasant to see such an almost perfect and standard package to solve ode. May I ask about a question concerning the stiff system? Does the stiff system support such a big coefficient matrix odes?

, in which M is an especially sparse matrix bigger than 1000*1000. This may be better handled by adjacency linked list in the core of computation. If relevant optimization has been done, are there any materials introducing how to input the adjacency linked list or sparse matrix.

Thanks in advance for any reply.
Wenyin

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

1 participant