russell_sparse 1.13.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
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
use super::{ComplexCscMatrix, CscMatrix, Sym};
use crate::StrError;
use std::ffi::OsStr;
use std::fmt::Write;
use std::fs::{self, File};
use std::io::Write as IoWrite;
use std::path::Path;

impl CscMatrix {
    /// Writes a MatrixMarket file
    ///
    /// # Input
    ///
    /// * `full_path` -- may be a String, &str, or Path
    /// * `vismatrix` -- generate a SMAT file for Vismatrix instead of a MatrixMarket
    ///
    /// # Notes
    ///
    /// 1. The vismatrix format is is similar to the MatrixMarket format
    ///    without the header, and the indices start at zero.
    /// 2. If the matrix is symmetric, then:
    ///     * Only the lower triangle + diagonal will be written (standard MatrixMarket format)
    ///     * For vismatrix, the full matrix will be written
    ///
    /// # References
    ///
    /// * MatrixMarket: <https://math.nist.gov/MatrixMarket/formats.html>
    /// * MatrixMarket collection: <https://suitesparse-collection-website.herokuapp.com/>
    /// * Vismatrix: <https://github.com/cpmech/vismatrix>
    pub fn write_matrix_market<P>(&self, full_path: &P, vismatrix: bool) -> Result<(), StrError>
    where
        P: AsRef<OsStr> + ?Sized,
    {
        // output buffer
        let mut buffer = String::new();

        // write header
        if !vismatrix {
            if self.symmetric == Sym::No {
                write!(&mut buffer, "%%MatrixMarket matrix coordinate real general\n").unwrap();
            } else {
                write!(&mut buffer, "%%MatrixMarket matrix coordinate real symmetric\n").unwrap();
            }
        }

        // compute the number of non-zeros to be written
        let nnz = if vismatrix && (self.symmetric == Sym::YesLower || self.symmetric == Sym::YesUpper) {
            // will mirror off-diagonal elements
            let mut count = 0;
            for j in 0..self.ncol {
                for p in self.col_pointers[j]..self.col_pointers[j + 1] {
                    let i = self.row_indices[p as usize] as usize;
                    count += 1;
                    if i != j {
                        count += 1;
                    }
                }
            }
            count
        } else if !vismatrix && self.symmetric == Sym::YesFull {
            // will consider the lower-triangle only
            let mut count = 0;
            for j in 0..self.ncol {
                for p in self.col_pointers[j]..self.col_pointers[j + 1] {
                    let i = self.row_indices[p as usize] as usize;
                    if i >= j {
                        count += 1;
                    }
                }
            }
            count
        } else {
            // will use the default number of non-zeros
            self.col_pointers[self.ncol] as usize
        };

        // write dimensions
        write!(&mut buffer, "{} {} {}\n", self.nrow, self.ncol, nnz).unwrap();

        // write data
        if vismatrix {
            for j in 0..self.ncol {
                for p in self.col_pointers[j]..self.col_pointers[j + 1] {
                    let i = self.row_indices[p as usize] as usize;
                    let aij = self.values[p as usize];
                    write!(&mut buffer, "{} {} {:?}\n", i, j, aij).unwrap();
                    if self.symmetric == Sym::YesLower || self.symmetric == Sym::YesUpper {
                        if i != j {
                            // mirror off-diagonal elements
                            write!(&mut buffer, "{} {} {:?}\n", j, i, aij).unwrap();
                        }
                    }
                }
            }
        } else {
            for j in 0..self.ncol {
                for p in self.col_pointers[j]..self.col_pointers[j + 1] {
                    let i = self.row_indices[p as usize] as usize;
                    let aij = self.values[p as usize];
                    match self.symmetric {
                        Sym::No => write!(&mut buffer, "{} {} {:?}\n", i + 1, j + 1, aij).unwrap(),
                        Sym::YesLower => write!(&mut buffer, "{} {} {:?}\n", i + 1, j + 1, aij).unwrap(),
                        Sym::YesUpper => write!(&mut buffer, "{} {} {:?}\n", j + 1, i + 1, aij).unwrap(),
                        Sym::YesFull => {
                            if i >= j {
                                // consider the lower-triangle only
                                write!(&mut buffer, "{} {} {:?}\n", i + 1, j + 1, aij).unwrap()
                            }
                        }
                    }
                }
            }
        }

        // create directory
        let path = Path::new(full_path);
        if let Some(p) = path.parent() {
            fs::create_dir_all(p).map_err(|_| "cannot create directory")?;
        }

        // write file
        let mut file = File::create(path).map_err(|_| "cannot create file")?;
        file.write_all(buffer.as_bytes()).map_err(|_| "cannot write file")?;

        // force sync
        file.sync_all().map_err(|_| "cannot sync file")?;
        Ok(())
    }
}

impl ComplexCscMatrix {
    /// Writes a MatrixMarket file
    ///
    /// # Input
    ///
    /// * `full_path` -- may be a String, &str, or Path
    /// * `vismatrix` -- generate a SMAT file for Vismatrix instead of a MatrixMarket
    ///
    /// # Notes
    ///
    /// 1. The vismatrix format is is similar to the MatrixMarket format
    ///    without the header, and the indices start at zero.
    /// 2. `vismatrix` cannot handle complex numbers, thus, we save `|z| = sqrt(Re(z)² + Im(z)²)`
    ///    instead of `z` in the vismatrix file
    /// 3. If the matrix is symmetric, then:
    ///     * Only the lower triangle + diagonal will be written (standard MatrixMarket format)
    ///     * For vismatrix, the full matrix will be written
    ///
    /// # References
    ///
    /// * MatrixMarket: <https://math.nist.gov/MatrixMarket/formats.html>
    /// * Vismatrix: <https://github.com/cpmech/vismatrix>
    pub fn write_matrix_market<P>(&self, full_path: &P, vismatrix: bool) -> Result<(), StrError>
    where
        P: AsRef<OsStr> + ?Sized,
    {
        // output buffer
        let mut buffer = String::new();

        // write header
        if !vismatrix {
            if self.symmetric == Sym::No {
                write!(&mut buffer, "%%MatrixMarket matrix coordinate complex general\n").unwrap();
            } else {
                write!(&mut buffer, "%%MatrixMarket matrix coordinate complex symmetric\n").unwrap();
            }
        }

        // compute the number of non-zeros to be written
        let nnz = if vismatrix && (self.symmetric == Sym::YesLower || self.symmetric == Sym::YesUpper) {
            // will mirror off-diagonal elements
            let mut count = 0;
            for j in 0..self.ncol {
                for p in self.col_pointers[j]..self.col_pointers[j + 1] {
                    let i = self.row_indices[p as usize] as usize;
                    count += 1;
                    if i != j {
                        count += 1;
                    }
                }
            }
            count
        } else if !vismatrix && self.symmetric == Sym::YesFull {
            // will consider the lower-triangle only
            let mut count = 0;
            for j in 0..self.ncol {
                for p in self.col_pointers[j]..self.col_pointers[j + 1] {
                    let i = self.row_indices[p as usize] as usize;
                    if i >= j {
                        count += 1;
                    }
                }
            }
            count
        } else {
            // will use the default number of non-zeros
            self.col_pointers[self.ncol] as usize
        };

        // write dimensions
        write!(&mut buffer, "{} {} {}\n", self.nrow, self.ncol, nnz).unwrap();

        // write data
        if vismatrix {
            for j in 0..self.ncol {
                for p in self.col_pointers[j]..self.col_pointers[j + 1] {
                    let i = self.row_indices[p as usize] as usize;
                    let aij = self.values[p as usize];
                    write!(&mut buffer, "{} {} {:?}\n", i, j, aij.norm()).unwrap();
                    if self.symmetric == Sym::YesLower || self.symmetric == Sym::YesUpper {
                        if i != j {
                            // mirror off-diagonal elements
                            write!(&mut buffer, "{} {} {:?}\n", j, i, aij.norm()).unwrap();
                        }
                    }
                }
            }
        } else {
            for j in 0..self.ncol {
                for p in self.col_pointers[j]..self.col_pointers[j + 1] {
                    let i = self.row_indices[p as usize] as usize;
                    let aij = self.values[p as usize];
                    match self.symmetric {
                        Sym::No => write!(&mut buffer, "{} {} {:?} {:?}\n", i + 1, j + 1, aij.re, aij.im).unwrap(),
                        Sym::YesLower => {
                            write!(&mut buffer, "{} {} {:?} {:?}\n", i + 1, j + 1, aij.re, aij.im).unwrap()
                        }
                        Sym::YesUpper => {
                            write!(&mut buffer, "{} {} {:?} {:?}\n", j + 1, i + 1, aij.re, aij.im).unwrap()
                        }
                        Sym::YesFull => {
                            if i >= j {
                                // consider the lower-triangle only
                                write!(&mut buffer, "{} {} {:?} {:?}\n", i + 1, j + 1, aij.re, aij.im).unwrap()
                            }
                        }
                    }
                }
            }
        }

        // create directory
        let path = Path::new(full_path);
        if let Some(p) = path.parent() {
            fs::create_dir_all(p).map_err(|_| "cannot create directory")?;
        }

        // write file
        let mut file = File::create(path).map_err(|_| "cannot create file")?;
        file.write_all(buffer.as_bytes()).map_err(|_| "cannot write file")?;

        // force sync
        file.sync_all().map_err(|_| "cannot sync file")?;
        Ok(())
    }
}

////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

#[cfg(test)]
mod tests {
    use super::*;
    use crate::Samples;
    use russell_lab::{mat_approx_eq, Matrix};

    #[test]
    fn csc_write_matrix_market_works() {
        //  2  3  .  .  .
        //  3  .  4  .  6
        //  . -1 -3  2  .
        //  .  .  1  .  .
        //  .  4  2  .  1
        let (_, csc, _, _) = Samples::umfpack_unsymmetric_5x5();
        let full_path = "/tmp/russell_sparse/test_write_matrix_market_csc.mtx";
        csc.write_matrix_market(full_path, false).unwrap();
        let contents = fs::read_to_string(full_path).map_err(|_| "cannot open file").unwrap();
        assert_eq!(
            contents,
            "%%MatrixMarket matrix coordinate real general\n\
             5 5 12\n\
             1 1 2.0\n\
             2 1 3.0\n\
             1 2 3.0\n\
             3 2 -1.0\n\
             5 2 4.0\n\
             2 3 4.0\n\
             3 3 -3.0\n\
             4 3 1.0\n\
             5 3 2.0\n\
             3 4 2.0\n\
             2 5 6.0\n\
             5 5 1.0\n"
        );
    }

    #[test]
    fn csc_write_matrix_market_sym_works() {
        let correct = "%%MatrixMarket matrix coordinate real symmetric\n\
                       3 3 5\n\
                       1 1 2.0\n\
                       2 1 -1.0\n\
                       2 2 2.0\n\
                       3 2 -1.0\n\
                       3 3 2.0\n";
        //  2  -1              2     sym
        // -1   2  -1    =>   -1   2
        //     -1   2             -1   2
        let (_, csc, _, _) = Samples::positive_definite_3x3_lower();
        let full_path = "/tmp/russell_sparse/test_write_matrix_market_csc_sym_lower.mtx";
        csc.write_matrix_market(full_path, false).unwrap();
        let contents = fs::read_to_string(full_path).map_err(|_| "cannot open file").unwrap();
        assert_eq!(contents, correct);
        //  2  -1              2  -1
        // -1   2  -1    =>        2  -1
        //     -1   2          sym     2
        let (_, csc, _, _) = Samples::positive_definite_3x3_upper();
        let full_path = "/tmp/russell_sparse/test_write_matrix_market_csc_sym_upper.mtx";
        csc.write_matrix_market(full_path, false).unwrap();
        let contents = fs::read_to_string(full_path).map_err(|_| "cannot open file").unwrap();
        assert_eq!(contents, correct);
        //  2  -1
        // -1   2  -1
        //     -1   2
        let (_, csc, _, _) = Samples::positive_definite_3x3_full();
        let full_path = "/tmp/russell_sparse/test_write_matrix_market_csc_sym_full.mtx";
        csc.write_matrix_market(full_path, false).unwrap();
        let contents = fs::read_to_string(full_path).map_err(|_| "cannot open file").unwrap();
        assert_eq!(contents, correct);
    }

    #[test]
    fn csc_write_matrix_market_works_vismatrix() {
        //  2  3  .  .  .
        //  3  .  4  .  6
        //  . -1 -3  2  .
        //  .  .  1  .  .
        //  .  4  2  .  1
        let (_, csc, _, _) = Samples::umfpack_unsymmetric_5x5();
        let full_path = "/tmp/russell_sparse/test_write_matrix_market_csc.smat";
        csc.write_matrix_market(full_path, true).unwrap();
        let contents = fs::read_to_string(full_path).map_err(|_| "cannot open file").unwrap();
        assert_eq!(
            contents,
            "5 5 12\n\
             0 0 2.0\n\
             1 0 3.0\n\
             0 1 3.0\n\
             2 1 -1.0\n\
             4 1 4.0\n\
             1 2 4.0\n\
             2 2 -3.0\n\
             3 2 1.0\n\
             4 2 2.0\n\
             2 3 2.0\n\
             1 4 6.0\n\
             4 4 1.0\n"
        );
    }

    #[test]
    fn csc_write_matrix_market_sym_works_vismatrix() {
        let correct = "3 3 7\n\
                       0 0 2.0\n\
                       1 0 -1.0\n\
                       0 1 -1.0\n\
                       1 1 2.0\n\
                       2 1 -1.0\n\
                       1 2 -1.0\n\
                       2 2 2.0\n";
        let correct_upper = "3 3 7\n\
                             0 0 2.0\n\
                             0 1 -1.0\n\
                             1 0 -1.0\n\
                             1 1 2.0\n\
                             1 2 -1.0\n\
                             2 1 -1.0\n\
                             2 2 2.0\n";
        //  2  -1              2     sym
        // -1   2  -1    =>   -1   2
        //     -1   2             -1   2
        let (_, csc, _, _) = Samples::positive_definite_3x3_lower();
        let full_path = "/tmp/russell_sparse/test_write_matrix_market_csc_sym_lower.smat";
        csc.write_matrix_market(full_path, true).unwrap();
        let contents = fs::read_to_string(full_path).map_err(|_| "cannot open file").unwrap();
        assert_eq!(contents, correct);
        //  2  -1              2  -1
        // -1   2  -1    =>        2  -1
        //     -1   2          sym     2
        let (_, csc, _, _) = Samples::positive_definite_3x3_upper();
        let full_path = "/tmp/russell_sparse/test_write_matrix_market_csc_sym_upper.smat";
        csc.write_matrix_market(full_path, true).unwrap();
        let contents = fs::read_to_string(full_path).map_err(|_| "cannot open file").unwrap();
        assert_eq!(contents, correct_upper);
        //  2  -1
        // -1   2  -1
        //     -1   2
        let (_, csc, _, _) = Samples::positive_definite_3x3_full();
        let full_path = "/tmp/russell_sparse/test_write_matrix_market_csc_sym_full.smat";
        csc.write_matrix_market(full_path, true).unwrap();
        let contents = fs::read_to_string(full_path).map_err(|_| "cannot open file").unwrap();
        assert_eq!(contents, correct);
    }

    #[test]
    fn complex_csc_write_matrix_market_works() {
        // 4+4i    .     2+2i
        //  .      1     3+3i
        //  .     5+5i   1+1i
        //  1      .      .
        let (_, csc, _, _) = Samples::complex_rectangular_4x3();
        let full_path = "/tmp/russell_sparse/test_write_matrix_market_complex_csc.mtx";
        csc.write_matrix_market(full_path, false).unwrap();
        let contents = fs::read_to_string(full_path).map_err(|_| "cannot open file").unwrap();
        assert_eq!(
            contents,
            "%%MatrixMarket matrix coordinate complex general\n\
             4 3 7\n\
             1 1 4.0 4.0\n\
             4 1 1.0 0.0\n\
             2 2 1.0 0.0\n\
             3 2 5.0 5.0\n\
             1 3 2.0 2.0\n\
             2 3 3.0 3.0\n\
             3 3 1.0 1.0\n"
        );
    }

    #[test]
    fn complex_csc_write_matrix_market_sym_works() {
        let correct = "%%MatrixMarket matrix coordinate complex symmetric\n\
                       3 3 5\n\
                       1 1 2.0 1.0\n\
                       2 1 -1.0 -1.0\n\
                       2 2 2.0 2.0\n\
                       3 2 -1.0 1.0\n\
                       3 3 2.0 -1.0\n";
        //  2+1i  -1-1i                  2+1i          sym
        // -1-1i   2+2i  -1+1i     =>   -1-1i   2+2i
        //        -1+1i   2-1i                 -1+1i   2-1i
        let (_, csc, _, _) = Samples::complex_symmetric_3x3_lower();
        let full_path = "/tmp/russell_sparse/test_write_matrix_market_complex_csc_sym_lower.mtx";
        csc.write_matrix_market(full_path, false).unwrap();
        let contents = fs::read_to_string(full_path).map_err(|_| "cannot open file").unwrap();
        assert_eq!(contents, correct);
        //  2+1i  -1-1i                  2+1i  -1-1i
        // -1-1i   2+2i  -1+1i     =>           2+2i  -1+1i
        //        -1+1i   2-1i           sym           2-1i
        let (_, csc, _, _) = Samples::complex_symmetric_3x3_upper();
        let full_path = "/tmp/russell_sparse/test_write_matrix_market_complex_csc_sym_upper.mtx";
        csc.write_matrix_market(full_path, false).unwrap();
        let contents = fs::read_to_string(full_path).map_err(|_| "cannot open file").unwrap();
        assert_eq!(contents, correct);
        //  2+1i  -1-1i
        // -1-1i   2+2i  -1+1i
        //        -1+1i   2-1i
        let (_, csc, _, _) = Samples::complex_symmetric_3x3_full();
        let full_path = "/tmp/russell_sparse/test_write_matrix_market_complex_csc_sym_full.mtx";
        csc.write_matrix_market(full_path, false).unwrap();
        let contents = fs::read_to_string(full_path).map_err(|_| "cannot open file").unwrap();
        assert_eq!(contents, correct);
    }

    #[test]
    fn complex_csc_write_matrix_market_works_vismatrix() {
        // 4+4i    .     2+2i
        //  .      1     3+3i
        //  .     5+5i   1+1i
        //  1      .      .
        let (_, csc, _, _) = Samples::complex_rectangular_4x3();
        let full_path = "/tmp/russell_sparse/test_write_matrix_market_complex_csc.smat";
        csc.write_matrix_market(full_path, true).unwrap();
        let correct = &[
            [4.0, 3.0, 7.0],
            [0.0, 0.0, 5.656854249492381],
            [3.0, 0.0, 1.0],
            [1.0, 1.0, 1.0],
            [2.0, 1.0, 7.0710678118654755],
            [0.0, 2.0, 2.8284271247461903],
            [1.0, 2.0, 4.242640687119285],
            [2.0, 2.0, 1.4142135623730951],
        ];
        let res = Matrix::from_text_file(full_path).unwrap();
        mat_approx_eq(&res, correct, 1e-15);
    }

    #[test]
    fn complex_csc_write_matrix_market_sym_works_vismatrix() {
        let correct = &[
            [3.0, 3.0, 7.0],
            [0.0, 0.0, 2.23606797749979],
            [1.0, 0.0, 1.4142135623730951],
            [0.0, 1.0, 1.4142135623730951],
            [1.0, 1.0, 2.8284271247461903],
            [2.0, 1.0, 1.4142135623730951],
            [1.0, 2.0, 1.4142135623730951],
            [2.0, 2.0, 2.23606797749979],
        ];
        let correct_upper = &[
            [3.0, 3.0, 7.0],
            [0.0, 0.0, 2.23606797749979],
            [0.0, 1.0, 1.4142135623730951],
            [1.0, 0.0, 1.4142135623730951],
            [1.0, 1.0, 2.8284271247461903],
            [1.0, 2.0, 1.4142135623730951],
            [2.0, 1.0, 1.4142135623730951],
            [2.0, 2.0, 2.23606797749979],
        ];
        //  2+1i  -1-1i                  2+1i          sym
        // -1-1i   2+2i  -1+1i     =>   -1-1i   2+2i
        //        -1+1i   2-1i                 -1+1i   2-1i
        let (_, csc, _, _) = Samples::complex_symmetric_3x3_lower();
        let full_path = "/tmp/russell_sparse/test_write_matrix_market_complex_csc_sym_lower.smat";
        csc.write_matrix_market(full_path, true).unwrap();
        let res = Matrix::from_text_file(full_path).unwrap();
        mat_approx_eq(&res, correct, 1e-15);
        //  2+1i  -1-1i                  2+1i  -1-1i
        // -1-1i   2+2i  -1+1i     =>           2+2i  -1+1i
        //        -1+1i   2-1i           sym           2-1i
        let (_, csc, _, _) = Samples::complex_symmetric_3x3_upper();
        let full_path = "/tmp/russell_sparse/test_write_matrix_market_complex_csc_sym_upper.smat";
        csc.write_matrix_market(full_path, true).unwrap();
        let res = Matrix::from_text_file(full_path).unwrap();
        mat_approx_eq(&res, correct_upper, 1e-15);
        //  2+1i  -1-1i
        // -1-1i   2+2i  -1+1i
        //        -1+1i   2-1i
        let (_, csc, _, _) = Samples::complex_symmetric_3x3_full();
        let full_path = "/tmp/russell_sparse/test_write_matrix_market_complex_csc_sym_full.smat";
        csc.write_matrix_market(full_path, true).unwrap();
        let res = Matrix::from_text_file(full_path).unwrap();
        mat_approx_eq(&res, correct, 1e-15);
    }
}