Actual source code: lapack.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: This file implements a wrapper to the LAPACK eigenvalue subroutines.
12: Generalized problems are transformed to standard ones only if necessary.
13: */
15: #include <slepc/private/epsimpl.h>
17: PetscErrorCode EPSSetUp_LAPACK(EPS eps)
18: {
19: PetscErrorCode ierr,ierra,ierrb;
20: PetscBool isshift,flg,denseok=PETSC_FALSE;
21: Mat A,B,OP,shell,Ar,Br,Adense=NULL,Bdense=NULL;
22: PetscScalar shift,*Ap,*Bp;
23: PetscInt i,ld,nmat;
24: KSP ksp;
25: PC pc;
26: Vec v;
29: eps->ncv = eps->n;
30: if (eps->mpd) { PetscInfo(eps,"Warning: parameter mpd ignored\n"); }
31: if (!eps->which) { EPSSetWhichEigenpairs_Default(eps); }
32: if (eps->balance!=EPS_BALANCE_NONE) { PetscInfo(eps,"Warning: balancing ignored\n"); }
33: if (eps->stopping!=EPSStoppingBasic) SETERRQ(PetscObjectComm((PetscObject)eps),PETSC_ERR_SUP,"User-defined stopping test not supported");
34: if (eps->extraction) { PetscInfo(eps,"Warning: extraction type ignored\n"); }
35: EPSAllocateSolution(eps,0);
37: /* attempt to get dense representations of A and B separately */
38: PetscObjectTypeCompare((PetscObject)eps->st,STSHIFT,&isshift);
39: if (isshift) {
40: STGetNumMatrices(eps->st,&nmat);
41: STGetMatrix(eps->st,0,&A);
42: MatHasOperation(A,MATOP_CREATE_SUBMATRICES,&flg);
43: if (flg) {
44: PetscPushErrorHandler(PetscIgnoreErrorHandler,NULL);
45: ierra = MatCreateRedundantMatrix(A,0,PETSC_COMM_SELF,MAT_INITIAL_MATRIX,&Ar);
46: if (!ierra) { ierra |= MatConvert(Ar,MATSEQDENSE,MAT_INITIAL_MATRIX,&Adense); }
47: ierra |= MatDestroy(&Ar);
48: PetscPopErrorHandler();
49: } else ierra = 1;
50: if (nmat>1) {
51: STGetMatrix(eps->st,1,&B);
52: MatHasOperation(B,MATOP_CREATE_SUBMATRICES,&flg);
53: if (flg) {
54: PetscPushErrorHandler(PetscIgnoreErrorHandler,NULL);
55: ierrb = MatCreateRedundantMatrix(B,0,PETSC_COMM_SELF,MAT_INITIAL_MATRIX,&Br);
56: if (!ierrb) { ierrb |= MatConvert(Br,MATSEQDENSE,MAT_INITIAL_MATRIX,&Bdense); }
57: ierrb |= MatDestroy(&Br);
58: PetscPopErrorHandler();
59: } else ierrb = 1;
60: } else ierrb = 0;
61: denseok = PetscNot(ierra || ierrb);
62: }
64: /* setup DS */
65: if (denseok) {
66: if (eps->isgeneralized) {
67: if (eps->ishermitian) {
68: if (eps->ispositive) {
69: DSSetType(eps->ds,DSGHEP);
70: } else {
71: DSSetType(eps->ds,DSGNHEP); /* TODO: should be DSGHIEP */
72: }
73: } else {
74: DSSetType(eps->ds,DSGNHEP);
75: }
76: } else {
77: if (eps->ishermitian) {
78: DSSetType(eps->ds,DSHEP);
79: } else {
80: DSSetType(eps->ds,DSNHEP);
81: }
82: }
83: } else {
84: DSSetType(eps->ds,DSNHEP);
85: }
86: DSAllocate(eps->ds,eps->ncv);
87: DSGetLeadingDimension(eps->ds,&ld);
88: DSSetDimensions(eps->ds,eps->ncv,0,0,0);
90: if (denseok) {
91: STGetShift(eps->st,&shift);
92: if (shift != 0.0) {
93: MatShift(Adense,shift);
94: }
95: /* use dummy pc and ksp to avoid problems when B is not positive definite */
96: STGetKSP(eps->st,&ksp);
97: KSPSetType(ksp,KSPPREONLY);
98: KSPGetPC(ksp,&pc);
99: PCSetType(pc,PCNONE);
100: } else {
101: PetscInfo(eps,"Using slow explicit operator\n");
102: STGetOperator(eps->st,&shell);
103: MatComputeExplicitOperator(shell,&OP);
104: MatDestroy(&shell);
105: MatDestroy(&Adense);
106: MatCreateRedundantMatrix(OP,0,PETSC_COMM_SELF,MAT_INITIAL_MATRIX,&Ar);
107: MatDestroy(&OP);
108: MatConvert(Ar,MATSEQDENSE,MAT_INITIAL_MATRIX,&Adense);
109: MatDestroy(&Ar);
110: }
112: /* fill DS matrices */
113: VecCreateSeqWithArray(PETSC_COMM_SELF,1,ld,NULL,&v);
114: DSGetArray(eps->ds,DS_MAT_A,&Ap);
115: for (i=0;i<ld;i++) {
116: VecPlaceArray(v,Ap+i*ld);
117: MatGetColumnVector(Adense,v,i);
118: VecResetArray(v);
119: }
120: DSRestoreArray(eps->ds,DS_MAT_A,&Ap);
121: if (denseok && eps->isgeneralized) {
122: DSGetArray(eps->ds,DS_MAT_B,&Bp);
123: for (i=0;i<ld;i++) {
124: VecPlaceArray(v,Bp+i*ld);
125: MatGetColumnVector(Bdense,v,i);
126: VecResetArray(v);
127: }
128: DSRestoreArray(eps->ds,DS_MAT_B,&Bp);
129: }
130: VecDestroy(&v);
131: DSSetState(eps->ds,DS_STATE_RAW);
132: MatDestroy(&Adense);
133: MatDestroy(&Bdense);
134: return(0);
135: }
137: PetscErrorCode EPSSolve_LAPACK(EPS eps)
138: {
140: PetscInt n=eps->n,i,low,high;
141: PetscScalar *array,*pX;
142: Vec v;
145: DSSolve(eps->ds,eps->eigr,eps->eigi);
146: DSSort(eps->ds,eps->eigr,eps->eigi,NULL,NULL,NULL);
147: DSSynchronize(eps->ds,eps->eigr,eps->eigi);
149: /* right eigenvectors */
150: DSVectors(eps->ds,DS_MAT_X,NULL,NULL);
151: DSGetArray(eps->ds,DS_MAT_X,&pX);
152: for (i=0;i<eps->ncv;i++) {
153: BVGetColumn(eps->V,i,&v);
154: VecGetOwnershipRange(v,&low,&high);
155: VecGetArray(v,&array);
156: PetscMemcpy(array,pX+i*n+low,(high-low)*sizeof(PetscScalar));
157: VecRestoreArray(v,&array);
158: BVRestoreColumn(eps->V,i,&v);
159: }
160: DSRestoreArray(eps->ds,DS_MAT_X,&pX);
162: eps->nconv = eps->ncv;
163: eps->its = 1;
164: eps->reason = EPS_CONVERGED_TOL;
165: return(0);
166: }
168: PETSC_EXTERN PetscErrorCode EPSCreate_LAPACK(EPS eps)
169: {
171: eps->useds = PETSC_TRUE;
172: eps->categ = EPS_CATEGORY_OTHER;
174: eps->ops->solve = EPSSolve_LAPACK;
175: eps->ops->setup = EPSSetUp_LAPACK;
176: eps->ops->backtransform = EPSBackTransform_Default;
177: return(0);
178: }