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

use crate::algebra::bridge::BridgeScratch;
use crate::algebra::prelude::*;
use crate::error::KError;
use crate::preconditioner::{PcSide, Preconditioner};

#[inline]
pub fn apply_pc_s<P>(
    pc: &P,
    side: PcSide,
    x: &[S],
    y: &mut [S],
    scratch: &mut BridgeScratch,
) -> Result<(), KError>
where
    P: Preconditioner + ?Sized,
{
    let _ = scratch;
    debug_assert_eq!(x.len(), y.len());
    pc.apply(side, x, y)
}

#[inline]
pub fn apply_pc_mut_s<P>(
    pc: &mut P,
    side: PcSide,
    x: &[S],
    y: &mut [S],
    scratch: &mut BridgeScratch,
) -> Result<(), KError>
where
    P: Preconditioner + ?Sized,
{
    let _ = scratch;
    debug_assert_eq!(x.len(), y.len());
    pc.apply_mut(side, x, y)
}