Skip to main content

sparse_lu_test/
sparse_lu_test.rs

1use section_properties::fea::SparseMatrix;
2use section_properties::fea::solvers::SparseLu;
3
4fn main() {
5    // Test 1: Simple 2x2 matrix with zero diagonal
6    println!("Test 1: 2x2 matrix [[0, 1], [1, 0]]");
7    let mut a = SparseMatrix::new(2);
8    a.add(0, 1, 1.0);
9    a.add(1, 0, 1.0);
10    a.compress();
11    let lu = SparseLu::factor(&a).unwrap();
12    let b = vec![1.0, 2.0];
13    let x = lu.solve(&b);
14    println!("  Solution: {:?}", x);
15    println!("  Expected: [2, 1]");
16
17    // Verify PA = LU
18    let max_diff = lu.verify_pa_eq_lu(&a);
19    println!("  max|PA - LU| = {:.2e}", max_diff);
20    assert!(max_diff < 1e-12, "PA != LU: max_diff = {}", max_diff);
21
22    // Test 2: Diagonally dominant
23    println!("\nTest 2: Diagonally dominant 3x3");
24    let mut a2 = SparseMatrix::new(3);
25    a2.add(0, 0, 4.0);
26    a2.add(0, 1, 1.0);
27    a2.add(1, 0, 1.0);
28    a2.add(1, 1, 4.0);
29    a2.add(1, 2, 1.0);
30    a2.add(2, 1, 1.0);
31    a2.add(2, 2, 4.0);
32    a2.compress();
33    let lu2 = SparseLu::factor(&a2).unwrap();
34    let b2 = vec![1.0, 2.0, 3.0];
35    let x2 = lu2.solve(&b2);
36    println!("  Solution: {:?}", x2);
37
38    let max_diff2 = lu2.verify_pa_eq_lu(&a2);
39    println!("  max|PA - LU| = {:.2e}", max_diff2);
40    assert!(max_diff2 < 1e-12, "PA != LU: max_diff = {}", max_diff2);
41
42    // Test 3: Zero diagonal with pivoting needed
43    println!("\nTest 3: [[1, 2], [1e-14, 1]] - needs pivoting");
44    let mut a3 = SparseMatrix::new(2);
45    a3.add(0, 0, 1.0);
46    a3.add(0, 1, 2.0);
47    a3.add(1, 0, 1e-14);
48    a3.add(1, 1, 1.0);
49    a3.compress();
50    match SparseLu::factor(&a3) {
51        Ok(lu) => {
52            let b3 = vec![1.0, 2.0];
53            let x3 = lu.solve(&b3);
54            println!("  Solution: {:?}", x3);
55        }
56        Err(e) => {
57            println!("  Error: {}", e);
58        }
59    }
60
61    println!("\nAll tests passed!");
62}