Discontinuous Galerkin Method Applied to Navier-Stokes Equations

Discontinuous Galerkin (DG) finite element methods are becoming important techniques for the computational solution of many real-world problems describe by differential equations. They combine many attractive features of the finite element and the finite volume methods. These methods have been successfully applied to many important PDEs arising from a wide range of applications. DG methods are highly accurate numerical methods and have considerable advantages over the classical numerical methods available in the literature. DG methods can easily handle meshes with hanging nodes, elements of various types and shapes, and local spaces of different orders. Furthermore, DG methods provide accurate and efficient simulation of physical and engineering problems, especially in settings where the solutions exhibit poor regularity. For these reasons, they have attracted the attention of many researchers working in diverse areas, from computational fluid dynamics, solid mechanics and optimal control, to finance, biology and geology. In this talk, we give an overview of the main features of DG methods and their extensions. We first introduce the DG method for solving classical differential equations. Then, we extend the methods to other equations such as Navier-Stokes equations. The Navier-Stokes equations are useful because they describe the physics of many phenomena of scientific and engineering interest. They may be used to model the weather, ocean currents, water flow in a pipe and air flow around a wing

Adaptive Wavelet Methods for Inverse Problems: Acceleration Strategies, Adaptive Rothe Method and Generalized Tensor Wavelets

In general, inverse problems can be described as the task of inferring conclusions about the cause u from given observations y of its effect. This can be described as the inversion of an operator equation K(u) = y, which is assumed to be ill-posed or ill-conditioned. To arrive at a meaningful solution in this setting, regularization schemes need to be applied. One of the most important regularization methods is the so called Tikhonov regularization. As an approximation to the unknown truth u it is possible to consider the minimizer v of the sum of the data error K(v)-y (in a certain norm) and a weighted penalty term F(v). The development of efficient schemes for the computation of the minimizers is a field of ongoing research and a central Task in this thesis. Most computation schemes for v are based on some generalized gradient descent approach. For problems with weighted lp-norm penalty terms this typically leads to iterated soft shrinkage methods. Without additional assumptions the convergence of these iterations is only guaranteed for subsequences, and even then only to stationary points. In general, stationary points of the minimization problem do not have any regularization properties. Also, the basic iterated soft shrinkage algorithm is known to converge very poorly in practice. This is critical as each iteration step includes the application of the nonlinear operator K and the adjoint of its derivative. This in itself may already be numerically demanding. This thesis is concerned with the development of strategies for the fast computation of the solution of inverse problems with provable convergence rates. In particular, the application and generalization of efficient numerical schemes for the treatment of the arising nonlinear operator equations is considered. The first result of this thesis is a general acceleration strategy for the iterated soft thresholding iteration to compute the solution of the inverse problem. It is based on a decreasing strategy for the weights of the penalty term. The new method converges with linear rate to a global minimizer. A very important class of inverse problems are parameter identification problems for partial differential equations. As a prototype for this class of problems the identification of parameters in a specific parabolic partial differential equation is investigated. The arising operators are analyzed, the applicability of Tikhonov Regularization is proven and the parameters in a simplified test equation are reconstructed. The parabolic differential equations are solved by means of the so called horizontal method of lines, also known as Rothes method. Here the parabolic problem is interpreted as an abstract Cauchy problem. It is discretized in time by means of an implicit scheme. This is combined with a discretization of the resulting system of spatial problems. In this thesis the application of adaptive discretization schemes to solve the spatial subproblems is investigated. Such methods realize highly nonuniform discretizations. Therefore, they tend to require much less degrees of freedom than classical discretization schemes. To ensure the convergence of the resulting inexact Rothe method, a rigorous convergence proof is given. In particular, the application of implementable asymptotically optimal adaptive methods, based on wavelet bases, is considered. An upper bound for the degrees of freedom of the overall scheme that are needed to adaptively approximate the solution up to a prescribed tolerance is derived. As an important case study, the complexity of the approximate solution of the heat equation is investigated. To this end a regularity result for the spatial equations that arise in the Rothe method is proven. The rate of convergence of asymptotically optimal adaptive methods deteriorates with the spatial dimension of the problem. This is often called the curse of dimensionality. One way to avoid this problem is to consider tensor wavelet discretizations. Such discretizations lead to dimension independent convergence rates. However, the classical tensor wavelet construction is limited to domains with simple product geometry. Therefor, in this thesis, a generalized tensor wavelet basis is constructed. It spans a range of Sobolev spaces over a domain with a fairly general geometry. The construction is based on the application of extension operators to appropriate local bases on subdomains that form a non-overlapping domain decomposition. The best m-term approximation of functions with the new generalized tensor product basis converges with a rate that is independent of the spatial dimension of the domain. For two- and three-dimensional polytopes it is shown that the solution of Poisson type problems satisfies the required regularity condition. Numerical tests show that the dimension independent rate is indeed realized in practice

Bayesian Gaussian Process Models: PAC-Bayesian Generalisation Error Bounds and Sparse Approximations

Non-parametric models and techniques enjoy a growing popularity in the field of machine learning, and among these Bayesian inference for Gaussian process (GP) models has recently received significant attention. We feel that GP priors should be part of the standard toolbox for constructing models relevant to machine learning in the same way as parametric linear models are, and the results in this thesis help to remove some obstacles on the way towards this goal. In the first main chapter, we provide a distribution-free finite sample bound on the difference between generalisation and empirical (training) error for GP classification methods. While the general theorem (the PAC-Bayesian bound) is not new, we give a much simplified and somewhat generalised derivation and point out the underlying core technique (convex duality) explicitly. Furthermore, the application to GP models is novel (to our knowledge). A central feature of this bound is that its quality depends crucially on task knowledge being encoded faithfully in the model and prior distributions, so there is a mutual benefit between a sharp theoretical guarantee and empirically well-established statistical practices. Extensive simulations on real-world classification tasks indicate an impressive tightness of the bound, in spite of the fact that many previous bounds for related kernel machines fail to give non-trivial guarantees in this practically relevant regime. In the second main chapter, sparse approximations are developed to address the problem of the unfavourable scaling of most GP techniques with large training sets. Due to its high importance in practice, this problem has received a lot of attention recently. We demonstrate the tractability and usefulness of simple greedy forward selection with information-theoretic criteria previously used in active learning (or sequential design) and develop generic schemes for automatic model selection with many (hyper)parameters. We suggest two new generic schemes and evaluate some of their variants on large real-world classification and regression tasks. These schemes and their underlying principles (which are clearly stated and analysed) can be applied to obtain sparse approximations for a wide regime of GP models far beyond the special cases we studied here

NASA thesaurus. Volume 1: Hierarchical Listing

There are over 17,000 postable terms and nearly 4,000 nonpostable terms approved for use in the NASA scientific and technical information system in the Hierarchical Listing of the NASA Thesaurus. The generic structure is presented for many terms. The broader term and narrower term relationships are shown in an indented fashion that illustrates the generic structure better than the more widely used BT and NT listings. Related terms are generously applied, thus enhancing the usefulness of the Hierarchical Listing. Greater access to the Hierarchical Listing may be achieved with the collateral use of Volume 2 - Access Vocabulary and Volume 3 - Definitions

NASA Thesaurus. Volume 1: Hierarchical listing

There are 16,713 postable terms and 3,716 nonpostable terms approved for use in the NASA scientific and technical information system in the Hierarchical Listing of the NASA Thesaurus. The generic structure is presented for many terms. The broader term and narrower term relationships are shown in an indented fashion that illustrates the generic structure better than the more widely used BT and NT listings. Related terms are generously applied, thus enhancing the usefulness of the Hierarchical Listing. Greater access to the Hierarchical Listing may be achieved with the collateral use of Volume 2 - Access Vocabulary

Commonwealth of Independent States aerospace science and technology, 1992: A bibliography with indexes

This bibliography contains 1237 annotated references to reports and journal articles of Commonwealth of Independent States (CIS) intellectual origin entered into the NASA Scientific and Technical Information System during 1992. Representative subject areas include the following: aeronautics, astronautics, chemistry and materials, engineering, geosciences, life sciences, mathematical and computer sciences, physics, social sciences, and space sciences

NASA Thesaurus. Volume 1: Alphabetical listing

The NASA Thesaurus -- Volume 1, Alphabetical Listing -- contains all subject terms (postable and nonpostable) approved for use in the NASA scientific and technical information system. Included are the subject terms of the Preliminary Edition of the NASA Thesaurus (NASA SP-7030, December 1967); of the NASA Thesaurus Alphabetical Update (NASA SP-7040, September 1971); and terms approved, added or changed through May 31, 1975. Thesaurus structuring, including scope notes, a generic structure with broader-term/narrower-term (BT-NT) relationships displayed in embedded hierarchies, and other cross references, is provided for each term, as appropriate

NASA Thesaurus. Volume 2: Access vocabulary

The NASA Thesaurus -- Volume 2, Access Vocabulary -- contains an alphabetical listing of all Thesaurus terms (postable and nonpostable) and permutations of all multiword and pseudo-multiword terms. Also included are Other Words (non-Thesaurus terms) consisting of abbreviations, chemical symbols, etc. The permutations and Other Words provide 'access' to the appropriate postable entries in the Thesaurus