| /petsc/src/ts/impls/symplectic/basicsymplectic/ |
| H A D | basicsymplectic.c | 29 BasicSymplecticScheme scheme; member 97 BasicSymplecticScheme scheme = &link->sch; in TSBasicSymplecticRegisterDestroy() local 99 PetscCall(PetscFree2(scheme->c, scheme->d)); in TSBasicSymplecticRegisterDestroy() 100 PetscCall(PetscFree(scheme->name)); in TSBasicSymplecticRegisterDestroy() 163 BasicSymplecticScheme scheme; in TSBasicSymplecticRegister() local 172 scheme = &link->sch; in TSBasicSymplecticRegister() 173 PetscCall(PetscStrallocpy(name, &scheme->name)); in TSBasicSymplecticRegister() 174 scheme->order = order; in TSBasicSymplecticRegister() 175 scheme->s = s; in TSBasicSymplecticRegister() 176 PetscCall(PetscMalloc2(s, &scheme->c, s, &scheme->d)); in TSBasicSymplecticRegister() [all …]
|
| /petsc/src/ts/impls/implicit/glle/ |
| H A D | glle.c | 106 TSGLLEScheme scheme; in TSGLLESchemeCreate() local 115 PetscCall(PetscNew(&scheme)); in TSGLLESchemeCreate() 116 scheme->p = p; in TSGLLESchemeCreate() 117 scheme->q = q; in TSGLLESchemeCreate() 118 scheme->r = r; in TSGLLESchemeCreate() 119 scheme->s = s; in TSGLLESchemeCreate() 121 …PetscCall(PetscMalloc5(s, &scheme->c, s * s, &scheme->a, r * s, &scheme->b, r * s, &scheme->u, r *… in TSGLLESchemeCreate() 122 PetscCall(PetscArraycpy(scheme->c, c, s)); in TSGLLESchemeCreate() 123 for (j = 0; j < s * s; j++) scheme->a[j] = (PetscAbsScalar(a[j]) < 1e-12) ? 0 : a[j]; in TSGLLESchemeCreate() 124 for (j = 0; j < r * s; j++) scheme->b[j] = (PetscAbsScalar(b[j]) < 1e-12) ? 0 : b[j]; in TSGLLESchemeCreate() [all …]
|
| H A D | glleadapt.c | 222 PetscInt scheme; member
|
| /petsc/src/ts/adapt/interface/ |
| H A D | tsadapt.c | 917 PetscInt scheme = 0; in TSAdaptChoose() local 953 PetscUseTypeMethod(adapt, choose, ts, h, &scheme, next_h, accept, &wlte, &wltea, &wlter); in TSAdaptChoose() 954 …scheme >= 0 && (ncandidates <= 0 || scheme < ncandidates), PetscObjectComm((PetscObject)adapt), PE… in TSAdaptChoose() 956 if (next_sc) *next_sc = scheme; in TSAdaptChoose() 1001 const char *sc_name = (scheme < ncandidates) ? adapt->candidates.name[scheme] : ""; in TSAdaptChoose() 1004 …10.3e\n", ((PetscObject)adapt)->type_name, ((PetscObject)ts)->type_name, scheme, sc_name, ts->step… in TSAdaptChoose() 1007 …%5.3g\n", ((PetscObject)adapt)->type_name, ((PetscObject)ts)->type_name, scheme, sc_name, ts->step… in TSAdaptChoose()
|
| /petsc/doc/manualpages/MANSECHeaders/ |
| H A D | SNES | 4 easy-to-use interface to Newton-type, quasi-Newton, full approximation scheme (FAS) multigrid, and …
|
| /petsc/src/ts/tests/output/ |
| H A D | ex26_arkimex_explicit_stage.out | 3 [0]PETSC ERROR: This scheme requires an identity mass matrix, however the TSIFunctionFn you provide…
|
| /petsc/doc/changes/ |
| H A D | 34.md | 15 consistent scheme: -xxx_view 82 by a more general systematic scheme of -vec_view 115 general systematic scheme of -mat_view [ascii,binary,draw, or
|
| H A D | 31.md | 130 Runge-Kutta scheme.
|
| H A D | 38.md | 132 - Added TSRK5BS scheme to TSRK.
|
| /petsc/share/petsc/datafiles/meshes/ |
| H A D | testcase3D.cas | 200 (wetsteam/scheme 0) 344 (inert/scheme 1) 367 (premix-g-var/scheme 1) 386 (premix-g-eqn/scheme 1) 446 (ecfm-sigma/scheme 1) 483 (ignition/scheme 1) 1186 (tvar/scheme 1) 1250 (soot-mom/scheme 1) 1301 (sootspecies/scheme 1) 1318 (pollutant/scheme (1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1)) [all …]
|
| /petsc/doc/manual/ |
| H A D | ts.md | 398 …ility properties (IM), stiff accuracy (SA), the existence of an embedded scheme, and dense output … 527 … stages, the scheme order and stage order, the implicit stability properties (IM), stiff accuracy … 895 available methods are the $5$th-order Fehlberg RK scheme with a 897 $5$th-order Dormand-Prince RK scheme with a $4$th-order 899 RK scheme with a $4$th-order embedded method (`TSRK5BS`, and 906 scheme, `TSRK3` - $3$rd-order, $3$-stage RK scheme, 907 `TSRK4` - $4$-th order, $4$-stage RK scheme). 1341 A so-called checkpointing scheme is needed to solve this problem. The 1342 scheme stores checkpoints at selective time steps and recomputes the 1352 checkpointing scheme that uses both RAM and disk for storage. This [all …]
|
| H A D | dmstag.md | 67 Crucially, this global indexing scheme does not include any "ghost" or "padding" unknowns outside t… 154 Global numbering scheme for a 2D `DMSTAG` object with one DOF per stratum. Note that the numbering … 160 Local numbering scheme on rank 1 (Cf. {numref}`figure_dmstag_local_global`) for a 2D `DMSTAG` objec…
|
| H A D | vec.md | 1063 a local numbering scheme to the PETSc global numbering scheme, recall their use above for the routi… 1081 mapping from a local numbering scheme (including ghost points) to a 1082 global numbering scheme, while in the latter, they provide a mapping 1086 relationship to parallel processing, etc.) to the PETSc ordering scheme 1089 each process, one works with a local numbering scheme that includes 1090 ghost points. The mapping from this local numbering scheme back to the
|
| H A D | dmplex.md | 124 Plex allows you to represent periodic domains is two ways. Using the default scheme, periodic topol… 126 For the default scheme, a call to `DMLocalizeCoordinates()` (which usually happens automatically on…
|
| H A D | getting_started.md | 903 The abstract class `TS` can embody any ODE/DAE integrator scheme. 904 …E/DAE IMEX integrator, whose type name is `TSARKIMEX`, using a 3rd-order scheme with an L-stable i…
|
| H A D | tao.md | 1197 interpolation scheme found in {cite}`cgt`, is the default. 1198 This scheme performs a number of function and gradient evaluations to 1472 interpolation scheme found in {cite}`cgt`, is the default. 1473 This scheme performs a number of function and gradient evaluations to
|
| H A D | profiling.md | 5 PETSc includes a consistent, lightweight scheme for profiling
|
| H A D | other.md | 228 PETSc employs a consistent scheme for examining, printing, and saving
|
| H A D | snes.md | 952 iterative scheme. In comparison with using direct methods for solving
|
| /petsc/share/petsc/matlab/ |
| H A D | laplacian.m | 8 % standard 7-point finite-difference scheme, The grid size is always 28 % It uses the standard 5-point scheme for 2D, and 3-point scheme for 1D.
|
| /petsc/src/binding/petsc4py/src/petsc4py/PETSc/ |
| H A D | TS.pyx | 282 """Set the type of the *Runge-Kutta* scheme. 289 The type of scheme. 293 ``-ts_rk_type`` sets scheme type from the commandline. 305 """Set the type of `Type.ARKIMEX` scheme. 312 The type of `Type.ARKIMEX` scheme. 316 ``-ts_arkimex_type`` sets scheme type from the commandline. 377 """Return the `Type.RK` scheme. 391 """Return the `Type.ARKIMEX` scheme. 405 """Set the type of `Type.DIRK` scheme. 412 The type of `Type.DIRK` scheme. [all …]
|
| /petsc/src/ksp/pc/impls/ml/ |
| H A D | ml.c | 965 const char *scheme[] = {"Uncoupled", "Coupled", "MIS", "METIS"}; in PCSetFromOptions_ML() local 988 …e", "Aggregate Coarsen Scheme", "ML_Aggregate_Set_CoarsenScheme_*", scheme, 4, scheme[0], &indx, N… in PCSetFromOptions_ML()
|
| /petsc/doc/developers/ |
| H A D | testing.md | 957 arguments are the ones that cause a code crash. The default naming scheme is
|
| /petsc/doc/community/meetings/2023/ |
| H A D | index.md | 404 with a fully implicit DIRK scheme. The full algorithm exactly preserves the
|
| /petsc/doc/tutorials/physics/ |
| H A D | guide_to_stokes.md | 57 …points, given the values of the fields and their derivatives. The entire scheme is detailed in {ci…
|