Symbolic factorization of a large sparse matrix

7 views (last 30 days)
Zohar on 19 Dec 2019
Edited: Zohar on 13 Jan 2022
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:
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?

Accepted Answer

Zohar on 23 Dec 2019
Edited: Zohar on 13 Jan 2022
  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).

More Answers (0)




Community Treasure Hunt

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

Start Hunting!