Two topologies (Z,L) and (Z,L1) for the family of the non-degenerate convex curves in the projective plane are considered, where (Z,L) is the topology from the Lane's neighborhood system and (Z,L1) is the topology from the parabolic neighborhood system. It is shown that the definition of convexity in the affine plane can be extended to the projective plane so that the Blaschke selection theorem remains true for the projective convex sets. With the help of this theorem, the topological space (Z,L) is compactified by adding Lane's compactifying elements. Furthermore, it is shown that (Z,L) is metrizable but (Z,L1) is not metrizable. The Lane's topology (X,L), as a subspace of (Z,L) for the non-degenerate conics, is both metrizable and separable. A subspace (X,τ) of (Z,L1) is studied which is metrizable but not separable. / Science, Faculty of / Mathematics, Department of / Graduate

The work selects a specific issue from the numerical analysis of optimal control problems. We investigate a linear-quadratic optimal control problem based on a partial differential equation on 3-dimensional non-convex domains. Based on efficient solution methods for the partial differential equation an algorithm known from control theory is applied. Now the main objectives are to prove that there is no degradation in efficiency and to verify the result by numerical experiments. We describe a solution method which has second order convergence, although the intermediate control approximations are piecewise constant functions. This superconvergence property is gained from a special projection operator which generates a piecewise constant approximation that has a supercloseness property, from a sufficiently graded mesh which compensates the singularities introduced by the non-convex domain, and from a discretization condition which eliminates some pathological cases. Both isotropic and anisotropic discretizations are investigated and similar superconvergence properties are proven. A model problem is presented and important results from the regularity theory of solutions to partial differential equation in non-convex domains have been collected in the first chapters. Then a collection of statements from the finite element analysis and corresponding numerical solution strategies is given. Here we show newly developed tools regarding error estimates and projections into finite element spaces. These tools are necessary to achieve the main results. Known fundamental statements from control theory are applied to the given model problems and certain conditions on the discretization are defined. Then we describe the implementation used to solve the model problems and present all computed results.

The work selects a specific issue from the numerical analysis of optimal control problems. We investigate a linear-quadratic optimal control problem based on a partial differential equation on 3-dimensional non-convex domains. Based on efficient solution methods for the partial differential equation an algorithm known from control theory is applied. Now the main objectives are to prove that there is no degradation in efficiency and to verify the result by numerical experiments. We describe a solution method which has second order convergence, although the intermediate control approximations are piecewise constant functions. This superconvergence property is gained from a special projection operator which generates a piecewise constant approximation that has a supercloseness property, from a sufficiently graded mesh which compensates the singularities introduced by the non-convex domain, and from a discretization condition which eliminates some pathological cases. Both isotropic and anisotropic discretizations are investigated and similar superconvergence properties are proven. A model problem is presented and important results from the regularity theory of solutions to partial differential equation in non-convex domains have been collected in the first chapters. Then a collection of statements from the finite element analysis and corresponding numerical solution strategies is given. Here we show newly developed tools regarding error estimates and projections into finite element spaces. These tools are necessary to achieve the main results. Known fundamental statements from control theory are applied to the given model problems and certain conditions on the discretization are defined. Then we describe the implementation used to solve the model problems and present all computed results.