mirror of
https://gitlab.com/libeigen/eigen.git
synced 2025-05-07 13:33:24 +08:00
182 lines
7.3 KiB
C++
182 lines
7.3 KiB
C++
// This file is part of Eigen, a lightweight C++ template library
|
|
// for linear algebra.
|
|
//
|
|
// Copyright (C) 2009 Gael Guennebaud <g.gael@free.fr>
|
|
//
|
|
// Eigen is free software; you can redistribute it and/or
|
|
// modify it under the terms of the GNU Lesser General Public
|
|
// License as published by the Free Software Foundation; either
|
|
// version 3 of the License, or (at your option) any later version.
|
|
//
|
|
// Alternatively, 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 2 of
|
|
// the License, or (at your option) any later version.
|
|
//
|
|
// Eigen 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 Lesser General Public License or the
|
|
// GNU General Public License for more details.
|
|
//
|
|
// You should have received a copy of the GNU Lesser General Public
|
|
// License and a copy of the GNU General Public License along with
|
|
// Eigen. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
#ifndef EIGEN_SPARSE_DIAGONAL_PRODUCT_H
|
|
#define EIGEN_SPARSE_DIAGONAL_PRODUCT_H
|
|
|
|
// The product of a diagonal matrix with a sparse matrix can be easily
|
|
// implemented using expression template.
|
|
// We have two consider very different cases:
|
|
// 1 - diag * row-major sparse
|
|
// => each inner vector <=> scalar * sparse vector product
|
|
// => so we can reuse CwiseUnaryOp::InnerIterator
|
|
// 2 - diag * col-major sparse
|
|
// => each inner vector <=> densevector * sparse vector cwise product
|
|
// => again, we can reuse specialization of CwiseBinaryOp::InnerIterator
|
|
// for that particular case
|
|
// The two other cases are symmetric.
|
|
|
|
template<typename Lhs, typename Rhs>
|
|
struct ei_traits<SparseDiagonalProduct<Lhs, Rhs> >
|
|
{
|
|
typedef typename ei_cleantype<Lhs>::type _Lhs;
|
|
typedef typename ei_cleantype<Rhs>::type _Rhs;
|
|
typedef typename _Lhs::Scalar Scalar;
|
|
enum {
|
|
RowsAtCompileTime = _Lhs::RowsAtCompileTime,
|
|
ColsAtCompileTime = _Rhs::ColsAtCompileTime,
|
|
|
|
MaxRowsAtCompileTime = _Lhs::MaxRowsAtCompileTime,
|
|
MaxColsAtCompileTime = _Rhs::MaxColsAtCompileTime,
|
|
|
|
SparseFlags = ei_is_diagonal<_Lhs>::ret ? int(_Rhs::Flags) : int(_Lhs::Flags),
|
|
Flags = SparseBit | (SparseFlags&RowMajorBit),
|
|
CoeffReadCost = Dynamic
|
|
};
|
|
};
|
|
|
|
enum {SDP_IsDiagonal, SDP_IsSparseRowMajor, SDP_IsSparseColMajor};
|
|
template<typename Lhs, typename Rhs, typename SparseDiagonalProductType, int RhsMode, int LhsMode>
|
|
class ei_sparse_diagonal_product_inner_iterator_selector;
|
|
|
|
template<typename Lhs, typename Rhs>
|
|
class SparseDiagonalProduct
|
|
: public SparseMatrixBase<SparseDiagonalProduct<Lhs,Rhs> >,
|
|
ei_no_assignment_operator
|
|
{
|
|
typedef typename Lhs::Nested LhsNested;
|
|
typedef typename Rhs::Nested RhsNested;
|
|
|
|
typedef typename ei_cleantype<LhsNested>::type _LhsNested;
|
|
typedef typename ei_cleantype<RhsNested>::type _RhsNested;
|
|
|
|
enum {
|
|
LhsMode = ei_is_diagonal<_LhsNested>::ret ? SDP_IsDiagonal
|
|
: (_LhsNested::Flags&RowMajorBit) ? SDP_IsSparseRowMajor : SDP_IsSparseColMajor,
|
|
RhsMode = ei_is_diagonal<_RhsNested>::ret ? SDP_IsDiagonal
|
|
: (_RhsNested::Flags&RowMajorBit) ? SDP_IsSparseRowMajor : SDP_IsSparseColMajor
|
|
};
|
|
|
|
public:
|
|
|
|
EIGEN_SPARSE_GENERIC_PUBLIC_INTERFACE(SparseDiagonalProduct)
|
|
|
|
typedef ei_sparse_diagonal_product_inner_iterator_selector
|
|
<_LhsNested,_RhsNested,SparseDiagonalProduct,LhsMode,RhsMode> InnerIterator;
|
|
|
|
template<typename _Lhs, typename _Rhs>
|
|
EIGEN_STRONG_INLINE SparseDiagonalProduct(const _Lhs& lhs, const _Rhs& rhs)
|
|
: m_lhs(lhs), m_rhs(rhs)
|
|
{
|
|
ei_assert(lhs.cols() == rhs.rows() && "invalid sparse matrix * diagonal matrix product");
|
|
}
|
|
|
|
EIGEN_STRONG_INLINE int rows() const { return m_lhs.rows(); }
|
|
EIGEN_STRONG_INLINE int cols() const { return m_rhs.cols(); }
|
|
|
|
EIGEN_STRONG_INLINE const _LhsNested& lhs() const { return m_lhs; }
|
|
EIGEN_STRONG_INLINE const _RhsNested& rhs() const { return m_rhs; }
|
|
|
|
protected:
|
|
LhsNested m_lhs;
|
|
RhsNested m_rhs;
|
|
};
|
|
|
|
|
|
template<typename Lhs, typename Rhs, typename SparseDiagonalProductType>
|
|
class ei_sparse_diagonal_product_inner_iterator_selector
|
|
<Lhs,Rhs,SparseDiagonalProductType,SDP_IsDiagonal,SDP_IsSparseRowMajor>
|
|
: public SparseCwiseUnaryOp<ei_scalar_multiple_op<typename Lhs::Scalar>,Rhs>::InnerIterator
|
|
{
|
|
typedef typename SparseCwiseUnaryOp<ei_scalar_multiple_op<typename Lhs::Scalar>,Rhs>::InnerIterator Base;
|
|
public:
|
|
inline ei_sparse_diagonal_product_inner_iterator_selector(
|
|
const SparseDiagonalProductType& expr, int outer)
|
|
: Base(expr.rhs()*(expr.lhs().diagonal().coeff(outer)), outer)
|
|
{}
|
|
};
|
|
|
|
template<typename Lhs, typename Rhs, typename SparseDiagonalProductType>
|
|
class ei_sparse_diagonal_product_inner_iterator_selector
|
|
<Lhs,Rhs,SparseDiagonalProductType,SDP_IsDiagonal,SDP_IsSparseColMajor>
|
|
: public SparseCwiseBinaryOp<
|
|
ei_scalar_product_op<typename Lhs::Scalar>,
|
|
SparseInnerVectorSet<Rhs,1>,
|
|
typename Lhs::DiagonalVectorType>::InnerIterator
|
|
{
|
|
typedef typename SparseCwiseBinaryOp<
|
|
ei_scalar_product_op<typename Lhs::Scalar>,
|
|
SparseInnerVectorSet<Rhs,1>,
|
|
typename Lhs::DiagonalVectorType>::InnerIterator Base;
|
|
public:
|
|
inline ei_sparse_diagonal_product_inner_iterator_selector(
|
|
const SparseDiagonalProductType& expr, int outer)
|
|
: Base(expr.rhs().innerVector(outer) .cwise()* expr.lhs().diagonal(), 0)
|
|
{}
|
|
};
|
|
|
|
template<typename Lhs, typename Rhs, typename SparseDiagonalProductType>
|
|
class ei_sparse_diagonal_product_inner_iterator_selector
|
|
<Lhs,Rhs,SparseDiagonalProductType,SDP_IsSparseColMajor,SDP_IsDiagonal>
|
|
: public SparseCwiseUnaryOp<ei_scalar_multiple_op<typename Rhs::Scalar>,Lhs>::InnerIterator
|
|
{
|
|
typedef typename SparseCwiseUnaryOp<ei_scalar_multiple_op<typename Rhs::Scalar>,Lhs>::InnerIterator Base;
|
|
public:
|
|
inline ei_sparse_diagonal_product_inner_iterator_selector(
|
|
const SparseDiagonalProductType& expr, int outer)
|
|
: Base(expr.lhs()*expr.rhs().diagonal().coeff(outer), outer)
|
|
{}
|
|
};
|
|
|
|
template<typename Lhs, typename Rhs, typename SparseDiagonalProductType>
|
|
class ei_sparse_diagonal_product_inner_iterator_selector
|
|
<Lhs,Rhs,SparseDiagonalProductType,SDP_IsSparseRowMajor,SDP_IsDiagonal>
|
|
: public SparseCwiseBinaryOp<
|
|
ei_scalar_product_op<typename Rhs::Scalar>,
|
|
SparseInnerVectorSet<Lhs,1>,
|
|
NestByValue<Transpose<typename Rhs::DiagonalVectorType> > >::InnerIterator
|
|
{
|
|
typedef typename SparseCwiseBinaryOp<
|
|
ei_scalar_product_op<typename Rhs::Scalar>,
|
|
SparseInnerVectorSet<Lhs,1>,
|
|
NestByValue<Transpose<typename Rhs::DiagonalVectorType> > >::InnerIterator Base;
|
|
public:
|
|
inline ei_sparse_diagonal_product_inner_iterator_selector(
|
|
const SparseDiagonalProductType& expr, int outer)
|
|
: Base(expr.lhs().innerVector(outer) .cwise()* expr.rhs().diagonal().transpose().nestByValue(), 0)
|
|
{}
|
|
};
|
|
|
|
// SparseMatrixBase functions
|
|
|
|
template<typename Derived>
|
|
template<typename OtherDerived>
|
|
const SparseDiagonalProduct<Derived,OtherDerived>
|
|
SparseMatrixBase<Derived>::operator*(const DiagonalBase<OtherDerived> &other) const
|
|
{
|
|
return SparseDiagonalProduct<Derived,OtherDerived>(this->derived(), other.derived());
|
|
}
|
|
|
|
#endif // EIGEN_SPARSE_DIAGONAL_PRODUCT_H
|