From bcd2f8f30ab4be2686523d94a1ca46a6bdbb0a2c Mon Sep 17 00:00:00 2001 From: kolev1 Date: Tue, 6 Oct 2009 19:49:47 +0000 Subject: [PATCH] Updated the documentation to make clear that we are solving -Delta u = 1 with u = 0 on the boundary. --- examples/ex10.cxx | 17 +++++++++-------- examples/ex3.c | 19 ++++++++++--------- 2 files changed, 19 insertions(+), 17 deletions(-) diff --git a/examples/ex10.cxx b/examples/ex10.cxx index 824db6bc3..475d0095b 100644 --- a/examples/ex10.cxx +++ b/examples/ex10.cxx @@ -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 diff --git a/examples/ex3.c b/examples/ex3.c index 7b63366b2..a131dc6ae 100644 --- a/examples/ex3.c +++ b/examples/ex3.c @@ -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