iterative-solvers 0.2.3

Iterative algorithms for solving linear systems
Documentation 
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

//! Minimal Residual method (MINRES).
//!
//! # Copyright
//!
//! Portions of this implementation are derived from [IterativeSolvers.jl](https://github.com/JuliaLinearAlgebra/IterativeSolvers.jl).
//!
//! Copyright (c) 2013--2016 The Julia Language.
//!
//! Licensed under the MIT License.

#![allow(dead_code)]

use crate::MatrixOp;
use nalgebra::DVector;

/// Minimal Residual method
pub struct MINRES<'mat, Mat: MatrixOp> {
    mat: &'mat Mat,
    solution: DVector<f64>,

    // Krylov basis vectors
    v_prev: DVector<f64>,
    v_curr: DVector<f64>,
    v_next: DVector<f64>,

    // W = R * inv(V) is computed in 3-term recurrence
    w_prev: DVector<f64>,
    w_curr: DVector<f64>,
    w_next: DVector<f64>,

    // Vector of size 4, holding the active column of the Hessenberg matrix
    h: [f64; 4],
    // rhs is just two active values of the right-hand side
    rhs: [f64; 2],

    // Some Givens rotations
    c_prev: f64,
    s_prev: f64,
    c_curr: f64,
    s_curr: f64,

    tol: f64,
    resnorm: f64,
    iteration: usize,
}