My name is Margaret Hu, I am a DSPS student at Ohlone college Fremont California. The DSPS stands for Disabled Student Program and Services.
In the sageMath GSoc web site, Under the Other category I see that participant can add their own ideas. I wonder writing a direct sparse LU matrix solver in C/C++ will be of interest to sageMath. I am familiar with matrix solver since a school project and I have some idea of how to do that with minimum memory foot print. I know most of the matrix solver today used in numerical software are based on BLAS/LAPACK-compatible libraries. Many of those Fortran based library still works very well. But in today's world of big data, soon people will try to solve big linear system on mobile devices such as smart phones or raspberry pi. With the growth of big data today and the increase of the computational power, a matrix of size 100,000 to 1,000,000 can be common in scientific simulation or machine learning. It may be beneficial to have a sparse LU solver with row pivoting that takes into account of the 1G RAM that most hand held device have today. Sparse matrix need to use pointers to link non-zeros together, with 64bit OS becoming the standard, those links becomes expensive. I'd like to submit a proposal with the title of this email. I wonder if this topic is acceptable for sageMath. Thanks. -- You received this message because you are subscribed to the Google Groups "sage-gsoc" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/sage-gsoc. For more options, visit https://groups.google.com/d/optout.
