25 #ifndef EIGEN_SELFADJOINT_MATRIX_VECTOR_H
26 #define EIGEN_SELFADJOINT_MATRIX_VECTOR_H
38 template<
typename Scalar,
typename Index,
int StorageOrder,
int UpLo,
bool ConjugateLhs,
bool ConjugateRhs,
int Version=Specialized>
39 struct selfadjoint_matrix_vector_product;
41 template<
typename Scalar,
typename Index,
int StorageOrder,
int UpLo,
bool ConjugateLhs,
bool ConjugateRhs,
int Version>
42 struct selfadjoint_matrix_vector_product
47 const Scalar* lhs, Index lhsStride,
48 const Scalar* _rhs, Index rhsIncr,
52 typedef typename packet_traits<Scalar>::type Packet;
54 const Index PacketSize =
sizeof(Packet)/
sizeof(Scalar);
57 IsRowMajor = StorageOrder==
RowMajor ? 1 : 0,
58 IsLower = UpLo ==
Lower ? 1 : 0,
59 FirstTriangular = IsRowMajor == IsLower
69 Scalar cjAlpha = ConjugateRhs ?
conj(alpha) : alpha;
77 const Scalar* it = _rhs;
78 for (Index i=0; i<size; ++i, it+=rhsIncr)
82 Index bound = (std::max)(Index(0),size-8) & 0xfffffffe;
86 for (Index j=FirstTriangular ? bound : 0;
87 j<(FirstTriangular ? size : bound);j+=2)
92 Scalar t0 = cjAlpha * rhs[j];
93 Packet ptmp0 = pset1<Packet>(t0);
94 Scalar t1 = cjAlpha * rhs[j+1];
95 Packet ptmp1 = pset1<Packet>(t1);
98 Packet ptmp2 = pset1<Packet>(t2);
100 Packet ptmp3 = pset1<Packet>(t3);
102 size_t starti = FirstTriangular ? 0 : j+2;
103 size_t endi = FirstTriangular ? j : size;
104 size_t alignedStart = (starti) + internal::first_aligned(&res[starti], endi-starti);
105 size_t alignedEnd = alignedStart + ((endi-alignedStart)/(PacketSize))*(PacketSize);
112 res[j] += cj0.pmul(A1[j], t1);
113 t3 += cj1.pmul(A1[j], rhs[j]);
117 res[j+1] += cj0.pmul(A0[j+1],t0);
118 t2 += cj1.pmul(A0[j+1], rhs[j+1]);
121 for (
size_t i=starti; i<alignedStart; ++i)
123 res[i] += t0 * A0[i] + t1 * A1[i];
124 t2 +=
conj(A0[i]) * rhs[i];
125 t3 +=
conj(A1[i]) * rhs[i];
133 for (
size_t i=alignedStart; i<alignedEnd; i+=PacketSize)
135 Packet A0i = ploadu<Packet>(a0It); a0It += PacketSize;
136 Packet A1i = ploadu<Packet>(a1It); a1It += PacketSize;
137 Packet Bi = ploadu<Packet>(rhsIt); rhsIt += PacketSize;
138 Packet Xi = pload <Packet>(resIt);
140 Xi = pcj0.pmadd(A0i,ptmp0, pcj0.pmadd(A1i,ptmp1,Xi));
141 ptmp2 = pcj1.pmadd(A0i, Bi, ptmp2);
142 ptmp3 = pcj1.pmadd(A1i, Bi, ptmp3);
143 pstore(resIt,Xi); resIt += PacketSize;
145 for (
size_t i=alignedEnd; i<endi; i++)
147 res[i] += cj0.pmul(A0[i], t0) + cj0.pmul(A1[i],t1);
148 t2 += cj1.pmul(A0[i], rhs[i]);
149 t3 += cj1.pmul(A1[i], rhs[i]);
152 res[j] += alpha * (t2 +
predux(ptmp2));
153 res[j+1] += alpha * (t3 +
predux(ptmp3));
155 for (Index j=FirstTriangular ? 0 : bound;j<(FirstTriangular ? bound : size);j++)
159 Scalar t1 = cjAlpha * rhs[j];
163 for (Index i=FirstTriangular ? 0 : j+1; i<(FirstTriangular ? j : size); i++)
165 res[i] += cj0.pmul(A0[i], t1);
166 t2 += cj1.pmul(A0[i], rhs[i]);
168 res[j] += alpha * t2;
180 template<
typename Lhs,
int LhsMode,
typename Rhs>
181 struct traits<SelfadjointProductMatrix<Lhs,LhsMode,false,Rhs,0,true> >
182 :
traits<ProductBase<SelfadjointProductMatrix<Lhs,LhsMode,false,Rhs,0,true>, Lhs, Rhs> >
186 template<
typename Lhs,
int LhsMode,
typename Rhs>
187 struct SelfadjointProductMatrix<Lhs,LhsMode,false,Rhs,0,true>
188 :
public ProductBase<SelfadjointProductMatrix<Lhs,LhsMode,false,Rhs,0,true>, Lhs, Rhs >
198 template<
typename Dest>
void scaleAndAddTo(Dest& dest,
Scalar alpha)
const
200 typedef typename Dest::Scalar ResScalar;
201 typedef typename Base::RhsScalar
RhsScalar;
204 eigen_assert(dest.rows()==m_lhs.rows() && dest.cols()==m_rhs.cols());
206 typename internal::add_const_on_value_type<ActualLhsType>::type lhs = LhsBlasTraits::extract(m_lhs);
207 typename internal::add_const_on_value_type<ActualRhsType>::type rhs = RhsBlasTraits::extract(m_rhs);
209 Scalar actualAlpha = alpha * LhsBlasTraits::extractScalarFactor(m_lhs)
210 * RhsBlasTraits::extractScalarFactor(m_rhs);
213 EvalToDest = (Dest::InnerStrideAtCompileTime==1),
214 UseRhs = (_ActualRhsType::InnerStrideAtCompileTime==1)
217 internal::gemv_static_vector_if<ResScalar,Dest::SizeAtCompileTime,Dest::MaxSizeAtCompileTime,!EvalToDest> static_dest;
218 internal::gemv_static_vector_if<RhsScalar,_ActualRhsType::SizeAtCompileTime,_ActualRhsType::MaxSizeAtCompileTime,!UseRhs> static_rhs;
221 EvalToDest ? dest.data() : static_dest.data());
224 UseRhs ?
const_cast<RhsScalar*
>(rhs.data()) : static_rhs.data());
228 #ifdef EIGEN_DENSE_STORAGE_CTOR_PLUGIN
229 int size = dest.size();
230 EIGEN_DENSE_STORAGE_CTOR_PLUGIN
232 MappedDest(actualDestPtr, dest.size()) = dest;
237 #ifdef EIGEN_DENSE_STORAGE_CTOR_PLUGIN
238 int size = rhs.size();
239 EIGEN_DENSE_STORAGE_CTOR_PLUGIN
245 internal::selfadjoint_matrix_vector_product<Scalar, Index, (internal::traits<_ActualLhsType>::Flags&
RowMajorBit) ?
RowMajor :
ColMajor,
int(LhsUpLo),
bool(LhsBlasTraits::NeedToConjugate),
bool(RhsBlasTraits::NeedToConjugate)>::run
248 &lhs.coeffRef(0,0), lhs.outerStride(),
255 dest = MappedDest(actualDestPtr, dest.size());
260 template<
typename Lhs,
typename Rhs,
int RhsMode>
261 struct traits<SelfadjointProductMatrix<Lhs,0,true,Rhs,RhsMode,false> >
262 :
traits<ProductBase<SelfadjointProductMatrix<Lhs,0,true,Rhs,RhsMode,false>, Lhs, Rhs> >
266 template<
typename Lhs,
typename Rhs,
int RhsMode>
267 struct SelfadjointProductMatrix<Lhs,0,true,Rhs,RhsMode,false>
268 :
public ProductBase<SelfadjointProductMatrix<Lhs,0,true,Rhs,RhsMode,false>, Lhs, Rhs >
278 template<
typename Dest>
void scaleAndAddTo(Dest& dest,
Scalar alpha)
const
282 SelfadjointProductMatrix<Transpose<const Rhs>,
int(RhsUpLo)==
Upper ?
Lower :
Upper,
false,
283 Transpose<const Lhs>, 0,
true>(m_rhs.transpose(), m_lhs.transpose()).scaleAndAddTo(destT, alpha);
289 #endif // EIGEN_SELFADJOINT_MATRIX_VECTOR_H