Lagrangian approximations and weak solutions of the Navier-Stokes equations

The motion of a viscous incompressible fluid flow in bounded domains with a smooth boundary can be described by the nonlinear Navier-Stokes equations. This description corresponds to the so-called Eulerian approach. We develop a new approximation method for the Navier-Stokes equations in both the stationary and the non-stationary case by a suitable coupling of the Eulerian and the Lagrangian representation of the flow, where the latter is defined by the trajectories of the particles of the fluid. The method leads to a sequence of uniquely determined approximate solutions with a high degree of regularity containing a convergent subsequence with limit function v such that v is a weak solution of the Navier-Stokes equations.

The Navier-Stokes Equations with Particle Methods

The non-stationary nonlinear Navier-Stokes equations describe the motion of a viscous incompressible fluid flow for 0uniquely and globally in time and that its solution has a high degree of spatial regularity. Moreover we prove that the system of approximate solutions has an accumulation point satisfying the Navier-Stokes equations in a weak sense.

Numerical Methods for Non-Stationary Stokes Flow

We consider a first order implicit time stepping procedure (Euler scheme) for the non-stationary Stokes equations in smoothly bounded domains of R3. Using energy estimates we can prove optimal convergence properties in the Sobolev spaces Hm(G) (m = 0;1;2) uniformly in time, provided that the solution of the Stokes equations has a certain degree of regularity. For the solution of the resulting Stokes resolvent boundary value problems we use a representation in form of hydrodynamical volume and boundary layer potentials, where the unknown source densities of the latter can be determined from uniquely solvable boundary integral equations’ systems. For the numerical computation of the potentials and the solution of the boundary integral equations a boundary element method of collocation type is used. Some simulations of a model problem are carried out and illustrate the efficiency of the method.

India’s Carbon Governance: The Clean Development Mechanism

Carbon Governance systems – institutional arrangements in place for mitigating greenhouse gas emissions – are different in emerging countries. Indeed, carbon is the same everywhere but Carbon Governance isn’t: in Brazil, the financial community is actively interested in carbon trading, but Chinese banks have hardly any interest in it; and while the Chinese government takes an active interest in providing capacity to project developers, the Brazilian authorities see their role uniquely as guarantors of environmental integrity of emissions reductions projects. In the case of India, carbon governance offers specific features of patterns and interactions mostly because India strongly developed the Clean Development Mechanism and its market. This article proposes a study to the research and understanding of how exactly carbon governance works in the Indian case, knowing that India is the second largest host of CDM projects.

Elimination in Operator Algebras

A large class of special functions are solutions of systems of linear difference and differential equations with polynomial coefficients. For a given function, these equations considered as operator polynomials generate a left ideal in a noncommutative algebra called Ore algebra. This ideal with finitely many conditions characterizes the function uniquely so that Gröbner basis techniques can be applied. Many problems related to special functions which can be described by such ideals can be solved by performing elimination of appropriate noncommutative variables in these ideals. In this work, we mainly achieve the following: 1. We give an overview of the theoretical algebraic background as well as the algorithmic aspects of different methods using noncommutative Gröbner elimination techniques in Ore algebras in order to solve problems related to special functions. 2. We describe in detail algorithms which are based on Gröbner elimination techniques and perform the creative telescoping method for sums and integrals of special functions. 3. We investigate and compare these algorithms by illustrative examples which are performed by the computer algebra system Maple. This investigation has the objective to test how far noncommutative Gröbner elimination techniques may be efficiently applied to perform creative telescoping.