russell_sparse 1.15.0

Solvers for large sparse linear systems (wraps MUMPS and UMFPACK)
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
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160

use russell_lab::{complex_vec_approx_eq, cpx, vec_approx_eq, Complex64, ComplexVector, Vector};
use russell_sparse::prelude::*;
use russell_sparse::Samples;

fn test_solver(genie: Genie) {
    println!("----------------------------------------------------------------------\n");
    match genie {
        Genie::Klu => println!("Testing KLU solver\n"),
        Genie::Mumps => println!("Testing MUMPS solver\n"),
        Genie::Umfpack => println!("Testing UMFPACK solver\n"),
    }

    let mut solver = match LinSolver::new(genie) {
        Ok(v) => v,
        Err(e) => {
            println!("FAIL(new solver): {}", e);
            return;
        }
    };

    let (coo, _, _, _) = Samples::umfpack_unsymmetric_5x5();

    match solver.actual.factorize(&coo, None) {
        Err(e) => {
            println!("FAIL(factorize): {}", e);
            return;
        }
        _ => (),
    };

    let mut x = Vector::new(5);
    let rhs = Vector::from(&[8.0, 45.0, -3.0, 3.0, 19.0]);

    match solver.actual.solve(&mut x, &rhs, false) {
        Err(e) => {
            println!("FAIL(solve): {}", e);
            return;
        }
        _ => (),
    }

    match solver.actual.solve(&mut x, &rhs, false) {
        Err(e) => {
            println!("FAIL(solve again): {}", e);
            return;
        }
        _ => (),
    }

    println!("x =\n{}", x);
    let x_correct = &[1.0, 2.0, 3.0, 4.0, 5.0];
    vec_approx_eq(&x, x_correct, 1e-14);
}

fn test_complex_solver(genie: Genie) {
    println!("----------------------------------------------------------------------\n");
    match genie {
        Genie::Klu => println!("Testing Complex KLU solver\n"),
        Genie::Mumps => println!("Testing Complex MUMPS solver\n"),
        Genie::Umfpack => println!("Testing Complex UMFPACK solver\n"),
    }

    let mut solver = match ComplexLinSolver::new(genie) {
        Ok(v) => v,
        Err(e) => {
            println!("FAIL(new solver): {}", e);
            return;
        }
    };

    let coo = match genie {
        Genie::Klu => Samples::complex_symmetric_3x3_full().0,
        Genie::Mumps => Samples::complex_symmetric_3x3_lower().0,
        Genie::Umfpack => Samples::complex_symmetric_3x3_full().0,
    };

    match solver.actual.factorize(&coo, None) {
        Err(e) => {
            println!("FAIL(factorize): {}", e);
            return;
        }
        _ => (),
    };

    let mut x = ComplexVector::new(3);
    let rhs = ComplexVector::from(&[cpx!(-3.0, 3.0), cpx!(2.0, -2.0), cpx!(9.0, 7.0)]);

    match solver.actual.solve(&mut x, &rhs, false) {
        Err(e) => {
            println!("FAIL(solve): {}", e);
            return;
        }
        _ => (),
    }

    match solver.actual.solve(&mut x, &rhs, false) {
        Err(e) => {
            println!("FAIL(solve again): {}", e);
            return;
        }
        _ => (),
    }

    println!("x =\n{}", x);
    let x_correct = &[cpx!(1.0, 1.0), cpx!(2.0, -2.0), cpx!(3.0, 3.0)];
    complex_vec_approx_eq(&x, x_correct, 1e-14);
}

fn test_solver_singular(genie: Genie) {
    println!("----------------------------------------------------------------------\n");
    match genie {
        Genie::Klu => println!("Testing KLU solver (singular matrix)\n"),
        Genie::Mumps => println!("Testing MUMPS solver (singular matrix)\n"),
        Genie::Umfpack => println!("Testing UMFPACK solver (singular matrix)\n"),
    }

    let (ndim, nnz) = (2, 2);

    let mut solver = match LinSolver::new(genie) {
        Ok(v) => v,
        Err(e) => {
            println!("FAIL(new solver): {}", e);
            return;
        }
    };

    let mut coo_singular = match CooMatrix::new(ndim, ndim, nnz, Sym::No) {
        Ok(v) => v,
        Err(e) => {
            println!("FAIL(new CooMatrix): {}", e);
            return;
        }
    };
    coo_singular.put(0, 0, 1.0).unwrap();
    coo_singular.put(1, 0, 1.0).unwrap();

    match solver.actual.factorize(&coo_singular, None) {
        Err(e) => println!("Ok(factorize singular matrix): {}\n", e),
        _ => (),
    };
}

fn main() {
    // real
    test_solver(Genie::Klu);
    test_solver(Genie::Mumps);
    test_solver(Genie::Umfpack);

    // complex
    test_complex_solver(Genie::Klu);
    test_complex_solver(Genie::Mumps);
    test_complex_solver(Genie::Umfpack);

    // singular real
    test_solver_singular(Genie::Klu);
    test_solver_singular(Genie::Mumps);
    test_solver_singular(Genie::Umfpack);

    println!("----------------------------------------------------------------------\n");
}