by Chan Chun-hing. / Bibliography: leaves 66-68 / Thesis (M.Ph.)--Chinese University of Hong Kong, 1984

Dissertation (Ph.D.)--Auburn University,2007. / Abstract. Includes bibliographic references (p.99-103).

Thesis (doctoral)--Friedrich-Wilhelms-Universität zu Berlin, 1909. / "Estratto dal tomo XXVIII (2 sem. 1909)del Rendiconti del Circolo matematico di Palermo"--P. 1. Vita.

Inaug.-Diss.-Bonn.

Inaug.-Diss.-Bonn.

Thesis (Ph. D.)--University of Michigan, 1939. / "Reprinted from the American journal of mathematics, vol. LXII, number 2 [1940]."

Thesis (Ph. D.)--University of Michigan, 1939. / "Reprinted from the American journal of mathematics, vol. LXII, number 2 [1940]."

Thèse--La Faculté des sciences de Paris, 1901.

Given an n-vertex graph Gand two positive integers d, k is an element of N, the (d, kn)-differential coloring problem asks for a coloring of the vertices of G(if one exists) with distinct numbers from 1 to kn(treated as colors), such that the minimum difference between the two colors of any adjacent vertices is at least d. While it was known that the problem of determining whether a general graph is (2, n)-differential colorable is NP-complete, our main contribution is a complete characterization of bipartite, planar and outerplanar graphs that admit (2, n)-differential colorings. For practical reasons, we also consider color ranges larger than n, i.e., k > 1. We show that it is NP-complete to determine whether a graph admits a (3, 2n)-differential coloring. The same negative result holds for the (left perpendicular 2n/3 right pendicular, 2n)-differential coloring problem, even in the case where the input graph is planar.

Inverse problems are mathematically and numerically very challenging due to their inherent ill-posedness in the sense that a small perturbation of the data may cause an enormous deviation of the solution. Regularization methods have been established as the standard approach for their stable numerical solution thanks to the ground-breaking work of late Russian mathematician A.N. Tikhonov. However, existing studies mainly focus on general-purpose regularization procedures rather than exploiting mathematical structures of specific problems for designing efficient numerical procedures. Moreover, the stochastic nature of data noise and model uncertainties is largely ignored, and its effect on the inverse solution is not assessed. This thesis attempts to design some problem-specific efficient numerical methods for the Robin inverse problem and to quantify the associated uncertainties. It consists of two parts: Part I discusses deterministic methods for the Robin inverse problem, while Part II studies stochastic numerics for uncertainty quantification of inverse problems and its implication on the choice of the regularization parameter in Tikhonov regularization. / Key Words: Robin inverse problem, variational approach, preconditioning, Modica-Motorla functional, spectral stochastic approach, Bayesian inference approach, augmented Tikhonov regularization method, regularization parameter, uncertainty quantification, reduced-order modeling / Part I considers the variational approach for reconstructing smooth and nonsmooth coefficients by minimizing a certain functional and its discretization by the finite element method. We propose the L2-norm regularization and the Modica-Mortola functional from phase transition for smooth and nonsmooth coefficients, respectively. The mathematical properties of the formulations and their discrete analogues, e.g. existence of a minimizer, stability (compactness), convexity and differentiability, are studied in detail. The convergence of the finite element approximation is also established. The nonlinear conjugate gradient method and the concave-convex procedure are suggested for solving discrete optimization problems. An efficient preconditioner based on the Sobolev inner product is proposed for justifying the gradient descent and for accelerating its convergence. / Part II studies two promising methodologies, i.e. the spectral stochastic approach (SSA) and the Bayesian inference approach, for uncertainty quantification of inverse problems. The SSA extends the variational approach to the stochastic context by generalized polynomial chaos expansion, and addresses inverse problems under uncertainties, e.g. random data noise and stochastic material properties. The well-posedness of the stochastic variational formulation is studied, and the convergence of its stochastic finite element approximation is established. Bayesian inference provides a natural framework for uncertainty quantification of a specific solution by considering an ensemble of inverse solutions consistent with the given data. To reduce its computational cost for nonlinear inverse problems incurred by repeated evaluation of the forward model, we propose two accelerating techniques by constructing accurate and inexpensive surrogate models, i.e. the proper orthogonal decomposition from reduced-order modeling and the stochastic collocation method from uncertainty propagation. By observing its connection with Tikhonov regularization, we propose two functionals of Tikhonov type that could automatically determine the regularization parameter and accurately detect the noise level. We establish the existence of a minimizer, and the convergence of an alternating iterative algorithm. This opens an avenue for designing fully data-driven inverse techniques. / This thesis considers deterministic and stochastic numerics for inverse problems associated with elliptic partial differential equations. The specific inverse problem under consideration is the Robin inverse problem: estimating the Robin coefficient of a Robin boundary condition from boundary measurements. It arises in diverse industrial applications, e.g. thermal engineering and nondestructive evaluation, where the coefficient profiles material properties on the boundary. / Jin, Bangti. / Adviser: Zou Jun. / Source: Dissertation Abstracts International, Volume: 70-06, Section: B, page: 3541. / Thesis (Ph.D.)--Chinese University of Hong Kong, 2008. / Includes bibliographical references (leaves 174-187). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Electronic reproduction. [Ann Arbor, MI] : ProQuest Information and Learning, [200-] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstracts in English and Chinese. / School code: 1307.