Mercurial > hg > octave-lyh
view src/OPERATORS/op-pm-sm.cc @ 8968:91d53dc37f79
Add perm * sparse, perm \ sparse, sparse * perm, and sparse / perm operations.
Nothing terribly fancy in any of this. There probably is some
mechanism for using the permutation vectors and some assign or index
method in the sparse classes, but I've never understood all the
intricacies. I'm opting for a simple implementation at the cost of
possibly duplicating some functionality.
author | Jason Riedy <jason@acm.org> |
---|---|
date | Tue, 10 Mar 2009 21:54:44 -0400 |
parents | |
children | fb6b6fcafa62 |
line wrap: on
line source
/* Copyright (C) 2009 Jason Riedy 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 <http://www.gnu.org/licenses/>. */ #ifdef HAVE_CONFIG_H #include <config.h> #endif #include "gripes.h" #include "oct-obj.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) { CAST_BINOP_ARGS (const octave_perm_matrix&, const octave_sparse_matrix&); 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) { CAST_BINOP_ARGS (const octave_perm_matrix&, const octave_sparse_matrix&); return v1.perm_matrix_value ().inverse () * v2.sparse_matrix_value (); } // sparse matrix by diagonal matrix ops DEFBINOP (mul_sm_pm, sparse_matrix, perm_matrix) { CAST_BINOP_ARGS (const octave_sparse_matrix&, const octave_perm_matrix&); 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) { CAST_BINOP_ARGS (const octave_sparse_matrix&, const octave_perm_matrix&); return v1.sparse_matrix_value () * v2.perm_matrix_value ().inverse (); } void install_pm_sm_ops (void) { INSTALL_BINOP (op_mul, octave_perm_matrix, octave_sparse_matrix, mul_pm_sm); INSTALL_BINOP (op_ldiv, octave_perm_matrix, octave_sparse_matrix, ldiv_pm_sm); INSTALL_BINOP (op_mul, octave_sparse_matrix, octave_perm_matrix, mul_sm_pm); INSTALL_BINOP (op_div, octave_sparse_matrix, octave_perm_matrix, div_sm_pm); }