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
|
////////////////////////////////////////////////////////////////////////
//
// Copyright (C) 2009-2021 The Octave Project Developers
//
// See the file COPYRIGHT.md in the top-level directory of this
// distribution or <https://octave.org/copyright/>.
//
// This file is part of Octave.
//
// Octave is free software: you can redistribute it and/or modify it
// under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// Octave is distributed in the hope that it will be useful, but
// WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with Octave; see the file COPYING. If not, see
// <https://www.gnu.org/licenses/>.
//
////////////////////////////////////////////////////////////////////////
#if defined (HAVE_CONFIG_H)
# include "config.h"
#endif
#include "errwarn.h"
#include "ovl.h"
#include "ov.h"
#include "ov-typeinfo.h"
#include "ops.h"
#include "ov-perm.h"
#include "ov-re-sparse.h"
// permutation matrix by sparse matrix ops
DEFBINOP (mul_pm_sm, perm_matrix, sparse_matrix)
{
const octave_perm_matrix& v1 = dynamic_cast<const octave_perm_matrix&> (a1);
const octave_sparse_matrix& v2 = dynamic_cast<const octave_sparse_matrix&> (a2);
if (v2.rows () == 1 && v2.columns () == 1)
{
double d = v2.scalar_value ();
return octave_value (v1.sparse_matrix_value () * d);
}
else if (v1.rows () == 1 && v1.columns () == 1)
return octave_value (v2.sparse_matrix_value ());
else
return v1.perm_matrix_value () * v2.sparse_matrix_value ();
}
DEFBINOP (ldiv_pm_sm, perm_matrix, sparse_matrix)
{
const octave_perm_matrix& v1 = dynamic_cast<const octave_perm_matrix&> (a1);
const octave_sparse_matrix& v2 = dynamic_cast<const octave_sparse_matrix&> (a2);
return v1.perm_matrix_value ().inverse () * v2.sparse_matrix_value ();
}
// sparse matrix by diagonal matrix ops
DEFBINOP (mul_sm_pm, sparse_matrix, perm_matrix)
{
const octave_sparse_matrix& v1 = dynamic_cast<const octave_sparse_matrix&> (a1);
const octave_perm_matrix& v2 = dynamic_cast<const octave_perm_matrix&> (a2);
if (v1.rows () == 1 && v1.columns () == 1)
{
double d = v1.scalar_value ();
return octave_value (d * v2.sparse_matrix_value ());
}
else if (v2.rows () == 1 && v2.columns () == 1)
return octave_value (v1.sparse_matrix_value ());
else
return v1.sparse_matrix_value () * v2.perm_matrix_value ();
}
DEFBINOP (div_sm_pm, sparse_matrix, perm_matrix)
{
const octave_sparse_matrix& v1 = dynamic_cast<const octave_sparse_matrix&> (a1);
const octave_perm_matrix& v2 = dynamic_cast<const octave_perm_matrix&> (a2);
return v1.sparse_matrix_value () * v2.perm_matrix_value ().inverse ();
}
void
install_pm_sm_ops (octave::type_info& ti)
{
INSTALL_BINOP_TI (ti, op_mul, octave_perm_matrix, octave_sparse_matrix,
mul_pm_sm);
INSTALL_BINOP_TI (ti, op_ldiv, octave_perm_matrix, octave_sparse_matrix,
ldiv_pm_sm);
INSTALL_BINOP_TI (ti, op_mul, octave_sparse_matrix, octave_perm_matrix,
mul_sm_pm);
INSTALL_BINOP_TI (ti, op_div, octave_sparse_matrix, octave_perm_matrix,
div_sm_pm);
}
|
