CFD/hypre
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Updated the documentation to make clear that we are solving -Delta u = 1

Browse Source 
with u = 0 on the boundary.
This commit is contained in:
kolev1 2009-10-06 19:49:47 +00:00
parent 2de33213b3
commit bcd2f8f30a
2 changed files with 19 additions and 17 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

17
examples/ex10.cxx
View File

@ -10,14 +10,15 @@
To see options: ex10 -help
Description: This code solves a system corresponding to a discretization
of the Laplace equation with zero boundary conditions on the
unit square. The domain is split into a n x n grid of
quadrilateral elements and each processors owns a horizontal
strip of size m x n, where m = n/nprocs. We use bilinear
finite element discretization, so there are nodes (vertices)
that are shared between neighboring processors. The Finite
Element Interface is used to assemble the matrix and solve
the problem. Nine different solvers are available.
of the Laplace equation -Delta u = 1 with zero boundary
conditions on the unit square. The domain is split into
a n x n grid of quadrilateral elements and each processors
owns a horizontal strip of size m x n, where m = n/nprocs. We
use bilinear finite element discretization, so there are
nodes (vertices) that are shared between neighboring
processors. The Finite Element Interface is used to assemble
the matrix and solve the problem. Nine different solvers are
available.
*/
#include <math.h>

19
examples/ex3.c
View File

@ -10,15 +10,16 @@
To see options: ex3 -help
Description: This code solves a system corresponding to a discretization
of the Laplace equation with zero boundary conditions on the
unit square. The domain is split into an N x N processor grid.
Thus, the given number of processors should be a perfect square.
Each processor's piece of the grid has n x n cells with n x n
nodes connected by the standard 5-point stencil. Note that the
struct interface assumes a cell-centered grid, and, therefore,
the nodes are not shared. This example demonstrates more
features than the previous two struct examples (Example 1 and
Example 2). Two solvers are available.
of the Laplace equation -Delta u = 1 with zero boundary
conditions on the unit square. The domain is split into
an N x N processor grid. Thus, the given number of processors
should be a perfect square. Each processor's piece of the
grid has n x n cells with n x n nodes connected by the
standard 5-point stencil. Note that the struct interface
assumes a cell-centered grid, and, therefore, the nodes are
not shared. This example demonstrates more features than the
previous two struct examples (Example 1 and Example 2). Two
solvers are available.
To incorporate the boundary conditions, we do the following:
Let x_i and x_b be the interior and boundary parts of the