Skip to content

Commit

Permalink
Highlight non-square options
Browse files Browse the repository at this point in the history
This increases the visibility of the least-squares solvers and clarifies that all algorithms in "What method should I use for linear systems?" refer only to square linear systems.

Closes #353
  • Loading branch information
timholy authored Jun 3, 2024
1 parent e5d10e2 commit 02be357
Showing 1 changed file with 6 additions and 1 deletion.
7 changes: 6 additions & 1 deletion docs/src/index.md
Original file line number Diff line number Diff line change
Expand Up @@ -8,6 +8,8 @@ For more information on future methods have a look at the package [roadmap](http

## What method should I use for linear systems?

### Square linear systems

When solving linear systems $Ax = b$ for a square matrix $A$ there are quite some options. The typical choices are listed below:

| Method | When to use it |
Expand All @@ -22,7 +24,10 @@ We also offer [Chebyshev iteration](@ref Chebyshev) as an alternative to Conjuga

Stationary methods like [Jacobi](@ref), [Gauss-Seidel](@ref), [SOR](@ref) and [SSOR](@ref) can be used as smoothers to reduce high-frequency components in the error in just a few iterations.

When solving **least-squares** problems we currently offer just [LSMR](@ref LSMR) and [LSQR](@ref LSQR).
### Non-square systems: least squares

When solving **least-squares** problems we currently offer [LSMR](@ref LSMR) and [LSQR](@ref LSQR).
LSMR generally converges more quickly than LSQR.

## Eigenproblems and SVD

Expand Down

0 comments on commit 02be357

Please sign in to comment.