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

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

use kryst::prelude::*;
use std::sync::Arc;

struct IdentityOp(usize);

impl LinOp for IdentityOp {
    type S = R;

    fn dims(&self) -> (usize, usize) {
        (self.0, self.0)
    }

    fn matvec(&self, x: &[R], y: &mut [R]) {
        y.copy_from_slice(x);
    }

    fn as_any(&self) -> &dyn std::any::Any {
        self
    }
}

#[test]
fn api_surface_lifecycle() -> Result<(), Box<dyn std::error::Error>> {
    let _ = PcType::None;
    let _ksp_opts = KspOptions::default();
    let _pc_opts = PcOptions::default();
    let _ = ConvergedReason::Continued;

    let op = Arc::new(IdentityOp(4)) as Arc<dyn LinOp<S = R>>;
    let b = vec![S::from_real(1.0); 4];
    let mut x = vec![S::zero(); 4];

    let mut ksp = KspContext::new();
    ksp.set_type(SolverType::Gmres)?;
    ksp.set_operators(op, None);
    ksp.setup()?;

    let result = ksp.solve(&b, &mut x);
    if cfg!(feature = "complex") {
        assert!(result.is_err());
        return Ok(());
    }

    let stats = result?;
    assert!(stats.iterations <= ksp.maxits);

    Ok(())
}