Thesis (M.S.)--Virginia Polytechnic Institute, 1966. / Vita. Abstract. Includes bibliographical references (leaf 42). Also available via the Internet.

Let Ω be an arbitrary open set in IR³. Let || • || denote the L²(Ω) norm, and let [formula omitted] denote the completion of [formula omitted] in the Dirichlet norm || ∇•||. The pointwise bound [forumula omitted] is established for all functions [formula omitted] with Δ u є L² (Ω). The constant [formula omitted] is shown to be the best possible. Previously, inequalities of this type were proven only for bounded smooth domains or convex domains, with constants depending on the regularity of the boundary. A new method is employed to obtain this sharp inequality. The key idea is to estimate the maximum value of the quotient ⃒u(x)⃒/ || ∇u || ½ || Δ u || ½, where the point x is fixed, and the function u varies in the span of a finite number of eigenfunctions of the Laplacian. This method admits generalizations to other elliptic operators and other domains. The inequality is applied to study the initial-boundary value problem for Burgers' equation: [formula omitted] in arbitrary domains, with initial data in [formula omitted]. New a priori estimates are obtained. Adapting and refining known theory for Navier-Stokes equations, the existence and uniqueness of bounded smooth solutions are established. As corollaries of the inequality and its proof, pointwise bounds are given for eigenfunctions of the Laplacian in terms of the corresponding eigenvalues in two- and three-dimensional domains. / Science, Faculty of / Mathematics, Department of / Graduate

Thesis (M.S.)--Worcester Polytechnic Institute. / Keywords: heterostructure; semiconductor; quantum engineering; self consistency. Includes bibliographical references (p. 30-33).

by Fan Xuqian. / "August 2004." / Thesis (Ph.D.)--Chinese University of Hong Kong, 2004. / Includes bibliographical references (p. 84-87). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Mode of access: World Wide Web. / Abstracts in English and Chinese.

Thesis (Ph.D.)--University of Missouri-Columbia, 2005. / The entire dissertation/thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file (which also appears in the research.pdf); a non-technical general description, or public abstract, appears in the public.pdf file. Title from title screen of research.pdf file viewed on (January 25, 2007) Vita. Includes bibliographical references.

Thesis (Ph. D.)--Michigan State University. Applied Mathematics, 2008. / Title from PDF t.p. (viewed on July 8, 2009) Includes bibliographical references (p. 123-131). Also issued in print.

As finite element discretizations ever grow in size to address real-world problems, there is an increasing need for fast algorithms. Nowadays there are many GPU/CPU parallel approaches to solve such problems. Multigrid methods can be used to solve large-scale problems, or even better they can be used to precondition the conjugate gradient method, yielding better results in general. Capabilities of multigrid algorithms rely on the effectiveness of the inter-grid transfer operators. In this thesis we focus on the aggregation approach, discussing how different aggregation strategies affect the convergence rate. Based on these discussions, we propose an alternative parallel aggregation algorithm to improve convergence. We also provide numerous experimental results that compare different aggregation approaches, multigrid methods, and conjugate gradient iteration counts, showing that our proposed algorithm performs better in serial and parallel. / Modeling real-world problems incurs a high computational cost because these mathematical models involve large-scale data manipulation. Thus we need fast and efficient algorithms. Nowadays there are many high-performance approaches for these problems. One such method is called the Multigrid algorithm. This approach models a physical domain using a hierarchy of grids, and so the effectiveness of these approaches relies on how well data can be transferred from grid to grid. In this thesis, we focus on the aggregation approach, which clusters a grid’s vertices according to its connections. We also provide an alternative parallel aggregation algorithm to give a faster solution. We show numerous experimental results that compare different aggregation approaches and multigrid methods, showing that our proposed algorithm performs better in serial and parallel than other popular implementations.

Yes / The Poisson's equation is an essential entity of applied mathematics for modelling many phenomena of importance. They include the theory of gravitation, electromagnetism, fluid flows and geometric design. In this regard, finding efficient solution methods for the Poisson's equation is a significant problem that requires addressing. In this paper, we show how it is possible to generate approximate solutions of the Poisson's equation subject to various boundary conditions. We make use of the discrete finite difference operator, which, in many ways, is similar to the standard finite difference method for numerically solving partial differential equations. Our approach is based upon the Laplacian averaging operator which, as we show, can be elegantly applied over many folds in a computationally efficient manner to obtain a close approximation to the solution of the equation at hand. We compare our method by way of examples with the solutions arising from the analytic variants as well as the numerical variants of the Poisson's equation subject to a given set of boundary conditions. Thus, we show that our method, though simple to implement yet computationally very efficient, is powerful enough to generate approximate solutions of the Poisson's equation. / Supported by the European Union’s Horizon 2020 Programme H2020-MSCA-RISE-2017, under the project PDE-GIR with grant number 778035.

Small-deflection plate equations are presented in terms of the midplane plate deformations and the temperature distribution within the plate, which is assumed independent of the plate deformation. The plate boundary conditions are presented in a general form and are suitable for solutions involving either fixed, free, or hinged edge conditions. The temperature distribution within the plate is assumed to be governed by Poisson's equation and a specified temperature distribution over the surfaces of the plate. Solutions for the temperature distribution are given in terms of a power series with respect to the plate thickness coordinate, the coefficients of which are dependent on the midplane temperature distribution and the midplane temperature gradient in the plate thickness direction. Out-of-plane plate deformations are discussed for plates with fixed edges. Discussions of plate deformations are also presented in which the temperature distributions result from constant heat generation within the plate and from radiation absorption. / Master of Science

"We develop a selfconsistent solution of the Schroedinger and Poisson equations in semiconductor heterostructures with arbitrary doping profiles and layer geometries. An algorithm for this nonlinear problem is presented in a multiband k.P framework for the electronic band structure using the finite element method. The discretized functional integrals associated with the Schroedinger and Poisson equations are used in a variational approach. The finite element formulation allows us to evaluate functional derivatives needed to linearize Poisson’s equation in a natural manner. Illustrative examples are presented using a number of heterostructures including single quantum wells, an asymmetric double quantum well, p-i-n-i superlattices and trilayer superlattices."