Skip to content
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion docs/src/tutorials/accelerating_choices.md
Original file line number Diff line number Diff line change
Expand Up @@ -64,7 +64,7 @@ Sparse linear solvers are not as dependent on the CPU but highly dependent on th
is being solved. For example, this is for a 1D laplacian vs a 3D laplacian, changing N to make
smaller and bigger versions:

![Sparse Linear Solve Benchmarks](../assets/dense_linear_solves.png)
![Sparse Linear Solve Benchmarks](../assets/sparse_linear_solves.png)

Notice that the optimal linear solver changes based on problem (i.e. sparsity pattern) and size.
LinearSolve.jl just uses a very simple "if small then use KLU and if large use UMFPACK", which
Expand Down