Symbolic factorization of a large sparse matrix

7 次查看（过去 30 天）
Zohar
Zohar 2019-12-19
编辑： Zohar 2022-1-13
I'm solving a series of problems Ax=b, where A changes, but still has the same sparsity pattern. To exploit that, in the initialization, I only perform symbolic factoriazation once.
Currently, I use pardiso:
https://www.mathworks.com/matlabcentral/answers/497401-pardiso-reuse-symbolic-factorization
I was wondering how come matlab doesn't offer something like this, considering that the mldivide (based on Tim Davis's SuiteSparse) is supposed to be the fastest option?

请先登录，再回答此问题。

采纳的回答

Zohar
Zohar 2019-12-23
编辑：Zohar 2022-1-13
  1. When a symmetric matrix (Hessian) is involved, MA57 is used (ldl), which is faster than suitesparse.
  2. The symbolic factorization is actully the reordering that produces sparser factors. It's done by default with amd (metis is another option).

更多回答（0 个）

类别

在 Help Center 和 File Exchange 中查找有关 Symbolic Math Toolbox 的更多信息

标签

产品


版本

R2019a

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by