casadi_kron_contract_inner_dense_sparse.hpp
1 //
2 // MIT No Attribution
3 //
4 // Copyright (C) 2010-2023 Joel Andersson, Joris Gillis, Moritz Diehl, KU Leuven.
5 //
6 // Permission is hereby granted, free of charge, to any person obtaining a copy of this
7 // software and associated documentation files (the "Software"), to deal in the Software
8 // without restriction, including without limitation the rights to use, copy, modify,
9 // merge, publish, distribute, sublicense, and/or sell copies of the Software, and to
10 // permit persons to whom the Software is furnished to do so.
11 //
12 // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,
13 // INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
14 // PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
15 // HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
16 // OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
17 // SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
18 //
19 
20 // SYMBOL "kron_contract_inner_dense_sparse"
21 // y[i,j] = sum over (r,s) in b's nonzeros of m[i*mB+r, j*nB+s] * b[r,s]
22 // where m is dense (mA*mB, nA*nB), b is sparse (sp_b, mB x nB), y is dense (mA, nA).
23 template<typename T1>
24 void casadi_kron_contract_inner_dense_sparse(const T1* m, casadi_int mA, casadi_int nA,
25  const T1* b, const casadi_int* sp_b,
26  T1* y) {
27  casadi_int mB = sp_b[0], nB = sp_b[1];
28  const casadi_int* b_colind = sp_b+2;
29  const casadi_int* b_row = sp_b+2+nB+1;
30  casadi_int s, b_el, rr, j, i, k;
31  T1 b_val;
32  const T1* m_col;
33  for (k=0; k<mA*nA; ++k) y[k] = 0;
34  for (s=0; s<nB; ++s) {
35  for (b_el=b_colind[s]; b_el<b_colind[s+1]; ++b_el) {
36  rr = b_row[b_el];
37  b_val = b[b_el];
38  for (j=0; j<nA; ++j) {
39  m_col = m + (j*nB+s)*(mA*mB);
40  for (i=0; i<mA; ++i) y[j*mA + i] += b_val * m_col[i*mB + rr];
41  }
42  }
43  }
44 }