rlado / rsparse

A Rust library for solving sparse linear systems using direct methods.

Hello there 👋

About me:

• 2020-2024: Researcher @IQS School of Engineering
• 2020-2023: PhD Candidate @IQS School of Engineering.
• 2021-2023: Teaching Assistant for "Industrial Automation, Internet of Things and Digital Twins" @IQS School of Engineering
• Participant at: 2021 The Collider OnCampus Lean Launchapad
• 2020: Pg.C. in Technology Transfer: from Scientific Knowledge to the Market @Universitat Pompeu Fabra
• 2018-2020: M.Sc. in Industrial Engineering & M.Sc. in Industrial Business Management @IQS School of Engineering
• 2019: Engineering intern @ITQ GmbH
• 2017: Engineering intern at Cleandrone
• 2014-2018: B.Sc. in Industrial Engineering @IQS School of Engineering

Want to know more? Visit my personal site

rsparse's Issues

Project attachments

Support for vectors

I think it would be useful to have support for algebraic vectors. For example when solving overly contained systems where A is a tall matrix one usually does A^tAx = A^tb to turn the system into a square one.

This is not easy to do with the current API. It would also be nice to construct matrices directly from std::vectors instead of nested vectors for efficiency reasons.

Linting

Hello,

Thanks for providing this package! I want to write a Python wrapper for this since the support for sparse QR-decomposition in Python is relatively sparse itself.

I found that when one runs the linter cargo clippy on the project, there are more than 200 suggestions for improvements (mostly returns and the &mut Vec typing).

I would like to help on this and contribute to the package since I also would like to contribute the feature to solve (multiple right hand sides) from an already computated factorization after this (I will open the feature request later).
Are you interested in this?

Kind regards