Actual source code: bvblas.c

slepc-3.6.3 2016-03-29
Report Typos and Errors
  1: /*
  2:    BV private kernels that use the BLAS.

  4:    - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
  5:    SLEPc - Scalable Library for Eigenvalue Problem Computations
  6:    Copyright (c) 2002-2015, Universitat Politecnica de Valencia, Spain

  8:    This file is part of SLEPc.

 10:    SLEPc is free software: you can redistribute it and/or modify it under  the
 11:    terms of version 3 of the GNU Lesser General Public License as published by
 12:    the Free Software Foundation.

 14:    SLEPc  is  distributed in the hope that it will be useful, but WITHOUT  ANY
 15:    WARRANTY;  without even the implied warranty of MERCHANTABILITY or  FITNESS
 16:    FOR  A  PARTICULAR PURPOSE. See the GNU Lesser General Public  License  for
 17:    more details.

 19:    You  should have received a copy of the GNU Lesser General  Public  License
 20:    along with SLEPc. If not, see <http://www.gnu.org/licenses/>.
 21:    - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
 22: */

 24: #include <slepc/private/bvimpl.h>
 25: #include <slepcblaslapack.h>

 27: #define BLOCKSIZE 64

 31: /*
 32:     C := alpha*A*B + beta*C

 34:     A is mxk (ld=m), B is kxn (ld=ldb), C is mxn (ld=m)
 35: */
 36: PetscErrorCode BVMult_BLAS_Private(BV bv,PetscInt m_,PetscInt n_,PetscInt k_,PetscInt ldb_,PetscScalar alpha,const PetscScalar *A,const PetscScalar *B,PetscScalar beta,PetscScalar *C)
 37: {
 39:   PetscBLASInt   m,n,k,ldb;
 40: #if defined(PETSC_HAVE_FBLASLAPACK) || defined(PETSC_HAVE_F2CBLASLAPACK)
 41:   PetscBLASInt   l,bs=BLOCKSIZE;
 42: #endif

 45:   PetscBLASIntCast(m_,&m);
 46:   PetscBLASIntCast(n_,&n);
 47:   PetscBLASIntCast(k_,&k);
 48:   PetscBLASIntCast(ldb_,&ldb);
 49: #if defined(PETSC_HAVE_FBLASLAPACK) || defined(PETSC_HAVE_F2CBLASLAPACK)
 50:   l = m % bs;
 51:   if (l) PetscStackCallBLAS("BLASgemm",BLASgemm_("N","N",&l,&n,&k,&alpha,(PetscScalar*)A,&m,(PetscScalar*)B,&ldb,&beta,C,&m));
 52:   for (;l<m;l+=bs) {
 53:     PetscStackCallBLAS("BLASgemm",BLASgemm_("N","N",&bs,&n,&k,&alpha,(PetscScalar*)A+l,&m,(PetscScalar*)B,&ldb,&beta,C+l,&m));
 54:   }
 55: #else
 56:   if (m) PetscStackCallBLAS("BLASgemm",BLASgemm_("N","N",&m,&n,&k,&alpha,(PetscScalar*)A,&m,(PetscScalar*)B,&ldb,&beta,C,&m));
 57: #endif
 58:   PetscLogFlops(2.0*m*n*k);
 59:   return(0);
 60: }

 64: /*
 65:     y := alpha*A*x + beta*y

 67:     A is nxk (ld=n)
 68: */
 69: PetscErrorCode BVMultVec_BLAS_Private(BV bv,PetscInt n_,PetscInt k_,PetscScalar alpha,const PetscScalar *A,const PetscScalar *x,PetscScalar beta,PetscScalar *y)
 70: {
 72:   PetscBLASInt   n,k,one=1;

 75:   PetscBLASIntCast(n_,&n);
 76:   PetscBLASIntCast(k_,&k);
 77:   if (n) PetscStackCallBLAS("BLASgemv",BLASgemv_("N",&n,&k,&alpha,A,&n,x,&one,&beta,y,&one));
 78:   PetscLogFlops(2.0*n*k);
 79:   return(0);
 80: }

 84: /*
 85:     A(:,s:e-1) := A*B(:,s:e-1)

 87:     A is mxk (ld=m), B is kxn (ld=ldb)  n=e-s
 88: */
 89: PetscErrorCode BVMultInPlace_BLAS_Private(BV bv,PetscInt m_,PetscInt k_,PetscInt ldb_,PetscInt s,PetscInt e,PetscScalar *A,const PetscScalar *B,PetscBool btrans)
 90: {
 92:   PetscScalar    *pb,zero=0.0,one=1.0;
 93:   PetscBLASInt   m,n,k,l,ldb,bs=BLOCKSIZE;
 94:   PetscInt       j,n_=e-s;
 95:   const char     *bt;

 98:   PetscBLASIntCast(m_,&m);
 99:   PetscBLASIntCast(n_,&n);
100:   PetscBLASIntCast(k_,&k);
101:   PetscBLASIntCast(ldb_,&ldb);
102:   BVAllocateWork_Private(bv,BLOCKSIZE*n_);
103:   if (btrans) {
104:     pb = (PetscScalar*)B+s;
105:     bt = "C";
106:   } else {
107:     pb = (PetscScalar*)B+s*ldb;
108:     bt = "N";
109:   }
110:   l = m % bs;
111:   if (l) {
112:     PetscStackCallBLAS("BLASgemm",BLASgemm_("N",bt,&l,&n,&k,&one,A,&m,pb,&ldb,&zero,bv->work,&l));
113:     for (j=0;j<n;j++) {
114:       PetscMemcpy(A+(s+j)*m,bv->work+j*l,l*sizeof(PetscScalar));
115:     }
116:   }
117:   for (;l<m;l+=bs) {
118:     PetscStackCallBLAS("BLASgemm",BLASgemm_("N",bt,&bs,&n,&k,&one,A+l,&m,pb,&ldb,&zero,bv->work,&bs));
119:     for (j=0;j<n;j++) {
120:       PetscMemcpy(A+(s+j)*m+l,bv->work+j*bs,bs*sizeof(PetscScalar));
121:     }
122:   }
123:   PetscLogFlops(2.0*m*n*k);
124:   return(0);
125: }

129: /*
130:     V := V*B

132:     V is mxn (ld=m), B is nxn (ld=k)
133: */
134: PetscErrorCode BVMultInPlace_Vecs_Private(BV bv,PetscInt m_,PetscInt n_,PetscInt k_,Vec *V,const PetscScalar *B,PetscBool btrans)
135: {
136:   PetscErrorCode    ierr;
137:   PetscScalar       zero=0.0,one=1.0,*out,*pout;
138:   const PetscScalar *pin;
139:   PetscBLASInt      m,n,k,l,bs=BLOCKSIZE;
140:   PetscInt          j;
141:   const char        *bt;

144:   PetscBLASIntCast(m_,&m);
145:   PetscBLASIntCast(n_,&n);
146:   PetscBLASIntCast(k_,&k);
147:   BVAllocateWork_Private(bv,2*BLOCKSIZE*n_);
148:   out = bv->work+BLOCKSIZE*n_;
149:   if (btrans) bt = "C";
150:   else bt = "N";
151:   l = m % bs;
152:   if (l) {
153:     for (j=0;j<n;j++) {
154:       VecGetArrayRead(V[j],&pin);
155:       PetscMemcpy(bv->work+j*l,pin,l*sizeof(PetscScalar));
156:       VecRestoreArrayRead(V[j],&pin);
157:     }
158:     PetscStackCallBLAS("BLASgemm",BLASgemm_("N",bt,&l,&n,&n,&one,bv->work,&l,(PetscScalar*)B,&k,&zero,out,&l));
159:     for (j=0;j<n;j++) {
160:       VecGetArray(V[j],&pout);
161:       PetscMemcpy(pout,out+j*l,l*sizeof(PetscScalar));
162:       VecRestoreArray(V[j],&pout);
163:     }
164:   }
165:   for (;l<m;l+=bs) {
166:     for (j=0;j<n;j++) {
167:       VecGetArrayRead(V[j],&pin);
168:       PetscMemcpy(bv->work+j*bs,pin+l,bs*sizeof(PetscScalar));
169:       VecRestoreArrayRead(V[j],&pin);
170:     }
171:     PetscStackCallBLAS("BLASgemm",BLASgemm_("N",bt,&bs,&n,&n,&one,bv->work,&bs,(PetscScalar*)B,&k,&zero,out,&bs));
172:     for (j=0;j<n;j++) {
173:       VecGetArray(V[j],&pout);
174:       PetscMemcpy(pout+l,out+j*bs,bs*sizeof(PetscScalar));
175:       VecRestoreArray(V[j],&pout);
176:     }
177:   }
178:   PetscLogFlops(2.0*n*n*k);
179:   return(0);
180: }

184: /*
185:     B := alpha*A + B

187:     A,B are nxk (ld=n)
188: */
189: PetscErrorCode BVAXPY_BLAS_Private(BV bv,PetscInt n_,PetscInt k_,PetscScalar alpha,const PetscScalar *A,PetscScalar *B)
190: {
192:   PetscBLASInt   m,one=1;

195:   PetscBLASIntCast(n_*k_,&m);
196:   PetscStackCallBLAS("BLASaxpy",BLASaxpy_(&m,&alpha,A,&one,B,&one));
197:   PetscLogFlops(2.0*n_*k_);
198:   return(0);
199: }

203: /*
204:     C := A'*B

206:     A' is mxk (ld=k), B is kxn (ld=k), C is mxn (ld=ldc)
207: */
208: PetscErrorCode BVDot_BLAS_Private(BV bv,PetscInt m_,PetscInt n_,PetscInt k_,PetscInt ldc_,const PetscScalar *A,const PetscScalar *B,PetscScalar *C,PetscBool mpi)
209: {
211:   PetscScalar    zero=0.0,one=1.0,*CC;
212:   PetscBLASInt   m,n,k,ldc,j;

215:   PetscBLASIntCast(m_,&m);
216:   PetscBLASIntCast(n_,&n);
217:   PetscBLASIntCast(k_,&k);
218:   PetscBLASIntCast(ldc_,&ldc);
219:   if (mpi) {
220:     if (ldc==m) {
221:       BVAllocateWork_Private(bv,m*n);
222:       if (k) PetscStackCallBLAS("BLASgemm",BLASgemm_("C","N",&m,&n,&k,&one,(PetscScalar*)A,&k,(PetscScalar*)B,&k,&zero,bv->work,&ldc));
223:       else { PetscMemzero(bv->work,m*n*sizeof(PetscScalar)); }
224:       MPI_Allreduce(bv->work,C,m*n,MPIU_SCALAR,MPIU_SUM,PetscObjectComm((PetscObject)bv));
225:     } else {
226:       BVAllocateWork_Private(bv,2*m*n);
227:       CC = bv->work+m*n;
228:       if (k) PetscStackCallBLAS("BLASgemm",BLASgemm_("C","N",&m,&n,&k,&one,(PetscScalar*)A,&k,(PetscScalar*)B,&k,&zero,bv->work,&m));
229:       else { PetscMemzero(bv->work,m*n*sizeof(PetscScalar)); }
230:       MPI_Allreduce(bv->work,CC,m*n,MPIU_SCALAR,MPIU_SUM,PetscObjectComm((PetscObject)bv));
231:       for (j=0;j<n;j++) {
232:         PetscMemcpy(C+j*ldc,CC+j*m,m*sizeof(PetscScalar));
233:       }
234:     }
235:   } else {
236:     if (k) PetscStackCallBLAS("BLASgemm",BLASgemm_("C","N",&m,&n,&k,&one,(PetscScalar*)A,&k,(PetscScalar*)B,&k,&zero,C,&ldc));
237:   }
238:   PetscLogFlops(2.0*m*n*k);
239:   return(0);
240: }

244: /*
245:     y := A'*x

247:     A is nxk (ld=n)
248: */
249: PetscErrorCode BVDotVec_BLAS_Private(BV bv,PetscInt n_,PetscInt k_,const PetscScalar *A,const PetscScalar *x,PetscScalar *y,PetscBool mpi)
250: {
252:   PetscScalar    zero=0.0,done=1.0;
253:   PetscBLASInt   n,k,one=1;

256:   PetscBLASIntCast(n_,&n);
257:   PetscBLASIntCast(k_,&k);
258:   if (mpi) {
259:     BVAllocateWork_Private(bv,k);
260:     if (n) {
261:       PetscStackCallBLAS("BLASgemv",BLASgemv_("C",&n,&k,&done,A,&n,x,&one,&zero,bv->work,&one));
262:     } else {
263:       PetscMemzero(bv->work,k*sizeof(PetscScalar));
264:     }
265:     MPI_Allreduce(bv->work,y,k,MPIU_SCALAR,MPIU_SUM,PetscObjectComm((PetscObject)bv));
266:   } else {
267:     if (n) PetscStackCallBLAS("BLASgemv",BLASgemv_("C",&n,&k,&done,A,&n,x,&one,&zero,y,&one));
268:   }
269:   PetscLogFlops(2.0*n*k);
270:   return(0);
271: }

275: /*
276:     Scale n scalars
277: */
278: PetscErrorCode BVScale_BLAS_Private(BV bv,PetscInt n_,PetscScalar *A,PetscScalar alpha)
279: {
281:   PetscBLASInt   n,one=1;

284:   if (alpha == (PetscScalar)0.0) {
285:     PetscMemzero(A,n_*sizeof(PetscScalar));
286:   } else {
287:     PetscBLASIntCast(n_,&n);
288:     PetscStackCallBLAS("BLASscal",BLASscal_(&n,&alpha,A,&one));
289:     PetscLogFlops(n);
290:   }
291:   return(0);
292: }

296: /*
297:     Compute ||A|| for an mxn matrix
298: */
299: PetscErrorCode BVNorm_LAPACK_Private(BV bv,PetscInt m_,PetscInt n_,const PetscScalar *A,NormType type,PetscReal *nrm,PetscBool mpi)
300: {
302:   PetscBLASInt   m,n,i,j;
303:   PetscReal      lnrm,*rwork=NULL,*rwork2=NULL;

306:   PetscFPTrapPush(PETSC_FP_TRAP_OFF);
307:   PetscBLASIntCast(m_,&m);
308:   PetscBLASIntCast(n_,&n);
309:   if (type==NORM_FROBENIUS || type==NORM_2) {
310:     lnrm = LAPACKlange_("F",&m,&n,(PetscScalar*)A,&m,rwork);
311:     if (mpi) {
312:       lnrm = lnrm*lnrm;
313:       MPI_Allreduce(&lnrm,nrm,1,MPIU_REAL,MPIU_SUM,PetscObjectComm((PetscObject)bv));
314:       *nrm = PetscSqrtReal(*nrm);
315:     } else *nrm = lnrm;
316:     PetscLogFlops(2.0*m*n);
317:   } else if (type==NORM_1) {
318:     if (mpi) {
319:       BVAllocateWork_Private(bv,2*n_);
320:       rwork = (PetscReal*)bv->work;
321:       rwork2 = rwork+n_;
322:       PetscMemzero(rwork,n_*sizeof(PetscReal));
323:       PetscMemzero(rwork2,n_*sizeof(PetscReal));
324:       for (j=0;j<n_;j++) {
325:         for (i=0;i<m_;i++) {
326:           rwork[j] += PetscAbsScalar(A[i+j*m_]);
327:         }
328:       }
329:       MPI_Allreduce(rwork,rwork2,n_,MPIU_REAL,MPIU_SUM,PetscObjectComm((PetscObject)bv));
330:       for (j=0;j<n_;j++) if (rwork2[j] > *nrm) *nrm = rwork2[j];
331:     } else {
332:       *nrm = LAPACKlange_("O",&m,&n,(PetscScalar*)A,&m,rwork);
333:     }
334:     PetscLogFlops(1.0*m*n);
335:   } else if (type==NORM_INFINITY) {
336:     BVAllocateWork_Private(bv,m_);
337:     rwork = (PetscReal*)bv->work;
338:     lnrm = LAPACKlange_("I",&m,&n,(PetscScalar*)A,&m,rwork);
339:     if (mpi) {
340:       MPI_Allreduce(&lnrm,nrm,1,MPIU_REAL,MPIU_MAX,PetscObjectComm((PetscObject)bv));
341:     } else *nrm = lnrm;
342:     PetscLogFlops(1.0*m*n);
343:   }
344:   PetscFPTrapPop();
345:   return(0);
346: }

350: /*
351:     QR factorization of an mxn matrix
352: */
353: PetscErrorCode BVOrthogonalize_LAPACK_Private(BV bv,PetscInt m_,PetscInt n_,PetscScalar *Q,PetscScalar *R,PetscBool mpi)
354: {
355: #if defined(PETSC_MISSING_LAPACK_GEQRF) || defined(SLEPC_MISSING_LAPACK_ORGQR)
357:   SETERRQ(PETSC_COMM_SELF,PETSC_ERR_SUP,"GEQRF/ORGQR - Lapack routines are unavailable");
358: #else
360:   PetscBLASInt   m,n,i,j,k,l,nb,lwork,info;
361:   PetscScalar    *tau,*work,*Rl=NULL,*A=NULL,*C=NULL,one=1.0,zero=0.0;
362:   PetscMPIInt    rank,size;

365:   PetscFPTrapPush(PETSC_FP_TRAP_OFF);
366:   PetscBLASIntCast(m_,&m);
367:   PetscBLASIntCast(n_,&n);
368:   k = PetscMin(m,n);
369:   nb = 16;
370:   if (mpi) {
371:     MPI_Comm_rank(PetscObjectComm((PetscObject)bv),&rank);
372:     MPI_Comm_size(PetscObjectComm((PetscObject)bv),&size);
373:     BVAllocateWork_Private(bv,k+n*nb+n*n+n*n*size+m*n);
374:   } else {
375:     BVAllocateWork_Private(bv,k+n*nb);
376:    }
377:   tau = bv->work;
378:   work = bv->work+k;
379:   PetscBLASIntCast(n*nb,&lwork);
380:   if (mpi) {
381:     Rl = bv->work+k+n*nb;
382:     A  = bv->work+k+n*nb+n*n;
383:     C  = bv->work+k+n*nb+n*n+n*n*size;
384:   }

386:   /* Compute QR */
387:   PetscStackCallBLAS("LAPACKgeqrf",LAPACKgeqrf_(&m,&n,Q,&m,tau,work,&lwork,&info));
388:   if (info) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in Lapack xGEQRF %d",info);

390:   /* Extract R */
391:   if (R || mpi) {
392:     PetscMemzero(mpi? Rl: R,n*n*sizeof(PetscScalar));
393:     for (j=0;j<n;j++) {
394:       for (i=0;i<=j;i++) {
395:         if (mpi) Rl[i+j*n] = Q[i+j*m];
396:         else R[i+j*n] = Q[i+j*m];
397:       }
398:     }
399:   }

401:   /* Compute orthogonal matrix in Q */
402:   PetscStackCallBLAS("LAPACKorgqr",LAPACKorgqr_(&m,&n,&k,Q,&m,tau,work,&lwork,&info));
403:   if (info) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in Lapack xORGQR %d",info);

405:   if (mpi) {

407:     /* Stack triangular matrices */
408:     PetscBLASIntCast(n*size,&l);
409:     for (j=0;j<n;j++) {
410:       MPI_Allgather(Rl+j*n,n,MPIU_SCALAR,A+j*l,n,MPIU_SCALAR,PetscObjectComm((PetscObject)bv));
411:     }

413:     /* Compute QR */
414:     PetscStackCallBLAS("LAPACKgeqrf",LAPACKgeqrf_(&l,&n,A,&l,tau,work,&lwork,&info));
415:     if (info) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in Lapack xGEQRF %d",info);

417:     /* Extract R */
418:     if (R) {
419:       PetscMemzero(R,n*n*sizeof(PetscScalar));
420:       for (j=0;j<n;j++)
421:         for (i=0;i<=j;i++)
422:           R[i+j*n] = A[i+j*l];
423:     }

425:     /* Accumulate orthogonal matrix */
426:     PetscStackCallBLAS("LAPACKorgqr",LAPACKorgqr_(&l,&n,&n,A,&l,tau,work,&lwork,&info));
427:     if (info) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in Lapack xORGQR %d",info);
428:     PetscStackCallBLAS("BLASgemm",BLASgemm_("N","N",&m,&n,&n,&one,Q,&m,A+rank*n,&l,&zero,C,&m));
429:     PetscMemcpy(Q,C,m*n*sizeof(PetscScalar));
430:   }

432:   PetscLogFlops(3.0*m*n*n);
433:   PetscFPTrapPop();
434:   return(0);
435: #endif
436: }