PETSc Tutorial - The ACTS Toolkit

More documents

Recommendations

Info

What is PETSc?The Role of PETScDeveloping parallel, nontrivial PDE solvers that deliverhigh performance is still difficult and requiresmonths (or even years) of concentrated effort.PETSc is a toolkit that can ease these difficultiesand reduce the development time, but it is not ablack-box PDE solver, nor a silver bullet.M. Knepley (ANL) Tutorial ACTS ’06 7 / 166
What is PETSc?What is PETSc?A freely available and supported research codeDownload from http://www.mcs.anl.gov/petscFree for everyone, including industrial usersHyperlinked manual, examples, and manual pages for all routinesHundreds of tutorial-style examplesSupport via email: petsc-maint@mcs.anl.govUsable from C, C++, Fortran 77/90, and PythonM. Knepley (ANL) Tutorial ACTS ’06 8 / 166
Page 1 and 2: PETSc TutorialPETSc TeamPresented b
Page 3 and 4: Part IGetting Started with PETScM.
Page 5 and 6: What is PETSc?What I Need From YouT
Page 7 and 8: What is PETSc?How Can We Help?Provi
Page 9: What is PETSc?How Can We Help?Provi
Page 13 and 14: What is PETSc?TimelineActive Develo
Page 15 and 16: What is PETSc?What Can We Handle?PE
Page 17 and 18: Who uses and develops PETSc?Who Use
Page 19 and 20: How can I get PETSc?Downloading PET
Page 21 and 22: How can I get PETSc?Unpacking PETSc
Page 23 and 24: How do I Configure PETSc?Configurin
Page 25 and 26: How do I Configure PETSc?Automatic
Page 27 and 28: Building PETScHow do I Build PETSc?
Page 29 and 30: Exercise 4How do I Build PETSc?Reco
Page 31 and 32: Using MPIHow do I run an example?Th
Page 33 and 34: How do I run an example?Alternative
Page 35 and 36: How do I run an example?Common Moni
Page 37 and 38: Exercise 6How do I run an example?C
Page 39 and 40: Part IICommon PETSc UsageM. Knepley
Page 41 and 42: Debugging PETScInteracting with the
Page 43 and 44: Exercise 1Debugging PETScUse the de
Page 45 and 46: Profiling PETScUsing Stages and Eve
Page 47 and 48: Profiling PETScAdding A Logging Eve
Page 49 and 50: Profiling PETScMatrix Memory Preall
Page 51 and 52: Profiling PETScIndicating Expected
Page 53 and 54: Profiling PETScIndicating Expected
Page 55 and 56: Exercise 2Profiling PETScReturn to
Page 57 and 58: PETSc principles and designPETSc St
Page 59 and 60: PETSc principles and designLevels o
Page 61 and 62:
PETSc principles and designSymmetry
Page 63 and 64:
PETSc principles and designExperime
Page 65 and 66:
CollectivityPETSc principles and de
Page 67 and 68:
PETSc principles and designBasic Pe
Page 69 and 70:
Initial OperationsApplication Integ
Page 71 and 72:
Integration StagesInitial Operation
Page 73 and 74:
ProfilingInitial OperationsUse -log
Page 75 and 76:
Vector AlgebraVector AlgebraWhat ar
Page 77 and 78:
Creating a VectorVector AlgebraVec
Page 79 and 80:
Vector AssemblyVector AlgebraA thre
Page 81 and 82:
Vector AlgebraA Better Way to Set t
Page 83 and 84:
Vector AlgebraWorking With Local Ve
Page 85 and 86:
VecGetArray in F77Vector Algebra#in
Page 87 and 88:
Matrix AlgebraMatrix AlgebraWhat ar
Page 89 and 90:
Matrix AlgebraMatrix PolymorphismTh
Page 91 and 92:
Matrix AlgebraOne Way to Set the El
Page 93 and 94:
Matrix AlgebraA Better Way to Set t
Page 95 and 96:
SolversAlgebraic SolvesExplicit:Fie
Page 97 and 98:
Nonlinear SolversNewton MethodsAlge
Page 99 and 100:
Algebraic Solves3rd Party Solvers i
Page 101 and 102:
More AbstractionsHigher Level Abstr
Page 103 and 104:
Part VAdvanced PETScM. Knepley (ANL
Page 105 and 106:
SNES FunctionNonlinear EquationsThe
Page 107 and 108:
SNES VariantsNonlinear EquationsLin
Page 109 and 110:
Nonlinear EquationsSNES Example: Dr
Page 111 and 112:
Nonlinear EquationsDriven Cavity Re
Page 113 and 114:
What is a DA?Structured GridsDA is
Page 115 and 116:
Creating a DAStructured GridsDACrea
Page 117 and 118:
Structured GridsDA Global Numbering
Page 119 and 120:
DA VectorsStructured GridsThe DA ob
Page 121 and 122:
DA Local FunctionStructured GridsTh
Page 123 and 124:
DA StencilsStructured GridsBoth the
Page 125 and 126:
Structured GridsMapping Between Glo
Page 127 and 128:
Structured GridsDA Example: BratuPe
Page 129 and 130:
Part VIPETSc ExtensibilityM. Kneple
Page 131 and 132:
Linking to PETScExtending the Build
Page 133 and 134:
Extending ClassesAdding an Implemen
Page 135 and 136:
Extending ClassesAdding a New Subty
Page 137 and 138:
Extending ClassesAdding a New TypeS
Page 139 and 140:
Extending ClassesAdding a New TypeT
Page 141 and 142:
Marc Garbey’s ProblemProblem Doma
Page 143 and 144:
Revision 1.1Marc Garbey’s Problem
Page 145 and 146:
Revision 1.6Marc Garbey’s Problem
Page 147 and 148:
Marc Garbey’s ProblemMesh Indepen
Page 149 and 150:
Marc Garbey’s ProblemForcing Func
Page 151 and 152:
Marc Garbey’s ProblemNeumann Solu
Page 153 and 154:
Part VIIIFuture PlansM. Knepley (AN
Page 155 and 156:
PETSc PartsTo make the new function
Page 157 and 158:
Mesh CapabilitiesMesh2D Delaunay ge
Page 159 and 160:
How does Sieve Work?MeshApplication
Page 161 and 162:
Page 163 and 164:
Page 165 and 166:
How does Field Work?MeshApplication
Page 167 and 168:
Page 169 and 170:
Page 171 and 172:
Page 173 and 174:
AdvantagesMeshSieve/Field operation
Page 175 and 176:
Page 177 and 178:
Page 179 and 180:
Page 181 and 182:
MeshWhat is Sieve Good For?Parallel
Page 183 and 184:
Page 185 and 186:
Page 187 and 188:
Page 189 and 190:
Page 191 and 192:
Page 193 and 194:
IntegrationMeshTwo main integration
Page 195 and 196:
Page 197 and 198:
Page 199 and 200:
Sieve and PETScMeshSieve is the uns
Page 201 and 202:
Sieve and PETScMeshSieve is the uns
Page 203 and 204:
Jacobian EvaluationMeshPetscScalar
Page 205 and 206:
Weak Form LanguagesA Language for W
Page 207 and 208:
ExamplesWeak Form LanguagesPoisson
show all

PETSc Tutorial - The ACTS Toolkit

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?