Computational Comparison of Continuous and Discontinuous Galerkin Time-Stepping Methods for Nonlinear Initial Value Problems

This article centers on the computational performance of the continuous and discontinuous Galerkin time stepping schemes for general first-order initial value problems in R n , with continuous nonlinearities. We briefly review a recent existence result for discrete solutions from [6], and provide a numerical comparison of the two time discretization methods.

A boundary value problem approach to too-short arc optical track association

Given a short-arc optical observation with estimated angle-rates, the admissible region is a compact region in the range / range-rate space defined such that all likely and relevant orbits are contained within it. An alternative boundary value problem formulation has recently been proposed where range / range hypotheses are generated with two angle measurements from two tracks as input. In this paper, angle-rate information is reintroduced as a means to eliminate hypotheses by bounding their constants of motion before a more computationally costly Lambert solver or differential correction algorithm is run.

Essential spectrum of systems of singular differential equations

In this paper we develop a new method to determine the essential spectrum of coupled systems of singular differential equations. Applications to problems from magnetohydrodynamics and astrophysics are given.

Fully Adaptive Newton--Galerkin Methods for Semilinear Elliptic Partial Differential Equations

In this paper we develop an adaptive procedure for the numerical solution of general, semilinear elliptic problems with possible singular perturbations. Our approach combines both prediction-type adaptive Newton methods and a linear adaptive finite element discretization (based on a robust a posteriori error analysis), thereby leading to a fully adaptive Newton–Galerkin scheme. Numerical experiments underline the robustness and reliability of the proposed approach for various examples

Demographic model of the Swiss cattle population for the years 2009-2011 stratified by gender, age and production type

Demographic composition and dynamics of animal and human populations are important determinants for the transmission dynamics of infectious disease and for the effect of infectious disease or environmental disasters on productivity. In many circumstances, demographic data are not available or of poor quality. Since 1999 Switzerland has been recording cattle movements, births, deaths and slaughter in an animal movement database (AMD). The data present in the AMD offers the opportunity for analysing and understanding the dynamic of the Swiss cattle population. A dynamic population model can serve as a building block for future disease transmission models and help policy makers in developing strategies regarding animal health, animal welfare, livestock management and productivity. The Swiss cattle population was therefore modelled using a system of ordinary differential equations. The model was stratified by production type (dairy or beef), age and gender (male and female calves: 0-1 year, heifers and young bulls: 1-2 years, cows and bulls: older than 2 years). The simulation of the Swiss cattle population reflects the observed pattern accurately. Parameters were optimized on the basis of the goodness-of-fit (using the Powell algorithm). The fitted rates were compared with calculated rates from the AMD and differed only marginally. This gives confidence in the fitted rates of parameters that are not directly deductible from the AMD (e.g. the proportion of calves that are moved from the dairy system to fattening plants).

Lions-type compactness and Rubik actions on the Heisenberg group

In this paper we prove a Lions-type compactness embedding result for symmetric unbounded domains of the Heisenberg group. The natural group action on the Heisenberg group TeX is provided by the unitary group U(n) × {1} and its appropriate subgroups, which will be used to construct subspaces with specific symmetry and compactness properties in the Folland-Stein’s horizontal Sobolev space TeX. As an application, we study the multiplicity of solutions for a singular subelliptic problem by exploiting a technique of solving the Rubik-cube applied to subgroups of U(n) × {1}. In our approach we employ concentration compactness, group-theoretical arguments, and variational methods.

Growth Codes: Intermediate Performance Analysis and Application to Video

Growth codes are a subclass of Rateless codes that have found interesting applications in data dissemination problems. Compared to other Rateless and conventional channel codes, Growth codes show improved intermediate performance which is particularly useful in applications where partial data presents some utility. In this paper, we investigate the asymptotic performance of Growth codes using the Wormald method, which was proposed for studying the Peeling Decoder of LDPC and LDGM codes. Compared to previous works, the Wormald differential equations are set on nodes' perspective which enables a numerical solution to the computation of the expected asymptotic decoding performance of Growth codes. Our framework is appropriate for any class of Rateless codes that does not include a precoding step. We further study the performance of Growth codes with moderate and large size codeblocks through simulations and we use the generalized logistic function to model the decoding probability. We then exploit the decoding probability model in an illustrative application of Growth codes to error resilient video transmission. The video transmission problem is cast as a joint source and channel rate allocation problem that is shown to be convex with respect to the channel rate. This illustrative application permits to highlight the main advantage of Growth codes, namely improved performance in the intermediate loss region.