kryst 3.2.1

Krylov subspace and preconditioned iterative solvers for dense and sparse linear systems, with shared and distributed memory parallelism.
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21

use crate::parallel::UniverseComm;
use crate::utils::convergence::SolveStats;

pub trait Solver<A, S = f64> {
    type Error;

    fn setup(&mut self, a: &A, comm: &UniverseComm) -> Result<(), Self::Error>;

    fn factor(&mut self, a: &A) -> Result<(), Self::Error>;

    fn solve(
        &mut self,
        b: &[S],
        x: &mut [S],
        comm: &UniverseComm,
    ) -> Result<SolveStats<S>, Self::Error>;

    fn reuse_factorization(&self) -> bool {
        false
    }
}