2/14/2024 0 Comments Doxygen equationsDo not solve equations, but rather compute the value of pi to high accuracy. Keywords: TensorFunction, WorkStream::run(), SolverGMRES Linear advection equation, assembling the system of equations in parallel using multi-threading, implementing a refinement criterion based on a finite difference approximation of the gradient. The solution is vector-valued and the equations form a system with as many equations as the dimension of the space in which it is posed. The elasticity equations will be solved instead of Laplace's equation. Keywords: FEFaceValues, VectorTools::integrate_difference(), VectorTools::compute_global_error(), TableHandler Computing the error between exact and numerical solution and output of the data in tables. Verification of correctness of computed solutions. Non-homogeneous Neumann boundary conditions and boundary integrals. Keywords: DoFTools::make_hanging_node_constraints(), AffineConstraints::distribute_local_to_global(), KellyErrorEstimator, GridRefinement::refine_and_coarsen_fixed_number() Catching exceptions in the main function. Keywords: PreconditionSSOR, GridIn, SphericalManifoldĪdaptive local refinement. Preconditioning the CG solver for the linear system of equations. Non-constant coefficient in the elliptic operator (yielding the extended Poisson equation). Keywords: VectorTools::point_value(), VectorTools::compute_mean_value()Ĭomputations on successively refined grids. This example is programmed in a way that it is independent of the dimension for which we want to solve Laplace's equation we will solve the equation in 2D and 3D, although the program is exactly the same. Keywords: FEValues, VectorTools::interpolate_boundary_values(), MatrixTools::apply_boundary_values(), SolverCG, Vector, SparseMatrix, DataOut Keywords: FE_Q, DynamicSparsityPattern, DoFTools::make_sparsity_pattern(), DoFHandler::distribute_dofs(), DoFRenumbering, SparsityPatternĪctually solve Laplace's problem. clusters nonzero entries around the diagonal. Show that renumbering reduces the bandwidth of matrices significantly, i.e. Keywords: Triangulation, GridGenerator::hyper_cube(), GridGenerator::hyper_shell(), GridOut, Triangulation::execute_coarsening_and_refinement()Īssociate degrees of freedom to each vertex and compute the resulting sparsity pattern of matrices. Tutorial programs listed by number step-1Ĭreating a grid. This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead. If you hover your mouse pointer over a box, a brief description of the program should appear. Click on any of the boxes to go to one of the programs. The following graph shows the connections between tutorial programs and how their major components build on each other. More, often more complex but less well documented, deal.II-based programs than the ones that form the tutorial can also be found in the The deal.II code gallery. Note Some of the tutorial programs also jointly form the geodynamics demonstration suite. The CMakeLists.txt files in the different directories are based on the autopilot style CMakeLists.txt example. The latter command also compiles the program if that has not already been done. , build it via make and run it using make run. After compiling the library itself, if you go into one of the tutorial directories, you can configure the program by typing cmake. The programs are in the examples/ directory of your local deal.II installation. You can browse the available tutorial programsĪs a graph that shows how the major concepts of each tutorial programs builds on previous ones (though each program may also use minor pieces from other programs not specifically connected in the graph).Īs a list that provides a short synopsis of each program.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |