Struct ComplexLinSolver 

pub struct ComplexLinSolver<'a> {
    pub actual: Box<dyn Send + ComplexLinSolTrait + 'a>,
}

Unifies the access to linear system solvers

Fields

actual: Box<dyn Send + ComplexLinSolTrait + 'a>

Holds the actual implementation

Implementations

impl<'a> ComplexLinSolver<'a>

pub fn new(genie: Genie) -> Result<Self, StrError>

Allocates a new instance

Input

• genie – the actual implementation that does all the magic

pub fn compute( genie: Genie, x: &mut ComplexVector, mat: &ComplexCooMatrix, rhs: &ComplexVector, params: Option<LinSolParams>, ) -> Result<Self, StrError>

Computes the solution of a complex linear system

Solves the linear system:

  A   · x = rhs
(m,n)  (n)  (m)

Output

• x – the vector of unknown values with dimension equal to mat.ncol

Input

• genie – the actual implementation that does all the magic
• mat – the matrix representing the sparse coefficient matrix A (see Notes below)
• rhs – the right-hand side vector with know values an dimension equal to coo.nrow
• verbose – shows messages

Notes

1. For symmetric matrices, MUMPS requires crate::Sym::YesLower
2. For symmetric matrices, UMFPACK requires crate::Sym::YesFull
3. This function calls the actual implementation (genie) via the functions factorize, and solve.
4. This function is best for a single-use, whereas the actual solver should be considered for a recurrent use (e.g., inside a loop).