We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 6af6824 commit 14dc4b0Copy full SHA for 14dc4b0
docs/src/tutorials/accelerating_choices.md
@@ -64,7 +64,7 @@ Sparse linear solvers are not as dependent on the CPU but highly dependent on th
64
is being solved. For example, this is for a 1D laplacian vs a 3D laplacian, changing N to make
65
smaller and bigger versions:
66
67
-
+
68
69
Notice that the optimal linear solver changes based on problem (i.e. sparsity pattern) and size.
70
LinearSolve.jl just uses a very simple "if small then use KLU and if large use UMFPACK", which
0 commit comments