SuperLU contains a set of subroutines to solve a sparse linear system A*X=B. It uses Gaussian elimination with partial pivoting (GEPP).
The columns of A may be preordered before factorization; the preordering for sparsity is completely separate from the factorization.
Compiler written to use as a reference to others who write real compilers. The emphasis is here on readability of code than anything else. It is written in Python for this very same reason. And even trivial things are commented or documented.
The idea is that one who wants to write a compiler
... [More] should be able to use this as a reference to get started and then write their compiler as efficiently as they want. [Less]
This site uses cookies to give you the best possible experience.
By using the site, you consent to our use of cookies.
For more information, please see our
Privacy Policy