ELL
A Problem in an L-shaped Region for FFP_SPARSE

The ELL problem uses the geometry of an L-shaped region. This is an example of how to specify a problem to be solved by FFP_SPARSE.

This mesh, which uses 65 nodes, was created by starting with a crude mesh, and having it refined by TRIANGULATION_REFINE and renumbered by TRIANGULATION_RCM.

• dirichlet_condition.m, the user-supplied routine to evaluate the boundary conditions;
• kcoef.m, the user-supplied routine to evaluate the linear coefficient;
• rhs.m, the user-supplied routine the right hand side;
• ell.out, output from a run of the program;
• ell_nodes.txt, a text file containing a list, for each node, of its X and Y coordinates;
• ell_nodes.png, a PNG image of the nodes;
• ell_triangles.txt, a text file containing a list, for each element, of the three nodes that compose it;
• ell_triangles.png, a PNG image of the element mesh;
• ell_solution.txt, a text file containing the solution U at each node (X,Y);

You can go up one level to the FFP_SPARSE page.