faer 0.24.0

linear algebra library
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

use super::*;
impl<T: ComplexField, ViewT: Conjugate<Canonical = T>> LinOp<T>
	for DiagRef<'_, ViewT>
{
	#[inline]
	fn apply_scratch(&self, rhs_ncols: usize, par: Par) -> StackReq {
		let _ = rhs_ncols;
		let _ = par;
		StackReq::EMPTY
	}

	#[inline]
	fn nrows(&self) -> usize {
		self.column_vector().nrows()
	}

	#[inline]
	fn ncols(&self) -> usize {
		self.column_vector().nrows()
	}

	fn apply(
		&self,
		out: MatMut<'_, T>,
		rhs: MatRef<'_, T>,
		par: Par,
		stack: &mut MemStack,
	) {
		let k = rhs.ncols();
		_ = par;
		_ = stack;
		let mut out = out;
		for j in 0..k {
			z!(out.rb_mut().col_mut(j), rhs.col(j), self.column_vector())
				.for_each(|uz!(out, rhs, d): Zip![&mut _, ..]| {
					*out = rhs * Conj::apply(d);
				});
		}
	}

	fn conj_apply(
		&self,
		out: MatMut<'_, T>,
		rhs: MatRef<'_, T>,
		par: Par,
		stack: &mut MemStack,
	) {
		self.column_vector()
			.conjugate()
			.as_diagonal()
			.apply(out, rhs, par, stack)
	}
}
impl<T: ComplexField, ViewT: Conjugate<Canonical = T>> BiLinOp<T>
	for DiagRef<'_, ViewT>
{
	#[inline]
	fn transpose_apply_scratch(&self, rhs_ncols: usize, par: Par) -> StackReq {
		self.apply_scratch(rhs_ncols, par)
	}

	fn transpose_apply(
		&self,
		out: MatMut<'_, T>,
		rhs: MatRef<'_, T>,
		par: Par,
		stack: &mut MemStack,
	) {
		self.apply(out, rhs, par, stack);
	}

	fn adjoint_apply(
		&self,
		out: MatMut<'_, T>,
		rhs: MatRef<'_, T>,
		par: Par,
		stack: &mut MemStack,
	) {
		self.conj_apply(out, rhs, par, stack);
	}
}
impl<T: ComplexField, ViewT: Conjugate<Canonical = T>> Precond<T>
	for DiagRef<'_, ViewT>
{
	fn apply_in_place_scratch(&self, rhs_ncols: usize, par: Par) -> StackReq {
		let _ = rhs_ncols;
		let _ = par;
		StackReq::EMPTY
	}

	fn apply_in_place(
		&self,
		rhs: MatMut<'_, T>,
		par: Par,
		stack: &mut MemStack,
	) {
		_ = par;
		_ = stack;
		let mut rhs = rhs;
		let k = rhs.ncols();
		for j in 0..k {
			z!(rhs.rb_mut().col_mut(j), self.column_vector()).for_each(
				|uz!(out, d): Zip![&mut _, ..]| *out *= Conj::apply(d),
			);
		}
	}

	fn conj_apply_in_place(
		&self,
		rhs: MatMut<'_, T>,
		par: Par,
		stack: &mut MemStack,
	) {
		self.column_vector()
			.conjugate()
			.as_diagonal()
			.apply_in_place(rhs, par, stack)
	}
}
impl<T: ComplexField, ViewT: Conjugate<Canonical = T>> BiPrecond<T>
	for DiagRef<'_, ViewT>
{
	fn transpose_apply_in_place_scratch(
		&self,
		rhs_ncols: usize,
		par: Par,
	) -> StackReq {
		self.apply_in_place_scratch(rhs_ncols, par)
	}

	fn transpose_apply_in_place(
		&self,
		rhs: MatMut<'_, T>,
		par: Par,
		stack: &mut MemStack,
	) {
		self.apply_in_place(rhs, par, stack)
	}

	fn adjoint_apply_in_place(
		&self,
		rhs: MatMut<'_, T>,
		par: Par,
		stack: &mut MemStack,
	) {
		self.conj_apply_in_place(rhs, par, stack)
	}
}