@@ -861,8 +861,8 @@ patterns with “more structure”.
861
861
!!! note
862
862
863
863
By default, the SparseArrays.jl are implemented for efficiency by caching the
864
- symbolic factorization. If the sparsity pattern of `A` may change between solves, set `reuse_symbolic=false`.
865
- If the pattern is assumed or known to be constant, set `reuse_symbolic=true` to avoid
864
+ symbolic factorization. If the sparsity pattern of `A` may change between solves, set `reuse_symbolic=false`.
865
+ If the pattern is assumed or known to be constant, set `reuse_symbolic=true` to avoid
866
866
unnecessary recomputation. To further reduce computational overhead, you can disable
867
867
pattern checks entirely by setting `check_pattern = false`. Note that this may error
868
868
if the sparsity pattern does change unexpectedly.
@@ -887,8 +887,8 @@ A fast sparse LU-factorization which specializes on sparsity patterns with “le
887
887
!!! note
888
888
889
889
By default, the SparseArrays.jl are implemented for efficiency by caching the
890
- symbolic factorization. If the sparsity pattern of `A` may change between solves, set `reuse_symbolic=false`.
891
- If the pattern is assumed or known to be constant, set `reuse_symbolic=true` to avoid
890
+ symbolic factorization. If the sparsity pattern of `A` may change between solves, set `reuse_symbolic=false`.
891
+ If the pattern is assumed or known to be constant, set `reuse_symbolic=true` to avoid
892
892
unnecessary recomputation. To further reduce computational overhead, you can disable
893
893
pattern checks entirely by setting `check_pattern = false`. Note that this may error
894
894
if the sparsity pattern does change unexpectedly.
0 commit comments