UMFPACK 和 BOOST 的 uBLAS 稀疏矩阵
我在数字代码中使用 Boost 的 uBLAS,并有一个“重”解算器:
http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl?LU_Matrix_Inversion
该代码运行良好,但是速度慢得令人痛苦。经过一番研究,我发现 UMFPACK,它是一个稀疏矩阵求解器(其中其他事情)。我的代码生成大型稀疏矩阵,我需要经常对其求逆(更正确地解决,逆矩阵的值无关),因此 UMFPACk 和 BOOST 的 Sparse_Matrix 类似乎是幸福的结合。
UMFPACK 要求由三个向量指定的稀疏矩阵:条目计数、行索引和条目。 (参见示例)。
我的问题归结为,我可以从 BOOST 的稀疏矩阵类中有效地获取这三个向量吗?
I am using Boost's uBLAS in a numerical code and have a 'heavy' solver in place:
http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl?LU_Matrix_Inversion
The code works excellently, however, it is painfully slow. After some research, I found UMFPACK, which is a sparse matrix solver (among other things). My code generates large sparse matrices which I need to invert very frequently (more correctly solve, the value of the inverse matrix is irrelevant), so UMFPACk and BOOST's Sparse_Matrix class seems to be a happy marriage.
UMFPACK asks for the sparse matrix specified by three vectors: an entry count, row indexes, and the entries. (See example).
My question boils down to, can I get these three vectors efficiently from BOOST's Sparse Matrix class?
如果你对这篇内容有疑问,欢迎到本站社区发帖提问 参与讨论,获取更多帮助,或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱,如果其他用户或者作者回复了您的评论,将不能在第一时间通知您!
发布评论
评论(1)
有一个绑定:
http://mathema.tician.de/software/boost- numeric-bindings
该项目似乎停滞了两年,但它做得很好。使用示例:
注意:
虽然这项工作有效,但我正在考虑转向 NETLIB
There is a binding for this:
http://mathema.tician.de/software/boost-numeric-bindings
The project seems to be two years stagnant, but it does the job well. An example use:
NOTE:
Though this work, I am considering moving to NETLIB