Actual source code: kspimpl.h
1: #pragma once
3: #include <petscksp.h>
4: #include <petscds.h>
5: #include <petsc/private/petscimpl.h>
7: /* SUBMANSEC = KSP */
9: PETSC_EXTERN PetscBool KSPRegisterAllCalled;
10: PETSC_EXTERN PetscBool KSPMonitorRegisterAllCalled;
11: PETSC_EXTERN PetscErrorCode KSPRegisterAll(void);
12: PETSC_EXTERN PetscErrorCode KSPMonitorRegisterAll(void);
13: PETSC_EXTERN PetscErrorCode KSPGuessRegisterAll(void);
14: PETSC_EXTERN PetscErrorCode KSPMatRegisterAll(void);
16: typedef struct _KSPOps *KSPOps;
18: struct _KSPOps {
19: PetscErrorCode (*buildsolution)(KSP, Vec, Vec *); /* Returns a pointer to the solution, or
20: calculates the solution in a
21: user-provided area. */
22: PetscErrorCode (*buildresidual)(KSP, Vec, Vec, Vec *); /* Returns a pointer to the residual, or
23: calculates the residual in a
24: user-provided area. */
25: PetscErrorCode (*solve)(KSP); /* actual solver */
26: PetscErrorCode (*matsolve)(KSP, Mat, Mat); /* multiple dense RHS solver */
27: PetscErrorCode (*setup)(KSP);
28: PetscErrorCode (*setfromoptions)(KSP, PetscOptionItems);
29: PetscErrorCode (*publishoptions)(KSP);
30: PetscErrorCode (*computeextremesingularvalues)(KSP, PetscReal *, PetscReal *);
31: PetscErrorCode (*computeeigenvalues)(KSP, PetscInt, PetscReal *, PetscReal *, PetscInt *);
32: PetscErrorCode (*computeritz)(KSP, PetscBool, PetscBool, PetscInt *, Vec[], PetscReal *, PetscReal *);
33: PetscErrorCode (*destroy)(KSP);
34: PetscErrorCode (*view)(KSP, PetscViewer);
35: PetscErrorCode (*reset)(KSP);
36: PetscErrorCode (*load)(KSP, PetscViewer);
37: };
39: typedef struct _KSPGuessOps *KSPGuessOps;
41: struct _KSPGuessOps {
42: PetscErrorCode (*formguess)(KSPGuess, Vec, Vec); /* Form initial guess */
43: PetscErrorCode (*update)(KSPGuess, Vec, Vec); /* Update database */
44: PetscErrorCode (*setfromoptions)(KSPGuess);
45: PetscErrorCode (*settolerance)(KSPGuess, PetscReal);
46: PetscErrorCode (*setup)(KSPGuess);
47: PetscErrorCode (*destroy)(KSPGuess);
48: PetscErrorCode (*view)(KSPGuess, PetscViewer);
49: PetscErrorCode (*reset)(KSPGuess);
50: };
52: /*
53: Defines the KSPGuess data structure.
54: */
55: struct _p_KSPGuess {
56: PETSCHEADER(struct _KSPGuessOps);
57: KSP ksp; /* the parent KSP */
58: Mat A; /* the current linear operator */
59: PetscObjectState omatstate; /* previous linear operator state */
60: void *data; /* pointer to the specific implementation */
61: };
63: PETSC_EXTERN PetscErrorCode KSPGuessCreate_Fischer(KSPGuess);
64: PETSC_EXTERN PetscErrorCode KSPGuessCreate_POD(KSPGuess);
66: /*
67: Maximum number of monitors you can run with a single KSP
68: */
69: #define MAXKSPMONITORS 5
70: #define MAXKSPREASONVIEWS 5
71: typedef enum {
72: KSP_SETUP_NEW = 0,
73: KSP_SETUP_NEWMATRIX,
74: KSP_SETUP_NEWRHS
75: } KSPSetUpStage;
77: /*
78: Defines the KSP data structure.
79: */
80: struct _p_KSP {
81: PETSCHEADER(struct _KSPOps);
82: DM dm;
83: PetscBool dmAuto; /* DM was created automatically by KSP */
84: KSPDMActive dmActive; /* KSP should use DM for computing operators */
85: /*------------------------- User parameters--------------------------*/
86: PetscObjectParameterDeclare(PetscInt, max_it); /* maximum number of iterations */
87: PetscInt min_it; /* minimum number of iterations */
88: KSPGuess guess;
89: PetscBool guess_zero, /* flag for whether initial guess is 0 */
90: guess_not_read, /* guess is not read, does not need to be zeroed */
91: calc_sings, /* calculate extreme Singular Values */
92: calc_ritz, /* calculate (harmonic) Ritz pairs */
93: guess_knoll; /* use initial guess of PCApply(ksp->B,b */
94: PCSide pc_side; /* flag for left, right, or symmetric preconditioning */
95: PetscInt normsupporttable[KSP_NORM_MAX][PC_SIDE_MAX]; /* Table of supported norms and pc_side, see KSPSetSupportedNorm() */
96: PetscObjectParameterDeclare(PetscReal, rtol); /* relative tolerance */
97: PetscObjectParameterDeclare(PetscReal, abstol); /* absolute tolerance */
98: PetscObjectParameterDeclare(PetscReal, ttol); /* (not set by user) */
99: PetscObjectParameterDeclare(PetscReal, divtol); /* divergence tolerance */
100: PetscReal rnorm0; /* initial residual norm (used for divergence testing) */
101: PetscReal rnorm; /* current residual norm */
102: KSPConvergedReason reason;
103: PetscBool errorifnotconverged; /* create an error if the KSPSolve() does not converge */
105: Vec vec_sol, vec_rhs; /* pointer to where user has stashed
106: the solution and rhs, these are
107: never touched by the code, only
108: passed back to the user */
109: PetscReal *res_hist; /* If !0 stores residual each at iteration */
110: PetscReal *res_hist_alloc; /* If !0 means user did not provide buffer, needs deallocation */
111: PetscCount res_hist_len; /* current entry count of residual history array */
112: PetscCount res_hist_max; /* total entry count of storage in residual history */
113: PetscBool res_hist_reset; /* reset history to length zero for each new solve */
114: PetscReal *err_hist; /* If !0 stores error at each iteration */
115: PetscReal *err_hist_alloc; /* If !0 means user did not provide buffer, needs deallocation */
116: PetscCount err_hist_len; /* current entry count of error history array */
117: PetscCount err_hist_max; /* total entry count of storage in error history */
118: PetscBool err_hist_reset; /* reset history to length zero for each new solve */
120: PetscInt chknorm; /* only compute/check norm if iterations is great than this */
121: PetscBool lagnorm; /* Lag the residual norm calculation so that it is computed as part of the
122: MPI_Allreduce() for computing the inner products for the next iteration. */
124: PetscInt nmax; /* maximum number of right-hand sides to be handled simultaneously */
126: /* --------User (or default) routines (most return -1 on error) --------*/
127: KSPMonitorFn *monitor[MAXKSPMONITORS];
128: PetscCtxDestroyFn *monitordestroy[MAXKSPMONITORS];
129: void *monitorcontext[MAXKSPMONITORS]; /* residual calculation, allows user */
130: PetscInt numbermonitors; /* to, for instance, print residual norm, etc. */
131: PetscBool pauseFinal; /* Pause all drawing monitor at the final iterate */
133: PetscViewer convergedreasonviewer;
134: PetscViewerFormat convergedreasonformat;
135: KSPConvergedReasonViewFn *reasonview[MAXKSPREASONVIEWS]; /* KSP converged reason view */
136: PetscCtxDestroyFn *reasonviewdestroy[MAXKSPREASONVIEWS]; /* optional destroy routine */
137: void *reasonviewcontext[MAXKSPREASONVIEWS]; /* viewer context */
138: PetscInt numberreasonviews; /* current number of reason viewers */
140: KSPConvergenceTestFn *converged;
141: PetscCtxDestroyFn *convergeddestroy;
142: void *cnvP;
144: PetscCtx ctx; /* optional user-defined context */
146: PC pc;
148: void *data; /* holder for misc stuff associated with a particular iterative solver */
150: PetscBool view, viewPre, viewRate, viewMat, viewPMat, viewRhs, viewSol, viewMatExp, viewEV, viewSV, viewEVExp, viewFinalRes, viewPOpExp, viewDScale;
151: PetscViewer viewer, viewerPre, viewerRate, viewerMat, viewerPMat, viewerRhs, viewerSol, viewerMatExp, viewerEV, viewerSV, viewerEVExp, viewerFinalRes, viewerPOpExp, viewerDScale;
152: PetscViewerFormat format, formatPre, formatRate, formatMat, formatPMat, formatRhs, formatSol, formatMatExp, formatEV, formatSV, formatEVExp, formatFinalRes, formatPOpExp, formatDScale;
154: /* ----------------Default work-area management -------------------- */
155: PetscInt nwork;
156: Vec *work;
158: KSPSetUpStage setupstage;
159: PetscBool setupnewmatrix; /* true if we need to call ksp->ops->setup with KSP_SETUP_NEWMATRIX */
161: PetscInt its; /* number of iterations so far computed in THIS linear solve*/
162: PetscInt totalits; /* number of iterations used by this KSP object since it was created */
164: PetscBool transpose_solve; /* PETSC_TRUE applies the set operators transposed; PETSC_FALSE applies them as-is, including for an explicit transpose solve */
165: struct {
166: Mat A, B, AT, BT; /* parent operators, referenced by the KSP, and their explicit transposes */
167: PetscObjectId Aid, Bid; /* IDs detect MatHeaderReplace() on A and B */
168: PetscObjectState Anonzerostate, Bnonzerostate; /* nonzero states of A and B when the transposes were formed */
169: PetscBool solve_requested; /* PETSC_TRUE means KSP[Mat]SolveTranspose() was requested; PETSC_FALSE means KSP[Mat]Solve() was requested */
170: PetscBool use_explicittranspose; /* transpose the system explicitly in KSP[Mat]SolveTranspose() */
171: PetscBool reuse_transpose; /* reuse the previous transposed system */
172: } transpose;
174: KSPNormType normtype; /* type of norm used for convergence tests */
176: PCSide pc_side_set; /* PC type set explicitly by user */
177: KSPNormType normtype_set; /* Norm type set explicitly by user */
179: /* Allow diagonally scaling the matrix before computing the preconditioner or using
180: the Krylov method. Note this is NOT just Jacobi preconditioning */
182: PetscBool dscale; /* diagonal scale system; used with KSPSetDiagonalScale() */
183: PetscBool dscalefix; /* unscale system after solve */
184: PetscBool dscalefix2; /* system has been unscaled */
185: Vec diagonal; /* 1/sqrt(diag of matrix) */
186: Vec truediagonal;
188: /* Allow declaring convergence when negative curvature is detected */
189: PetscBool converged_neg_curve;
191: PetscInt setfromoptionscalled;
192: PetscBool skippcsetfromoptions; /* if set then KSPSetFromOptions() does not call PCSetFromOptions() */
194: /* User-defined pre/post solve callbacks */
195: PetscErrorCode (*presolve)(KSP, Vec, Vec, void *);
196: PetscErrorCode (*postsolve)(KSP, Vec, Vec, void *);
197: void *prectx, *postctx;
199: /* PETSc internal pre/post solve callbacks for Eisenstat and Walker trick */
200: PetscErrorCode (*presolve_ew)(KSP, Vec, Vec, void *);
201: PetscErrorCode (*postsolve_ew)(KSP, Vec, Vec, void *);
202: void *prectx_ew, *postctx_ew;
204: PetscInt nestlevel; /* how many levels of nesting does the KSP have */
205: };
207: typedef struct { /* dummy data structure used in KSPMonitorDynamicTolerance() */
208: PetscReal coef;
209: PetscReal bnrm;
210: } KSPDynTolCtx;
212: typedef struct {
213: PetscBool initialrtol; /* default relative residual decrease is computed from initial residual, not rhs */
214: PetscBool mininitialrtol; /* default relative residual decrease is computed from min of initial residual and rhs */
215: PetscBool convmaxits; /* if true, the convergence test returns KSP_CONVERGED_ITS if the maximum number of iterations is reached */
216: Vec work;
217: } KSPConvergedDefaultCtx;
219: static inline PetscErrorCode KSPLogResidualHistory(KSP ksp, PetscReal norm)
220: {
221: PetscFunctionBegin;
222: PetscCall(PetscObjectSAWsTakeAccess((PetscObject)ksp));
223: if (ksp->res_hist && ksp->res_hist_max > ksp->res_hist_len) ksp->res_hist[ksp->res_hist_len++] = norm;
224: PetscCall(PetscObjectSAWsGrantAccess((PetscObject)ksp));
225: PetscFunctionReturn(PETSC_SUCCESS);
226: }
228: static inline PetscErrorCode KSPLogErrorHistory(KSP ksp)
229: {
230: DM dm;
232: PetscFunctionBegin;
233: PetscCall(PetscObjectSAWsTakeAccess((PetscObject)ksp));
234: PetscCall(KSPGetDM(ksp, &dm));
235: if (dm && ksp->err_hist && ksp->err_hist_max > ksp->err_hist_len) {
236: PetscSimplePointFn *exactSol;
237: void *exactCtx;
238: PetscDS ds;
239: Vec u;
240: PetscReal error;
241: PetscInt Nf;
243: PetscCall(KSPBuildSolution(ksp, NULL, &u));
244: /* TODO Was needed to correct for Newton solution, but I just need to set a solution */
245: //PetscCall(VecScale(u, -1.0));
246: /* TODO Case when I have a solution */
247: if (0) {
248: PetscCall(DMGetDS(dm, &ds));
249: PetscCall(PetscDSGetNumFields(ds, &Nf));
250: PetscCheck(Nf <= 1, PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Cannot handle number of fields %" PetscInt_FMT " > 1 right now", Nf);
251: PetscCall(PetscDSGetExactSolution(ds, 0, &exactSol, &exactCtx));
252: PetscCall(DMComputeL2FieldDiff(dm, 0.0, &exactSol, &exactCtx, u, &error));
253: } else {
254: /* The null solution A 0 = 0 */
255: PetscCall(VecNorm(u, NORM_2, &error));
256: }
257: ksp->err_hist[ksp->err_hist_len++] = error;
258: }
259: PetscCall(PetscObjectSAWsGrantAccess((PetscObject)ksp));
260: PetscFunctionReturn(PETSC_SUCCESS);
261: }
263: static inline PetscScalar KSPNoisyHash_Private(PetscInt xx)
264: {
265: unsigned int x = (unsigned int)xx;
266: x = ((x >> 16) ^ x) * 0x45d9f3b;
267: x = ((x >> 16) ^ x) * 0x45d9f3b;
268: x = ((x >> 16) ^ x);
269: return (PetscScalar)(((PetscInt64)x - 2147483648) * 5.e-10); /* center around zero, scaled about -1. to 1.*/
270: }
272: static inline PetscErrorCode KSPSetNoisy_Private(Mat A, Vec v)
273: {
274: PetscScalar *a;
275: PetscInt n, istart;
276: MatNullSpace nullsp = NULL;
278: PetscFunctionBegin;
279: if (A) PetscCall(MatGetNullSpace(A, &nullsp));
280: PetscCall(VecGetOwnershipRange(v, &istart, NULL));
281: PetscCall(VecGetLocalSize(v, &n));
282: PetscCall(VecGetArrayWrite(v, &a));
283: for (PetscInt i = 0; i < n; ++i) a[i] = KSPNoisyHash_Private(i + istart);
284: PetscCall(VecRestoreArrayWrite(v, &a));
285: if (nullsp) PetscCall(MatNullSpaceRemove(nullsp, v));
286: PetscFunctionReturn(PETSC_SUCCESS);
287: }
289: PETSC_INTERN PetscErrorCode KSPSetUpNorms_Private(KSP, PetscBool, KSPNormType *, PCSide *);
291: PETSC_INTERN PetscErrorCode KSPPlotEigenContours_Private(KSP, PetscInt, const PetscReal *, const PetscReal *);
293: typedef struct _p_DMKSP *DMKSP;
294: typedef struct _DMKSPOps *DMKSPOps;
295: struct _DMKSPOps {
296: KSPCreateOperatorsFn *createoperators;
297: KSPComputeOperatorsFn *computeoperators;
298: KSPComputeRHSFn *computerhs;
299: KSPComputeInitialGuessFn *computeinitialguess;
300: PetscErrorCode (*destroy)(DMKSP *);
301: PetscErrorCode (*duplicate)(DMKSP, DMKSP);
302: };
304: /*S
305: DMKSP - Object held by a `DM` that contains all the callback functions and their contexts needed by a `KSP`
307: Level: developer
309: Notes:
310: Users provides callback functions and their contexts to `KSP` using, for example, `KSPSetComputeRHS()`. These values are stored
311: in a `DMKSP` that is contained in the `DM` associated with the `KSP`. If no `DM` was provided by
312: the user with `KSPSetDM()` it is automatically created by `KSPGetDM()` with `DMShellCreate()`.
314: Users very rarely need to worked directly with the `DMKSP` object, rather they work with the `KSP` and the `DM` they created
316: Multiple `DM` can share a single `DMKSP`, often each `DM` is associated with
317: a grid refinement level. `DMGetDMKSP()` returns the `DMKSP` associated with a `DM`. `DMGetDMKSPWrite()` returns a unique
318: `DMKSP` that is only associated with the current `DM`, making a copy of the shared `DMKSP` if needed (copy-on-write).
320: Developer Notes:
321: It is rather subtle why `DMKSP`, `DMSNES`, and `DMTS` are needed instead of simply storing the user callback functions and contexts in `DM` or `KSP`, `SNES`, or `TS`.
322: It is to support composable solvers such as geometric multigrid. We want, by default, the same callback functions and contexts for all the levels in the computation,
323: but we need to also support different callbacks and contexts on each level. The copy-on-write approach of `DMGetDMKSPWrite()` makes this possible.
325: The `originaldm` inside the `DMKSP` is NOT reference counted (to prevent a reference count loop between a `DM` and a `DMKSP`).
326: The `DM` on which this context was first created is cached here to implement one-way
327: copy-on-write. When `DMGetDMKSPWrite()` sees a request using a different `DM`, it makes a copy of the `TSDM`. Thus, if a user
328: only interacts directly with one level, e.g., using `TSSetIFunction()`, then coarse levels of a multilevel item
329: integrator are built, then the user changes the routine with another call to `TSSetIFunction()`, it automatically
330: propagates to all the levels. If instead, they get out a specific level and set the function on that level,
331: subsequent changes to the original level will no longer propagate to that level.
333: .seealso: [](ch_ts), `KSP`, `KSPCreate()`, `DM`, `DMGetDMKSPWrite()`, `DMGetDMKSP()`, `DMSNES`, `DMTS`, `DMKSPSetComputeOperators()`, `DMKSPGetComputeOperators()`,
334: `DMKSPSetComputeRHS()`, `DMKSPSetComputeInitialGuess()`
335: S*/
336: struct _p_DMKSP {
337: PETSCHEADER(struct _DMKSPOps);
338: void *createoperatorsctx;
339: void *operatorsctx;
340: void *rhsctx;
341: void *initialguessctx;
342: void *data;
344: /* See developer note for `DMKSP` above */
345: DM originaldm;
347: void (*fortran_func_pointers[3])(void); /* Store our own function pointers so they are associated with the DMKSP instead of the DM */
348: };
349: PETSC_EXTERN PetscErrorCode DMGetDMKSP(DM, DMKSP *);
350: PETSC_EXTERN PetscErrorCode DMGetDMKSPWrite(DM, DMKSP *);
351: PETSC_EXTERN PetscErrorCode DMCopyDMKSP(DM, DM);
353: /*
354: These allow the various Krylov methods to apply to either the linear system or its transpose.
355: */
356: static inline PetscErrorCode KSP_RemoveNullSpace(KSP ksp, Vec y)
357: {
358: PetscFunctionBegin;
359: if (ksp->pc_side == PC_LEFT) {
360: Mat A;
361: MatNullSpace nullsp;
363: PetscCall(PCGetOperators(ksp->pc, &A, NULL));
364: PetscCall(MatGetNullSpace(A, &nullsp));
365: if (nullsp) PetscCall(MatNullSpaceRemove(nullsp, y));
366: }
367: PetscFunctionReturn(PETSC_SUCCESS);
368: }
370: static inline PetscErrorCode KSP_RemoveNullSpaceTranspose(KSP ksp, Vec y)
371: {
372: PetscFunctionBegin;
373: if (ksp->pc_side == PC_LEFT) {
374: Mat A;
375: MatNullSpace nullsp;
377: PetscCall(PCGetOperators(ksp->pc, &A, NULL));
378: PetscCall(MatGetTransposeNullSpace(A, &nullsp));
379: if (nullsp) PetscCall(MatNullSpaceRemove(nullsp, y));
380: }
381: PetscFunctionReturn(PETSC_SUCCESS);
382: }
384: static inline PetscErrorCode KSP_MatMult(KSP ksp, Mat A, Vec x, Vec y)
385: {
386: PetscFunctionBegin;
387: if (ksp->transpose_solve) PetscCall(MatMultTranspose(A, x, y));
388: else PetscCall(MatMult(A, x, y));
389: PetscFunctionReturn(PETSC_SUCCESS);
390: }
392: static inline PetscErrorCode KSP_MatMultTranspose(KSP ksp, Mat A, Vec x, Vec y)
393: {
394: PetscFunctionBegin;
395: if (ksp->transpose_solve) PetscCall(MatMult(A, x, y));
396: else PetscCall(MatMultTranspose(A, x, y));
397: PetscFunctionReturn(PETSC_SUCCESS);
398: }
400: static inline PetscErrorCode KSP_MatMultHermitianTranspose(KSP ksp, Mat A, Vec x, Vec y)
401: {
402: PetscFunctionBegin;
403: if (!ksp->transpose_solve) PetscCall(MatMultHermitianTranspose(A, x, y));
404: else {
405: Vec w;
407: PetscCall(VecDuplicate(x, &w));
408: PetscCall(VecCopy(x, w));
409: PetscCall(VecConjugate(w));
410: PetscCall(MatMult(A, w, y));
411: PetscCall(VecDestroy(&w));
412: PetscCall(VecConjugate(y));
413: }
414: PetscFunctionReturn(PETSC_SUCCESS);
415: }
417: static inline PetscErrorCode KSP_PCApply(KSP ksp, Vec x, Vec y)
418: {
419: PetscFunctionBegin;
420: if (ksp->transpose_solve) {
421: PetscCall(PCApplyTranspose(ksp->pc, x, y));
422: PetscCall(KSP_RemoveNullSpaceTranspose(ksp, y));
423: } else {
424: PetscCall(PCApply(ksp->pc, x, y));
425: PetscCall(KSP_RemoveNullSpace(ksp, y));
426: }
427: PetscFunctionReturn(PETSC_SUCCESS);
428: }
430: static inline PetscErrorCode KSP_PCApplyTranspose(KSP ksp, Vec x, Vec y)
431: {
432: PetscFunctionBegin;
433: if (ksp->transpose_solve) {
434: PetscCall(PCApply(ksp->pc, x, y));
435: PetscCall(KSP_RemoveNullSpace(ksp, y));
436: } else {
437: PetscCall(PCApplyTranspose(ksp->pc, x, y));
438: PetscCall(KSP_RemoveNullSpaceTranspose(ksp, y));
439: }
440: PetscFunctionReturn(PETSC_SUCCESS);
441: }
443: static inline PetscErrorCode KSP_PCApplyHermitianTranspose(KSP ksp, Vec x, Vec y)
444: {
445: PetscFunctionBegin;
446: PetscCall(VecConjugate(x));
447: PetscCall(KSP_PCApplyTranspose(ksp, x, y));
448: PetscCall(VecConjugate(x));
449: PetscCall(VecConjugate(y));
450: PetscFunctionReturn(PETSC_SUCCESS);
451: }
453: static inline PetscErrorCode KSP_PCMatApply(KSP ksp, Mat X, Mat Y)
454: {
455: PetscFunctionBegin;
456: if (ksp->transpose_solve) PetscCall(PCMatApplyTranspose(ksp->pc, X, Y));
457: else PetscCall(PCMatApply(ksp->pc, X, Y));
458: PetscFunctionReturn(PETSC_SUCCESS);
459: }
461: static inline PetscErrorCode KSP_PCMatApplyTranspose(KSP ksp, Mat X, Mat Y)
462: {
463: PetscFunctionBegin;
464: if (!ksp->transpose_solve) PetscCall(PCMatApplyTranspose(ksp->pc, X, Y));
465: else PetscCall(PCMatApply(ksp->pc, X, Y));
466: PetscFunctionReturn(PETSC_SUCCESS);
467: }
469: static inline PetscErrorCode KSP_PCApplyBAorAB(KSP ksp, Vec x, Vec y, Vec w)
470: {
471: PetscFunctionBegin;
472: if (ksp->transpose_solve) {
473: PetscCall(PCApplyBAorABTranspose(ksp->pc, ksp->pc_side, x, y, w));
474: PetscCall(KSP_RemoveNullSpaceTranspose(ksp, y));
475: } else {
476: PetscCall(PCApplyBAorAB(ksp->pc, ksp->pc_side, x, y, w));
477: PetscCall(KSP_RemoveNullSpace(ksp, y));
478: }
479: PetscFunctionReturn(PETSC_SUCCESS);
480: }
482: static inline PetscErrorCode KSP_PCApplyBAorABTranspose(KSP ksp, Vec x, Vec y, Vec w)
483: {
484: PetscFunctionBegin;
485: if (ksp->transpose_solve) PetscCall(PCApplyBAorAB(ksp->pc, ksp->pc_side, x, y, w));
486: else PetscCall(PCApplyBAorABTranspose(ksp->pc, ksp->pc_side, x, y, w));
487: PetscFunctionReturn(PETSC_SUCCESS);
488: }
490: PETSC_EXTERN PetscLogEvent KSP_GMRESOrthogonalization;
491: PETSC_EXTERN PetscLogEvent KSP_SetUp;
492: PETSC_EXTERN PetscLogEvent KSP_Solve;
493: PETSC_EXTERN PetscLogEvent KSP_Solve_FS_0;
494: PETSC_EXTERN PetscLogEvent KSP_Solve_FS_1;
495: PETSC_EXTERN PetscLogEvent KSP_Solve_FS_2;
496: PETSC_EXTERN PetscLogEvent KSP_Solve_FS_3;
497: PETSC_EXTERN PetscLogEvent KSP_Solve_FS_4;
498: PETSC_EXTERN PetscLogEvent KSP_Solve_FS_S;
499: PETSC_EXTERN PetscLogEvent KSP_Solve_FS_L;
500: PETSC_EXTERN PetscLogEvent KSP_Solve_FS_U;
501: PETSC_EXTERN PetscLogEvent KSP_SolveTranspose;
502: PETSC_EXTERN PetscLogEvent KSP_MatSolve;
503: PETSC_EXTERN PetscLogEvent KSP_MatSolveTranspose;
505: PETSC_INTERN PetscErrorCode MatGetSchurComplement_Basic(Mat, IS, IS, IS, IS, MatReuse, Mat *, MatSchurComplementAinvType, MatReuse, Mat *);
506: PETSC_INTERN PetscErrorCode PCPreSolveChangeRHS(PC, PetscBool *);
508: /*MC
509: KSPCheckDot - Checks if the result of a dot product used by the corresponding `KSP` contains infinity or NaN. These indicate that the previous
510: application of the preconditioner generated an error. Sets a `KSPConvergedReason` and returns if the `PC` set a `PCFailedReason`.
512: Collective
514: Input Parameter:
515: . ksp - the linear solver `KSP` context.
517: Output Parameter:
518: . beta - the result of the inner product
520: Level: developer
522: Developer Notes:
523: Used to manage returning from `KSP` solvers collectively whose preconditioners have failed, possibly only a subset of MPI processes, in some way
525: It uses the fact that `KSP` piggy-backs the collectivity of certain error conditions on the results of norms and inner products.
527: .seealso: `PCFailedReason`, `KSPConvergedReason`, `KSP`, `KSPCreate()`, `KSPSetType()`, `KSP`, `KSPCheckNorm()`, `KSPCheckSolve()`,
528: `KSPSetErrorIfNotConverged()`
529: M*/
530: #define KSPCheckDot(ksp, beta) \
531: do { \
532: if (PetscIsInfOrNanScalar(beta)) { \
533: PetscCheck(!ksp->errorifnotconverged, PetscObjectComm((PetscObject)ksp), PETSC_ERR_NOT_CONVERGED, "KSPSolve has not converged due to infinity or NaN inner product"); \
534: { \
535: PCFailedReason pcreason; \
536: PetscCall(PCReduceFailedReason(ksp->pc)); \
537: PetscCall(PCGetFailedReason(ksp->pc, &pcreason)); \
538: PetscCall(VecFlag(ksp->vec_sol, pcreason)); \
539: if (pcreason) { \
540: ksp->reason = KSP_DIVERGED_PC_FAILED; \
541: } else { \
542: ksp->reason = KSP_DIVERGED_NANORINF; \
543: } \
544: PetscFunctionReturn(PETSC_SUCCESS); \
545: } \
546: } \
547: } while (0)
549: /*MC
550: KSPCheckNorm - Checks if the result of a norm used by the corresponding `KSP` contains `inf` or `NaN`. These indicate that the previous
551: application of the preconditioner generated an error. Sets a `KSPConvergedReason` and returns if the `PC` set a `PCFailedReason`.
553: Collective
555: Input Parameter:
556: . ksp - the linear solver `KSP` context.
558: Output Parameter:
559: . beta - the result of the norm
561: Level: developer
563: Developer Notes:
564: Used to manage returning from `KSP` solvers collectively whose preconditioners have failed, possibly only a subset of MPI processes, in some way.
566: It uses the fact that `KSP` piggy-backs the collectivity of certain error conditions on the results of norms and inner products.
568: .seealso: `PCFailedReason`, `KSPConvergedReason`, `KSP`, `KSPCreate()`, `KSPSetType()`, `KSP`, `KSPCheckDot()`, `KSPCheckSolve()`,
569: `KSPSetErrorIfNotConverged()`
570: M*/
571: #define KSPCheckNorm(ksp, beta) \
572: do { \
573: if (PetscIsInfOrNanReal(beta)) { \
574: PetscCheck(!ksp->errorifnotconverged, PetscObjectComm((PetscObject)ksp), PETSC_ERR_NOT_CONVERGED, "KSPSolve has not converged due to infinity or NaN norm"); \
575: { \
576: PCFailedReason pcreason; \
577: PetscCall(PCReduceFailedReason(ksp->pc)); \
578: PetscCall(PCGetFailedReason(ksp->pc, &pcreason)); \
579: PetscCall(VecFlag(ksp->vec_sol, pcreason)); \
580: if (pcreason) { \
581: ksp->reason = KSP_DIVERGED_PC_FAILED; \
582: } else { \
583: ksp->reason = KSP_DIVERGED_NANORINF; \
584: } \
585: ksp->rnorm = beta; \
586: PetscFunctionReturn(PETSC_SUCCESS); \
587: } \
588: } \
589: } while (0)
591: PETSC_INTERN PetscErrorCode KSPMonitorMakeKey_Internal(const char[], PetscViewerType, PetscViewerFormat, char[]);
592: PETSC_INTERN PetscErrorCode KSPMonitorRange_Private(KSP, PetscInt, PetscReal *);