Sparse direct solver in JS

[nikoscham]

Is there any chance in the roadmap to bring a sparse direct solver in native JS? Wishful thinking, something at the level of MUMPS! That would however require parallel capabilities for solving large linear systems. A solver like that would be a treasure for the development of FEAScript, or other computational libraries, for solving real-life cases.

Thanks to all the stdlib team for the amazing work!
Nikos

[kgryte]

@nikoscham That would be an interesting addition. And personally, I would love to explore sparse array support, but I think we are still a bit underwater at the moment just getting dense support over the finish line.

One of the main issues with sparse arrays is the multitude of formats, which essentially necessitate having a compiler. And shipping a compiler to web applications is a harder sell due to content security policies prohibiting the use of eval and new Function. The workaround is compiling to WebAssembly where it is possible to instantiate JIT'd kernels without violating CSP due to Wasm modules operating within a more secure sandbox.

One thing I am personally keeping an eye on is the development of finch-tensor in Python-land. One of its core advantages is the ability to accommodate arbitrary sparsity and array formats. Once that matures, I think it should be possible to explore porting to JavaScript with Wasm/C as a backend compilation target. However, that is a ways a way from becoming production ready.

Given this, I am loathe to prematurely "pick" a format in order to avoid potentially painful rewrites later. So, in short, having something like MUMPS would be awesome, but I don't think we have the bandwidth to add atm. :(

[kgryte]

Would a dense solver be enough for you to get by atm? If so, if there is a LAPACK routine we should target for prioritization, feel free to suggest.