Physical approximations for the nonlinear evolution of perturbations in inhomogeneous dark energy scenarios

The abundance and distribution of collapsed objects such as galaxy clusters will become an important tool to investigate the nature of dark energy and dark matter. Number counts of very massive objects are sensitive not only to the equation of state of dark energy, which parametrizes the smooth component of its pressure, but also to the sound speed of dark energy, which determines the amount of pressure in inhomogeneous and collapsed structures. Since the evolution of these structures must be followed well into the nonlinear regime, and a fully relativistic framework for this regime does not exist yet, we compare two approximate schemes: the widely used spherical collapse model and the pseudo-Newtonian approach. We show that both approximation schemes convey identical equations for the density contrast, when the pressure perturbation of dark energy is parametrized in terms of an effective sound speed. We also make a comparison of these approximate approaches to general relativity in the linearized regime, which lends some support to the approximations.

Local approximations for polarization potentials

We discuss the derivation of an equivalent polarization potential independent of angular momentum l for use in the optical Schrodinger equation that describes the elastic scattering of heavy ions. Three different methods are used for this purpose. Application of our theory to the low energy scattering of light heavy-ion systems at near-barrier energies is made. It is found that the notion of an l-independent polarization potential has some validity but cannot be a good substitute for the l-dependent local equivalent Feshbach polarization potential.

A hybrid-Trefftz formulation for plane elasticity with selective enrichment of the approximations

This work is related to the so-called non-conventional finite element formulations. Essentially, a methodology for the enrichment of the initial approximation which is typical of the meshless methods and based on the clouds concept is introduced in the hybrid-Trefftz formulation for plane elasticity. The formulation presented allows for the approximation and direct enrichment of two independent fields: stresses in the domains and displacements on the boundaries of the elements. Defined by a set of elements and interior boundaries sharing a common node, the cloud notion is employed to select the enrichment support for the approximation fields. The numerical analysis performed reveals an excellent performance of the resulting formulation, characterized by the good approximation ability and a reduced computational effort. Copyright (C) 2009 John Wiley & Sons, Ltd.

Free energy approximations in simple lattice proteins

This work addresses the question of whether it is possible to define simple pairwise interaction terms to approximate free energies of proteins or polymers. Rather than ask how reliable a potential of mean force is, one can ask how reliable it could possibly be. In a two-dimensional, infinite lattice model system one can calculate exact free energies by exhaustive enumeration. A series of approximations were fitted to exact results to assess the feasibility and utility of pairwise free energy terms. Approximating the true free energy with pairwise interactions gives a poor fit with little transferability between systems of different size. Adding extra artificial terms to the approximation yields better fits, but does not improve the ability to generalize from one system size to another. Furthermore, one cannot distinguish folding from nonfolding sequences via the approximated free energies. Most usefully, the methodology shows how one can assess the utility of various terms in lattice protein/polymer models. (C) 2001 American Institute of Physics.

Existence of multiple solutions for finite difference approximations to second-order boundary value problems

Error condition detected We consider discrete two-point boundary value problems of the form D-2 y(k+1) = f (kh, y(k), D y(k)), for k = 1,...,n - 1, (0,0) = G((y(0),y(n));(Dy-1,Dy-n)), where Dy-k = (y(k) - Yk-I)/h and h = 1/n. This arises as a finite difference approximation to y" = f(x,y,y'), x is an element of [0,1], (0,0) = G((y(0),y(1));(y'(0),y'(1))). We assume that f and G = (g(0), g(1)) are continuous and fully nonlinear, that there exist pairs of strict lower and strict upper solutions for the continuous problem, and that f and G satisfy additional assumptions that are known to yield a priori bounds on, and to guarantee the existence of solutions of the continuous problem. Under these assumptions we show that there are at least three distinct solutions of the discrete approximation which approximate solutions to the continuous problem as the grid size, h, goes to 0. (C) 2003 Elsevier Science Ltd. All rights reserved.

Product form approximations for highly linear loss networks with trunk reservation

Admission controls, such as trunk reservation, are often used in loss networks to optimise their performance. Since the numerical evaluation of performance measures is complex, much attention has been given to finding approximation methods. The Erlang Fixed-Point (EFP) approximation, which is based on an independent blocking assumption, has been used for networks both with and without controls. Several more elaborate approximation methods which account for dependencies in blocking behaviour have been developed for the uncontrolled setting. This paper is an exploratory investigation of extensions and synthesis of these methods to systems with controls, in particular, trunk reservation. In order to isolate the dependency factor, we restrict our attention to a highly linear network. We will compare the performance of the resulting approximations against the benchmark of the EFP approximation extended to the trunk reservation setting. By doing this, we seek to gain insight into the critical factors in constructing an effective approximation. (C) 2003 Elsevier Ltd. All rights reserved.

Eigenvalue computations in the context of data-sparse approximations of integral operators

In this work, we consider the numerical solution of a large eigenvalue problem resulting from a finite rank discretization of an integral operator. We are interested in computing a few eigenpairs, with an iterative method, so a matrix representation that allows for fast matrix-vector products is required. Hierarchical matrices are appropriate for this setting, and also provide cheap LU decompositions required in the spectral transformation technique. We illustrate the use of freely available software tools to address the problem, in particular SLEPc for the eigensolvers and HLib for the construction of H-matrices. The numerical tests are performed using an astrophysics application. Results show the benefits of the data-sparse representation compared to standard storage schemes, in terms of computational cost as well as memory requirements.

Error bounds for low-rank approximations of the first exponential integral kernel

A hierarchical matrix is an efficient data-sparse representation of a matrix, especially useful for large dimensional problems. It consists of low-rank subblocks leading to low memory requirements as well as inexpensive computational costs. In this work, we discuss the use of the hierarchical matrix technique in the numerical solution of a large scale eigenvalue problem arising from a finite rank discretization of an integral operator. The operator is of convolution type, it is defined through the first exponential-integral function and, hence, it is weakly singular. We develop analytical expressions for the approximate degenerate kernels and deduce error upper bounds for these approximations. Some computational results illustrating the efficiency and robustness of the approach are presented.

Fractional derivatives: probability interpretation and frequency response of rational approximations

The theory of fractional calculus (FC) is a useful mathematical tool in many applied sciences. Nevertheless, only in the last decades researchers were motivated for the adoption of the FC concepts. There are several reasons for this state of affairs, namely the co-existence of different definitions and interpretations, and the necessity of approximation methods for the real time calculation of fractional derivatives (FDs). In a first part, this paper introduces a probabilistic interpretation of the fractional derivative based on the Grünwald-Letnikov definition. In a second part, the calculation of fractional derivatives through Padé fraction approximations is analyzed. It is observed that the probabilistic interpretation and the frequency response of fraction approximations of FDs reveal a clear correlation between both concepts.

Rational approximations of sectional category and Poincaré duality

Félix, Halperin, and Lemaire have shown that the rational module category Mcat and the rational Toomer invariant coincide for simply connected Poincaré duality complexes. We establish an analogue of this result for the sectional category of a fibration.

Approximations of the Fisher information for the construction of efficient experimental designs in nonlinear mixed effects models

Magdeburg, Univ., Fak. für Mathematik, Diss., 2012

Numerical approximations of population balance equations in particulate systems

Magdeburg, Univ., Fak. für Mathematik, Diss., 2006

Verification of system properties of polynomial systems using discrete-time approximations and set-based analysis

Magdeburg, Univ., Fak. für Elektrotechnik und Informationstechnik, Diss., 2015