This section describes the linear solver options available to solve the matrix system
\[ \mat{A} \vec{x} = \vec{b} \]
where
\( \mat{A} \) | = | coefficient matrix |
\( \vec{x} \) | = | vector of unknowns |
\( \vec{b} \) | = | source vector |
If the coefficient matrix only has values on its diagonal, the solution vector can be obtained inverting the matrix system:
\[ \vec{x} = \mat{A}^{-1} \vec{b} \]
Where the inverse of the diagonal matrix is simply:
\[ \mat{A}^{-1} = \frac{1}{\mathrm{diag}(\mat{A})} \]
This is available as the diagonalSolver
. More typically the matrix cannot be inverted easily and the system is solved using iterative methods, as described in the following sections.
Solver options include:
minIter
: minimum number of solver iterationsmaxIter
: maximum number of solver iterationsnSweeps
: number of solver iterations between checks for solver convergenceMatrix coefficients are stored in upper-triangular order
Would you like to suggest an improvement to this page? | Create an issue |
Copyright © 2016 OpenCFD Ltd.