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
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55

#![cfg(not(feature = "complex"))]

use crate::algebra::prelude::*;
use crate::context::ksp_context::Workspace;
use crate::error::KError;
use crate::parallel::{NoComm, UniverseComm};
use crate::preconditioner::PcSide;
use crate::preconditioner::Preconditioner;
use crate::preconditioner::jacobi::Jacobi;
use crate::solver::LinearSolver;
use crate::solver::gmres::GmresSolver;
use crate::solver::pcg::{PcgSolver, PcgVariant};

use super::util;

#[test]
fn pipelined_cg_reports_residual_replacements() -> Result<(), KError> {
    let a = util::rotated_anisotropy_2d(12, 0.3, 1e-2);
    let b = util::rhs_random(a.nrows(), 21);
    let op: &dyn crate::matrix::op::LinOp<S = f64> = &a;
    let mut solver = PcgSolver::new(1e-8, 5_000);
    solver.set_variant(PcgVariant::Pipelined { replace_every: 5 });
    let mut ws = Workspace::default();
    let mut pc = Jacobi::new();
    pc.setup(op)?;
    let mut x: Vec<R> = vec![R::default(); a.nrows()];
    let comm = UniverseComm::NoComm(NoComm);
    let stats = solver.solve(
        op,
        Some(&mut pc),
        &b,
        &mut x,
        PcSide::Left,
        &comm,
        None,
        Some(&mut ws),
    )?;
    assert!(stats.counters.residual_replacements > 0);
    Ok(())
}

#[test]
fn gmres_reorth_policy_toggle() {
    let mut solver = GmresSolver::new(10, 1e-8, 200);
    solver.set_reorth_policy(crate::context::ksp_context::ReorthPolicy::Always);
    assert!(matches!(
        solver.reorth_policy(),
        crate::context::ksp_context::ReorthPolicy::Always
    ));
    solver.set_reorth_policy(crate::context::ksp_context::ReorthPolicy::Never);
    assert!(matches!(
        solver.reorth_policy(),
        crate::context::ksp_context::ReorthPolicy::Never
    ));
}