Actual source code: contig.c
slepc-3.8.0 2017-10-20
1: /*
2: - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
3: SLEPc - Scalable Library for Eigenvalue Problem Computations
4: Copyright (c) 2002-2017, Universitat Politecnica de Valencia, Spain
6: This file is part of SLEPc.
7: SLEPc is distributed under a 2-clause BSD license (see LICENSE).
8: - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
9: */
10: /*
11: BV implemented as an array of Vecs sharing a contiguous array for elements
12: */
14: #include <slepc/private/bvimpl.h>
16: typedef struct {
17: Vec *V;
18: PetscScalar *array;
19: PetscBool mpi;
20: } BV_CONTIGUOUS;
22: PetscErrorCode BVMult_Contiguous(BV Y,PetscScalar alpha,PetscScalar beta,BV X,Mat Q)
23: {
25: BV_CONTIGUOUS *y = (BV_CONTIGUOUS*)Y->data,*x = (BV_CONTIGUOUS*)X->data;
26: PetscScalar *q;
27: PetscInt ldq;
30: if (Q) {
31: MatGetSize(Q,&ldq,NULL);
32: MatDenseGetArray(Q,&q);
33: BVMult_BLAS_Private(Y,Y->n,Y->k-Y->l,X->k-X->l,ldq,alpha,x->array+(X->nc+X->l)*X->n,q+Y->l*ldq+X->l,beta,y->array+(Y->nc+Y->l)*Y->n);
34: MatDenseRestoreArray(Q,&q);
35: } else {
36: BVAXPY_BLAS_Private(Y,Y->n,Y->k-Y->l,alpha,x->array+(X->nc+X->l)*X->n,beta,y->array+(Y->nc+Y->l)*Y->n);
37: }
38: return(0);
39: }
41: PetscErrorCode BVMultVec_Contiguous(BV X,PetscScalar alpha,PetscScalar beta,Vec y,PetscScalar *q)
42: {
44: BV_CONTIGUOUS *x = (BV_CONTIGUOUS*)X->data;
45: PetscScalar *py,*qq=q;
48: VecGetArray(y,&py);
49: if (!q) { VecGetArray(X->buffer,&qq); }
50: BVMultVec_BLAS_Private(X,X->n,X->k-X->l,alpha,x->array+(X->nc+X->l)*X->n,qq,beta,py);
51: if (!q) { VecRestoreArray(X->buffer,&qq); }
52: VecRestoreArray(y,&py);
53: return(0);
54: }
56: PetscErrorCode BVMultInPlace_Contiguous(BV V,Mat Q,PetscInt s,PetscInt e)
57: {
59: BV_CONTIGUOUS *ctx = (BV_CONTIGUOUS*)V->data;
60: PetscScalar *q;
61: PetscInt ldq;
64: MatGetSize(Q,&ldq,NULL);
65: MatDenseGetArray(Q,&q);
66: BVMultInPlace_BLAS_Private(V,V->n,V->k-V->l,ldq,s-V->l,e-V->l,ctx->array+(V->nc+V->l)*V->n,q+V->l*ldq+V->l,PETSC_FALSE);
67: MatDenseRestoreArray(Q,&q);
68: return(0);
69: }
71: PetscErrorCode BVMultInPlaceTranspose_Contiguous(BV V,Mat Q,PetscInt s,PetscInt e)
72: {
74: BV_CONTIGUOUS *ctx = (BV_CONTIGUOUS*)V->data;
75: PetscScalar *q;
76: PetscInt ldq;
79: MatGetSize(Q,&ldq,NULL);
80: MatDenseGetArray(Q,&q);
81: BVMultInPlace_BLAS_Private(V,V->n,V->k-V->l,ldq,s-V->l,e-V->l,ctx->array+(V->nc+V->l)*V->n,q+V->l*ldq+V->l,PETSC_TRUE);
82: MatDenseRestoreArray(Q,&q);
83: return(0);
84: }
86: PetscErrorCode BVDot_Contiguous(BV X,BV Y,Mat M)
87: {
89: BV_CONTIGUOUS *x = (BV_CONTIGUOUS*)X->data,*y = (BV_CONTIGUOUS*)Y->data;
90: PetscScalar *m;
91: PetscInt ldm;
94: MatGetSize(M,&ldm,NULL);
95: MatDenseGetArray(M,&m);
96: BVDot_BLAS_Private(X,Y->k-Y->l,X->k-X->l,X->n,ldm,y->array+(Y->nc+Y->l)*Y->n,x->array+(X->nc+X->l)*X->n,m+X->l*ldm+Y->l,x->mpi);
97: MatDenseRestoreArray(M,&m);
98: return(0);
99: }
101: PetscErrorCode BVDotVec_Contiguous(BV X,Vec y,PetscScalar *q)
102: {
103: PetscErrorCode ierr;
104: BV_CONTIGUOUS *x = (BV_CONTIGUOUS*)X->data;
105: const PetscScalar *py;
106: PetscScalar *qq=q;
107: Vec z = y;
110: if (X->matrix) {
111: BV_IPMatMult(X,y);
112: z = X->Bx;
113: }
114: VecGetArrayRead(z,&py);
115: if (!q) { VecGetArray(X->buffer,&qq); }
116: BVDotVec_BLAS_Private(X,X->n,X->k-X->l,x->array+(X->nc+X->l)*X->n,py,qq,x->mpi);
117: if (!q) { VecRestoreArray(X->buffer,&qq); }
118: VecRestoreArrayRead(z,&py);
119: return(0);
120: }
122: PetscErrorCode BVDotVec_Local_Contiguous(BV X,Vec y,PetscScalar *m)
123: {
125: BV_CONTIGUOUS *x = (BV_CONTIGUOUS*)X->data;
126: PetscScalar *py;
127: Vec z = y;
130: if (X->matrix) {
131: BV_IPMatMult(X,y);
132: z = X->Bx;
133: }
134: VecGetArray(z,&py);
135: BVDotVec_BLAS_Private(X,X->n,X->k-X->l,x->array+(X->nc+X->l)*X->n,py,m,PETSC_FALSE);
136: VecRestoreArray(z,&py);
137: return(0);
138: }
140: PetscErrorCode BVScale_Contiguous(BV bv,PetscInt j,PetscScalar alpha)
141: {
143: BV_CONTIGUOUS *ctx = (BV_CONTIGUOUS*)bv->data;
146: if (j<0) {
147: BVScale_BLAS_Private(bv,(bv->k-bv->l)*bv->n,ctx->array+(bv->nc+bv->l)*bv->n,alpha);
148: } else {
149: BVScale_BLAS_Private(bv,bv->n,ctx->array+(bv->nc+j)*bv->n,alpha);
150: }
151: return(0);
152: }
154: PetscErrorCode BVNorm_Contiguous(BV bv,PetscInt j,NormType type,PetscReal *val)
155: {
157: BV_CONTIGUOUS *ctx = (BV_CONTIGUOUS*)bv->data;
160: if (j<0) {
161: BVNorm_LAPACK_Private(bv,bv->n,bv->k-bv->l,ctx->array+(bv->nc+bv->l)*bv->n,type,val,ctx->mpi);
162: } else {
163: BVNorm_LAPACK_Private(bv,bv->n,1,ctx->array+(bv->nc+j)*bv->n,type,val,ctx->mpi);
164: }
165: return(0);
166: }
168: PetscErrorCode BVNorm_Local_Contiguous(BV bv,PetscInt j,NormType type,PetscReal *val)
169: {
171: BV_CONTIGUOUS *ctx = (BV_CONTIGUOUS*)bv->data;
174: if (j<0) {
175: BVNorm_LAPACK_Private(bv,bv->n,bv->k-bv->l,ctx->array+(bv->nc+bv->l)*bv->n,type,val,PETSC_FALSE);
176: } else {
177: BVNorm_LAPACK_Private(bv,bv->n,1,ctx->array+(bv->nc+j)*bv->n,type,val,PETSC_FALSE);
178: }
179: return(0);
180: }
182: PetscErrorCode BVMatMult_Contiguous(BV V,Mat A,BV W)
183: {
185: BV_CONTIGUOUS *v = (BV_CONTIGUOUS*)V->data,*w = (BV_CONTIGUOUS*)W->data;
186: PetscScalar *pb,*pc;
187: PetscInt j,m;
188: PetscBool flg;
191: MatHasOperation(A,MATOP_MAT_MULT,&flg);
192: if (V->vmm && flg) {
193: m = V->k-V->l;
194: if (V->vmm==BV_MATMULT_MAT_SAVE) {
195: BV_AllocateMatMult(V,A,m);
196: MatDenseGetArray(V->B,&pb);
197: PetscMemcpy(pb,v->array+(V->nc+V->l)*V->n,m*V->n*sizeof(PetscScalar));
198: MatDenseRestoreArray(V->B,&pb);
199: } else { /* BV_MATMULT_MAT */
200: MatCreateDense(PetscObjectComm((PetscObject)V),V->n,PETSC_DECIDE,V->N,m,v->array+(V->nc+V->l)*V->n,&V->B);
201: }
202: if (!V->C) {
203: MatMatMultSymbolic(A,V->B,PETSC_DEFAULT,&V->C);
204: }
205: MatMatMultNumeric(A,V->B,V->C);
206: MatDenseGetArray(V->C,&pc);
207: PetscMemcpy(w->array+(W->nc+W->l)*W->n,pc,m*V->n*sizeof(PetscScalar));
208: MatDenseRestoreArray(V->C,&pc);
209: if (V->vmm==BV_MATMULT_MAT) {
210: MatDestroy(&V->B);
211: MatDestroy(&V->C);
212: }
213: } else {
214: for (j=0;j<V->k-V->l;j++) {
215: MatMult(A,v->V[V->nc+V->l+j],w->V[W->nc+W->l+j]);
216: }
217: }
218: return(0);
219: }
221: PetscErrorCode BVCopy_Contiguous(BV V,BV W)
222: {
224: BV_CONTIGUOUS *v = (BV_CONTIGUOUS*)V->data,*w = (BV_CONTIGUOUS*)W->data;
225: PetscScalar *pvc,*pwc;
228: pvc = v->array+(V->nc+V->l)*V->n;
229: pwc = w->array+(W->nc+W->l)*W->n;
230: PetscMemcpy(pwc,pvc,(V->k-V->l)*V->n*sizeof(PetscScalar));
231: return(0);
232: }
234: PetscErrorCode BVResize_Contiguous(BV bv,PetscInt m,PetscBool copy)
235: {
237: BV_CONTIGUOUS *ctx = (BV_CONTIGUOUS*)bv->data;
238: PetscInt j,bs;
239: PetscScalar *newarray;
240: Vec *newV;
241: char str[50];
244: VecGetBlockSize(bv->t,&bs);
245: PetscMalloc1(m*bv->n,&newarray);
246: PetscMemzero(newarray,m*bv->n*sizeof(PetscScalar));
247: PetscMalloc1(m,&newV);
248: for (j=0;j<m;j++) {
249: if (ctx->mpi) {
250: VecCreateMPIWithArray(PetscObjectComm((PetscObject)bv->t),bs,bv->n,PETSC_DECIDE,newarray+j*bv->n,newV+j);
251: } else {
252: VecCreateSeqWithArray(PetscObjectComm((PetscObject)bv->t),bs,bv->n,newarray+j*bv->n,newV+j);
253: }
254: }
255: PetscLogObjectParents(bv,m,newV);
256: if (((PetscObject)bv)->name) {
257: for (j=0;j<m;j++) {
258: PetscSNPrintf(str,50,"%s_%d",((PetscObject)bv)->name,(int)j);
259: PetscObjectSetName((PetscObject)newV[j],str);
260: }
261: }
262: if (copy) {
263: PetscMemcpy(newarray,ctx->array,PetscMin(m,bv->m)*bv->n*sizeof(PetscScalar));
264: }
265: VecDestroyVecs(bv->m,&ctx->V);
266: ctx->V = newV;
267: PetscFree(ctx->array);
268: ctx->array = newarray;
269: return(0);
270: }
272: PetscErrorCode BVGetColumn_Contiguous(BV bv,PetscInt j,Vec *v)
273: {
274: BV_CONTIGUOUS *ctx = (BV_CONTIGUOUS*)bv->data;
275: PetscInt l;
278: l = BVAvailableVec;
279: bv->cv[l] = ctx->V[bv->nc+j];
280: return(0);
281: }
283: PetscErrorCode BVGetArray_Contiguous(BV bv,PetscScalar **a)
284: {
285: BV_CONTIGUOUS *ctx = (BV_CONTIGUOUS*)bv->data;
288: *a = ctx->array;
289: return(0);
290: }
292: PetscErrorCode BVGetArrayRead_Contiguous(BV bv,const PetscScalar **a)
293: {
294: BV_CONTIGUOUS *ctx = (BV_CONTIGUOUS*)bv->data;
297: *a = ctx->array;
298: return(0);
299: }
301: PetscErrorCode BVDestroy_Contiguous(BV bv)
302: {
304: BV_CONTIGUOUS *ctx = (BV_CONTIGUOUS*)bv->data;
307: VecDestroyVecs(bv->nc+bv->m,&ctx->V);
308: PetscFree(ctx->array);
309: PetscFree(bv->data);
310: return(0);
311: }
313: PETSC_EXTERN PetscErrorCode BVCreate_Contiguous(BV bv)
314: {
316: BV_CONTIGUOUS *ctx;
317: PetscInt j,nloc,bs;
318: PetscBool seq;
319: PetscScalar *aa;
320: char str[50];
323: PetscNewLog(bv,&ctx);
324: bv->data = (void*)ctx;
326: PetscObjectTypeCompare((PetscObject)bv->t,VECMPI,&ctx->mpi);
327: if (!ctx->mpi) {
328: PetscObjectTypeCompare((PetscObject)bv->t,VECSEQ,&seq);
329: if (!seq) SETERRQ(PetscObjectComm((PetscObject)bv),PETSC_ERR_SUP,"Cannot create a contiguous BV from a non-standard template vector");
330: }
332: VecGetLocalSize(bv->t,&nloc);
333: VecGetBlockSize(bv->t,&bs);
334: PetscMalloc1(bv->m*nloc,&ctx->array);
335: PetscMemzero(ctx->array,bv->m*nloc*sizeof(PetscScalar));
336: PetscMalloc1(bv->m,&ctx->V);
337: for (j=0;j<bv->m;j++) {
338: if (ctx->mpi) {
339: VecCreateMPIWithArray(PetscObjectComm((PetscObject)bv->t),bs,nloc,PETSC_DECIDE,ctx->array+j*nloc,ctx->V+j);
340: } else {
341: VecCreateSeqWithArray(PetscObjectComm((PetscObject)bv->t),bs,nloc,ctx->array+j*nloc,ctx->V+j);
342: }
343: }
344: PetscLogObjectParents(bv,bv->m,ctx->V);
345: if (((PetscObject)bv)->name) {
346: for (j=0;j<bv->m;j++) {
347: PetscSNPrintf(str,50,"%s_%d",((PetscObject)bv)->name,(int)j);
348: PetscObjectSetName((PetscObject)ctx->V[j],str);
349: }
350: }
352: if (bv->Acreate) {
353: MatDenseGetArray(bv->Acreate,&aa);
354: PetscMemcpy(ctx->array,aa,bv->m*nloc*sizeof(PetscScalar));
355: MatDenseRestoreArray(bv->Acreate,&aa);
356: MatDestroy(&bv->Acreate);
357: }
359: bv->ops->mult = BVMult_Contiguous;
360: bv->ops->multvec = BVMultVec_Contiguous;
361: bv->ops->multinplace = BVMultInPlace_Contiguous;
362: bv->ops->multinplacetrans = BVMultInPlaceTranspose_Contiguous;
363: bv->ops->dot = BVDot_Contiguous;
364: bv->ops->dotvec = BVDotVec_Contiguous;
365: bv->ops->dotvec_local = BVDotVec_Local_Contiguous;
366: bv->ops->scale = BVScale_Contiguous;
367: bv->ops->norm = BVNorm_Contiguous;
368: bv->ops->norm_local = BVNorm_Local_Contiguous;
369: bv->ops->matmult = BVMatMult_Contiguous;
370: bv->ops->copy = BVCopy_Contiguous;
371: bv->ops->resize = BVResize_Contiguous;
372: bv->ops->getcolumn = BVGetColumn_Contiguous;
373: bv->ops->getarray = BVGetArray_Contiguous;
374: bv->ops->getarrayread = BVGetArrayRead_Contiguous;
375: bv->ops->destroy = BVDestroy_Contiguous;
376: return(0);
377: }