Lines Matching full:alpha
38 Scalar alpha = *reinterpret_cast<Scalar*>(palpha);
62 func[code](*m, *n, *k, a, *lda, b, *ldb, c, *ldc, alpha, blocking, 0);
116 Scalar alpha = *reinterpret_cast<Scalar*>(palpha);
143 if(alpha!=Scalar(1))
144 matrix(b,*m,*n,*ldb) *= alpha;
150 // b = alpha*op(a)*b for side = 'L'or'l'
151 // b = alpha*b*op(a) for side = 'R'or'r'
200 Scalar alpha = *reinterpret_cast<Scalar*>(palpha);
226 func[code](*m, *n, *m, a, *lda, tmp.data(), tmp.outerStride(), b, *ldb, alpha, blocking);
231 func[code](*m, *n, *n, tmp.data(), tmp.outerStride(), a, *lda, b, *ldb, alpha, blocking);
236 // c = alpha*a*b + beta*c for side = 'L'or'l'
237 // c = alpha*b*a + beta*c for side = 'R'or'r
240 // std::cerr << "in symm " << *side << " " << *uplo << " " << *m << "x" << *n << " lda:" << *lda << " ldb:" << *ldb << " ldc:" << *ldc << " alpha:" << *palpha << " beta:" << *pbeta << "\n";
244 Scalar alpha = *reinterpret_cast<Scalar*>(palpha);
284 matrix(c, *m, *n, *ldc) += alpha * matA * matrix(b, *m, *n, *ldb);
286 matrix(c, *m, *n, *ldc) += alpha * matrix(b, *m, *n, *ldb) * matA;
289 if(UPLO(*uplo)==UP) internal::product_selfadjoint_matrix<Scalar, DenseIndex, RowMajor,true,false, ColMajor,false,false, ColMajor>::run(*m, *n, a, *lda, b, *ldb, c, *ldc, alpha);
290 else if(UPLO(*uplo)==LO) internal::product_selfadjoint_matrix<Scalar, DenseIndex, ColMajor,true,false, ColMajor,false,false, ColMajor>::run(*m, *n, a, *lda, b, *ldb, c, *ldc, alpha);
293 if(UPLO(*uplo)==UP) internal::product_selfadjoint_matrix<Scalar, DenseIndex, ColMajor,false,false, RowMajor,true,false, ColMajor>::run(*m, *n, b, *ldb, a, *lda, c, *ldc, alpha);
294 else if(UPLO(*uplo)==LO) internal::product_selfadjoint_matrix<Scalar, DenseIndex, ColMajor,false,false, ColMajor,true,false, ColMajor>::run(*m, *n, b, *ldb, a, *lda, c, *ldc, alpha);
303 // c = alpha*a*a' + beta*c for op = 'N'or'n'
304 // c = alpha*a'*a + beta*c for op = 'T'or't','C'or'c'
330 Scalar alpha = *reinterpret_cast<Scalar*>(palpha);
358 matrix(c, *n, *n, *ldc).triangularView<Upper>() += alpha * matrix(a,*n,*k,*lda) * matrix(a,*n,*k,*lda).transpose();
360 matrix(c, *n, *n, *ldc).triangularView<Upper>() += alpha * matrix(a,*k,*n,*lda).transpose() * matrix(a,*k,*n,*lda);
365 matrix(c, *n, *n, *ldc).triangularView<Lower>() += alpha * matrix(a,*n,*k,*lda) * matrix(a,*n,*k,*lda).transpose();
367 matrix(c, *n, *n, *ldc).triangularView<Lower>() += alpha * matrix(a,*k,*n,*lda).transpose() * matrix(a,*k,*n,*lda);
371 func[code](*n, *k, a, *lda, a, *lda, c, *ldc, alpha);
377 // c = alpha*a*b' + alpha*b*a' + beta*c for op = 'N'or'n'
378 // c = alpha*a'*b + alpha*b'*a + beta*c for op = 'T'or't'
384 Scalar alpha = *reinterpret_cast<Scalar*>(palpha);
416 += alpha *matrix(a, *n, *k, *lda)*matrix(b, *n, *k, *ldb).transpose()
417 + alpha*matrix(b, *n, *k, *ldb)*matrix(a, *n, *k, *lda).transpose();
421 += alpha*matrix(a, *n, *k, *lda)*matrix(b, *n, *k, *ldb).transpose()
422 + alpha*matrix(b, *n, *k, *ldb)*matrix(a, *n, *k, *lda).transpose();
428 += alpha*matrix(a, *k, *n, *lda).transpose()*matrix(b, *k, *n, *ldb)
429 + alpha*matrix(b, *k, *n, *ldb).transpose()*matrix(a, *k, *n, *lda);
432 += alpha*matrix(a, *k, *n, *lda).transpose()*matrix(b, *k, *n, *ldb)
433 + alpha*matrix(b, *k, *n, *ldb).transpose()*matrix(a, *k, *n, *lda);
442 // c = alpha*a*b + beta*c for side = 'L'or'l'
443 // c = alpha*b*a + beta*c for side = 'R'or'r
449 Scalar alpha = *reinterpret_cast<Scalar*>(palpha);
452 // std::cerr << "in hemm " << *side << " " << *uplo << " " << *m << " " << *n << " " << alpha << " " << *lda << " " << beta << " " << *ldc << "\n";
476 ::run(*m, *n, a, *lda, b, *ldb, c, *ldc, alpha);
478 ::run(*m, *n, a, *lda, b, *ldb, c, *ldc, alpha);
483 if(UPLO(*uplo)==UP) matrix(c,*m,*n,*ldc) += alpha * matrix(b,*m,*n,*ldb) * matrix(a,*n,*n,*lda).selfadjointView<Upper>();/*internal::product_selfadjoint_matrix<Scalar,DenseIndex,ColMajor,false,false, RowMajor,true,Conj, ColMajor>
484 ::run(*m, *n, b, *ldb, a, *lda, c, *ldc, alpha);*/
486 ::run(*m, *n, b, *ldb, a, *lda, c, *ldc, alpha);
497 // c = alpha*a*conj(a') + beta*c for op = 'N'or'n'
498 // c = alpha*conj(a')*a + beta*c for op = 'C'or'c'
521 RealScalar alpha = *palpha;
524 // std::cerr << "in herk " << *uplo << " " << *op << " " << *n << " " << *k << " " << alpha << " " << *lda << " " << beta << " " << *ldc << "\n";
554 if(*k>0 && alpha!=RealScalar(0))
556 func[code](*n, *k, a, *lda, a, *lda, c, *ldc, alpha);
562 // c = alpha*a*conj(b') + conj(alpha)*b*conj(a') + beta*c, for op = 'N'or'n'
563 // c = alpha*conj(a')*b + conj(alpha)*conj(b')*a + beta*c, for op = 'C'or'c'
569 Scalar alpha = *reinterpret_cast<Scalar*>(palpha);
598 else if(*k>0 && alpha!=Scalar(0))
609 += alpha *matrix(a, *n, *k, *lda)*matrix(b, *n, *k, *ldb).adjoint()
610 + internal::conj(alpha)*matrix(b, *n, *k, *ldb)*matrix(a, *n, *k, *lda).adjoint();
614 += alpha*matrix(a, *n, *k, *lda)*matrix(b, *n, *k, *ldb).adjoint()
615 + internal::conj(alpha)*matrix(b, *n, *k, *ldb)*matrix(a, *n, *k, *lda).adjoint();
621 += alpha*matrix(a, *k, *n, *lda).adjoint()*matrix(b, *k, *n, *ldb)
622 + internal::conj(alpha)*matrix(b, *k, *n, *ldb).adjoint()*matrix(a, *k, *n, *lda);
625 += alpha*matrix(a, *k, *n, *lda).adjoint()*matrix(b, *k, *n, *ldb)
626 + internal::conj(alpha)*matrix(b, *k, *n, *ldb).adjoint()*matrix(a, *k, *n, *lda);
