Analytic solutions for the Lambda-FRW model

The high precision attained by cosmological data in the last few years has increased the interest in exact solutions. Analytic expressions for solutions in the Standard Model are presented here for all combinations of Lambda = 0, Lambda not equal 0, kappa = 0, and kappa = 0, in the presence and absence of radiation and nonrelativistic matter. The most complete case (here called the Lambda gamma CDM Model) has Lambda not equal 0, kappa not equal 0, and supposes the presence of radiation and dust. It exhibits clearly the recent onset of acceleration. The treatment includes particular models of interest such as the Lambda CDM Model (which includes the cosmological constant plus cold dark matter as source constituents).

On the Analytic Solutions of the Functional Equations w 1 f(a 1 z) + w 2 f(a 2 z) + ... + w n f(a n z) = 0

In this paper, it is showed that, given an integer number n ≥ 2, each zero of an exponential polynomial of the form w1az1+w2az2+⋯+wnazn, with non-null complex numbers w 1,w 2,…,w n and a 1,a 2,…,a n , produces analytic solutions of the functional equation w 1 f(a 1 z) + w 2 f(a 2 z) + ... + w n f(a n z) = 0 on certain domains of C, which represents an extension of some existing results in the literature on this functional equation for the case of positive coefficients a j and w j.

Semi-analytic method of contact modelling

An algorithm to improve the accuracy and stability of rigid-body contact force calculation is presented. The algorithm uses a combination of analytic solutions and numerical methods to solve a spring-damper differential equation typical of a contact model. The solution method employs the recently proposed patch method, which especially suits the spring-damper differential equations. The resulting semi-analytic solution reduces the stiffness of the differential equations, while performing faster than conventional alternatives.

How does data quality in a network affect heuristic solutions?

To have good data quality with high complexity is often seen to be important. Intuition says that the higher accuracy and complexity the data have the better the analytic solutions becomes if it is possible to handle the increasing computing time. However, for most of the practical computational problems, high complexity data means that computational times become too long or that heuristics used to solve the problem have difficulties to reach good solutions. This is even further stressed when the size of the combinatorial problem increases. Consequently, we often need a simplified data to deal with complex combinatorial problems. In this study we stress the question of how the complexity and accuracy in a network affect the quality of the heuristic solutions for different sizes of the combinatorial problem. We evaluate this question by applying the commonly used p-median model, which is used to find optimal locations in a network of p supply points that serve n demand points. To evaluate this, we vary both the accuracy (the number of nodes) of the network and the size of the combinatorial problem (p). The investigation is conducted by the means of a case study in a region in Sweden with an asymmetrically distributed population (15,000 weighted demand points), Dalecarlia. To locate 5 to 50 supply points we use the national transport administrations official road network (NVDB). The road network consists of 1.5 million nodes. To find the optimal location we start with 500 candidate nodes in the network and increase the number of candidate nodes in steps up to 67,000 (which is aggregated from the 1.5 million nodes). To find the optimal solution we use a simulated annealing algorithm with adaptive tuning of the temperature. The results show that there is a limited improvement in the optimal solutions when the accuracy in the road network increase and the combinatorial problem (low p) is simple. When the combinatorial problem is complex (large p) the improvements of increasing the accuracy in the road network are much larger. The results also show that choice of the best accuracy of the network depends on the complexity of the combinatorial (varying p) problem.

Some exact solutions of the Dirac equation

Exact analytic solutions are found to the Dirac equation for a combination of Lorentz scalar and vector Coulombic potentials with additional non-Coulombic parts. An appropriate linear combination of Lorentz scalar and vector non-Coulombic potentials, with the scalar part dominating, can be chosen to give exact analytic Dirac wave functions.

Exact solutions related to nonminimal gravitational coupling

We obtain exact analytic solutions for a typical autonomous dynamical system, related to the problem of a vector field nonminimally coupled to gravity. © 1995.

Approximate analytic expression for the eigenenergies of the anharmonic oscillator V(x)=Ax6+Bx2

An approximate analytic expression for the eigenenergies of the anharmonic oscillator V(x)=Ax6+Bx2 is introduced, starting from particular analytic solutions which are valid when certain relations between the parameters A and B are held. © 1995 The American Physical Society.

Multibrane solutions in cubic superstring field theory

Using the elements of the so-called KBc gamma subalgebra, we study a class of analytic solutions depending on a single function F(K) in the modified cubic superstring field theory. We compute the energy associated to these solutions and show that the result can be expressed in terms of a contour integral. For a particular choice of the function F(K), we show that the energy is given by integer multiples of a single D-brane tension.

Numerical approximation of a fractional-in-space diffusion equation (II) - with nonhomogeneous boundary conditions

In this paper, a space fractional di®usion equation (SFDE) with non- homogeneous boundary conditions on a bounded domain is considered. A new matrix transfer technique (MTT) for solving the SFDE is proposed. The method is based on a matrix representation of the fractional-in-space operator and the novelty of this approach is that a standard discretisation of the operator leads to a system of linear ODEs with the matrix raised to the same fractional power. Analytic solutions of the SFDE are derived. Finally, some numerical results are given to demonstrate that the MTT is a computationally e±cient and accurate method for solving SFDE.

Flow of a micropolar fluid bounded by a stretching sheet

We consider boundary layer flow of a micropolar fluid driven by a porous stretching sheet. A similarity solution is defined, and numerical solutions using Runge-Kutta and quasilinearisation schemes are obtained. A perturbation analysis is also used to derive analytic solutions to first order in the perturbing parameter. The resulting closed form solutions involve relatively complex expressions, and the analysis is made more tractable by a combination of offline and online work using a computational algebra system (CAS). For this combined numerical and analytic approach, the perturbation analysis yields a number of benefits with regard to the numerical work. The existence of a closed form solution helps to discriminate between acceptable and spurious numerical solutions. Also, the expressions obtained from the perturbation work can provide an accurate description of the solution for ranges of parameters where the numerical approaches considered here prove computationally more difficult.

A Numerical Solution Using an Adaptively Preconditioned Lanczos Method for a Class of Linear Systems Related with the Fractional Poisson Equation

This study considers the solution of a class of linear systems related with the fractional Poisson equation (FPE) (−∇2)α/2φ=g(x,y) with nonhomogeneous boundary conditions on a bounded domain. A numerical approximation to FPE is derived using a matrix representation of the Laplacian to generate a linear system of equations with its matrix A raised to the fractional power α/2. The solution of the linear system then requires the action of the matrix function f(A)=A−α/2 on a vector b. For large, sparse, and symmetric positive definite matrices, the Lanczos approximation generates f(A)b≈β0Vmf(Tm)e1. This method works well when both the analytic grade of A with respect to b and the residual for the linear system are sufficiently small. Memory constraints often require restarting the Lanczos decomposition; however this is not straightforward in the context of matrix function approximation. In this paper, we use the idea of thick-restart and adaptive preconditioning for solving linear systems to improve convergence of the Lanczos approximation. We give an error bound for the new method and illustrate its role in solving FPE. Numerical results are provided to gauge the performance of the proposed method relative to exact analytic solutions.

Numerical methods for fractional partial differential equations with Riesz space fractional derivatives

In this paper, we consider the numerical solution of a fractional partial differential equation with Riesz space fractional derivatives (FPDE-RSFD) on a finite domain. Two types of FPDE-RSFD are considered: the Riesz fractional diffusion equation (RFDE) and the Riesz fractional advection–dispersion equation (RFADE). The RFDE is obtained from the standard diffusion equation by replacing the second-order space derivative with the Riesz fractional derivative of order αset membership, variant(1,2]. The RFADE is obtained from the standard advection–dispersion equation by replacing the first-order and second-order space derivatives with the Riesz fractional derivatives of order βset membership, variant(0,1) and of order αset membership, variant(1,2], respectively. Firstly, analytic solutions of both the RFDE and RFADE are derived. Secondly, three numerical methods are provided to deal with the Riesz space fractional derivatives, namely, the L1/L2-approximation method, the standard/shifted Grünwald method, and the matrix transform method (MTM). Thirdly, the RFDE and RFADE are transformed into a system of ordinary differential equations, which is then solved by the method of lines. Finally, numerical results are given, which demonstrate the effectiveness and convergence of the three numerical methods.

Novel analytical and numerical methods for solving fractional dynamical systems

During the past three decades, the subject of fractional calculus (that is, calculus of integrals and derivatives of arbitrary order) has gained considerable popularity and importance, mainly due to its demonstrated applications in numerous diverse and widespread fields in science and engineering. For example, fractional calculus has been successfully applied to problems in system biology, physics, chemistry and biochemistry, hydrology, medicine, and finance. In many cases these new fractional-order models are more adequate than the previously used integer-order models, because fractional derivatives and integrals enable the description of the memory and hereditary properties inherent in various materials and processes that are governed by anomalous diffusion. Hence, there is a growing need to find the solution behaviour of these fractional differential equations. However, the analytic solutions of most fractional differential equations generally cannot be obtained. As a consequence, approximate and numerical techniques are playing an important role in identifying the solution behaviour of such fractional equations and exploring their applications. The main objective of this thesis is to develop new effective numerical methods and supporting analysis, based on the finite difference and finite element methods, for solving time, space and time-space fractional dynamical systems involving fractional derivatives in one and two spatial dimensions. A series of five published papers and one manuscript in preparation will be presented on the solution of the space fractional diffusion equation, space fractional advectiondispersion equation, time and space fractional diffusion equation, time and space fractional Fokker-Planck equation with a linear or non-linear source term, and fractional cable equation involving two time fractional derivatives, respectively. One important contribution of this thesis is the demonstration of how to choose different approximation techniques for different fractional derivatives. Special attention has been paid to the Riesz space fractional derivative, due to its important application in the field of groundwater flow, system biology and finance. We present three numerical methods to approximate the Riesz space fractional derivative, namely the L1/ L2-approximation method, the standard/shifted Gr¨unwald method, and the matrix transform method (MTM). The first two methods are based on the finite difference method, while the MTM allows discretisation in space using either the finite difference or finite element methods. Furthermore, we prove the equivalence of the Riesz fractional derivative and the fractional Laplacian operator under homogeneous Dirichlet boundary conditions – a result that had not previously been established. This result justifies the aforementioned use of the MTM to approximate the Riesz fractional derivative. After spatial discretisation, the time-space fractional partial differential equation is transformed into a system of fractional-in-time differential equations. We then investigate numerical methods to handle time fractional derivatives, be they Caputo type or Riemann-Liouville type. This leads to new methods utilising either finite difference strategies or the Laplace transform method for advancing the solution in time. The stability and convergence of our proposed numerical methods are also investigated. Numerical experiments are carried out in support of our theoretical analysis. We also emphasise that the numerical methods we develop are applicable for many other types of fractional partial differential equations.

A boundary preserving numerical algorithm for the Wright-Fisher model with mutation

The Wright-Fisher model is an Itô stochastic differential equation that was originally introduced to model genetic drift within finite populations and has recently been used as an approximation to ion channel dynamics within cardiac and neuronal cells. While analytic solutions to this equation remain within the interval [0,1], current numerical methods are unable to preserve such boundaries in the approximation. We present a new numerical method that guarantees approximations to a form of Wright-Fisher model, which includes mutation, remain within [0,1] for all time with probability one. Strong convergence of the method is proved and numerical experiments suggest that this new scheme converges with strong order 1/2. Extending this method to a multidimensional case, numerical tests suggest that the algorithm still converges strongly with order 1/2. Finally, numerical solutions obtained using this new method are compared to those obtained using the Euler-Maruyama method where the Wiener increment is resampled to ensure solutions remain within [0,1].

Corner and finger formation in Hele-Shaw flow with kinetic undercooling regularisation

We examine the effect of a kinetic undercooling condition on the evolution of a free boundary in Hele--Shaw flow, in both bubble and channel geometries. We present analytical and numerical evidence that the bubble boundary is unstable and may develop one or more corners in finite time, for both expansion and contraction cases. This loss of regularity is interesting because it occurs regardless of whether the less viscous fluid is displacing the more viscous fluid, or vice versa. We show that small contracting bubbles are described to leading order by a well-studied geometric flow rule. Exact solutions to this asymptotic problem continue past the corner formation until the bubble contracts to a point as a slit in the limit. Lastly, we consider the evolving boundary with kinetic undercooling in a Saffman--Taylor channel geometry. The boundary may either form corners in finite time, or evolve to a single long finger travelling at constant speed, depending on the strength of kinetic undercooling. We demonstrate these two different behaviours numerically. For the travelling finger, we present results of a numerical solution method similar to that used to demonstrate the selection of discrete fingers by surface tension. With kinetic undercooling, a continuum of corner-free travelling fingers exists for any finger width above a critical value, which goes to zero as the kinetic undercooling vanishes. We have not been able to compute the discrete family of analytic solutions, predicted by previous asymptotic analysis, because the numerical scheme cannot distinguish between solutions characterised by analytic fingers and those which are corner-free but non-analytic.