A lopsided alternating direction iteration (LADI) method and an induced block diagonal preconditioner for solving block two-by-two generalised saddle point problems are presented. The convergence of the LADI method is analysed, and the block diagonal preconditioner can accelerate the convergence rates of Krylov subspace iteration methods such as GMRES. Our new preconditioned method only requires a solver for two linear equation sub-systems with symmetric and positive definite coefficient matrices. Numerical experiments show that the GMRES with the new preconditioner is quite effective.

AMG preconditioners are typically designed for partial differential equation solvers and divergence-interpolation in a moving mesh strategy. Here we introduce an AMG preconditioner to solve the unsteady Navier-Stokes equations by a moving mesh finite element method. A 4P1 – P1 element pair is selected based on the data structure of the hierarchy geometry tree and two-layer nested meshes in the velocity and pressure. Numerical experiments show the efficiency of our approach.

High-dimensional two-sided space fractional diffusion equations with variable diffusion coefficients are discussed. The problems can be solved by an implicit finite difference scheme that is proven to be uniquely solvable, unconditionally stable and first-order convergent in the infinity norm. A nonsingular multilevel circulant pre-conditoner is proposed to accelerate the convergence rate of the Krylov subspace linear system solver efficiently. The preconditoned matrix for fast convergence is a sum of the identity matrix, a matrix with small norm, and a matrix with low rank under certain conditions. Moreover, the preconditioner is practical, with an O(N logN) operation cost and O(N) memory requirement. Illustrative numerical examples are also presented.

A feature-dependent variational level set formulation is proposed for image segmentation. Two second order directional derivatives act as the external constraint in the level set evolution, with the directional derivative across the image features direction playing a key role in contour extraction and another only slightly contributes. To overcome the local gradient limit, we integrate the information from the maximal (in magnitude) second-order directional derivative into a common variational framework. It naturally encourages the level set function to deform (up or down) in opposite directions on either side of the image edges, and thus automatically generates object contours. An additional benefit of this proposed model is that it does not require manual initial contours, and our method can capture weak objects in noisy or intensity-inhomogeneous images. Experiments on infrared and medical images demonstrate its advantages.

In this paper, we first construct a preconditioned two-parameter generalized Hermitian and skew-Hermitian splitting (PTGHSS) iteration method based on the two-parameter generalized Hermitian and skew-Hermitian splitting (TGHSS) iteration method for non-Hermitian positive definite linear systems. Then a class of PTGHSS-based iteration methods are proposed for solving weakly nonlinear systems based on separable property of the linear and nonlinear terms. The conditions for guaranteeing the local convergence are studied and the quasi-optimal iterative parameters are derived. Numerical experiments are implemented to show that the new methods are feasible and effective for large scale systems of weakly nonlinear systems.

By introducing a new Gaussian process and a new compensated Poisson random measure, we propose an explicit prediction-correction scheme for solving decoupled forward backward stochastic differential equations with jumps (FBSDEJs). For this scheme, we first theoretically obtain a general error estimate result, which implies that the scheme is stable. Then using this result, we rigorously prove that the accuracy of the explicit scheme can be of second order. Finally, we carry out some numerical experiments to verify our theoretical results.

This article is devoted to the study of some high-order difference schemes for the distributed-order time-fractional equations in both one and two space dimensions. Based on the composite Simpson formula and Lubich second-order operator, a difference scheme is constructed with convergence in the L1(L∞)-norm for the one-dimensional case, where τ,h and σ are the respective step sizes in time, space and distributed-order. Unconditional stability and convergence are proven. An ADI difference scheme is also derived for the two-dimensional case, and proven to be unconditionally stable and convergent in the L1(L∞)-norm, where h1 and h2 are the spatial step sizes. Some numerical examples are also given to demonstrate our theoretical results.

A novel generalised successive overrelaxation (GSOR) method for solving generalised saddle point problems is proposed, based on splitting the coefficient matrix. The proposed method is shown to converge under suitable restrictions on the iteration parameters, and we present some illustrative numerical results.

A modified predator-prey system described by two differential equations and an algebraic equation is discussed. Formulae for determining the direction of a Hopf bifurcation and the stability of the bifurcating periodic solutions are derived differential-algebraic system theory, bifurcation theory and centre manifold theory. Numerical simulations illustrate the results, which includes quite complex dynamical behaviour.

Generalised centrohermitian and skew-centrohermitian matrices arise in a variety of applications in different fields. Based on the vibrating structure equation where M, D, G, K are given matrices with appropriate sizes and x is a column vector, we design a new vibrating structure mode. This mode can be discretised as the left and right inverse eigenvalue problem of a certain structured matrix. When the structured matrix is generalised centrohermitian, we discuss its left and right inverse eigenvalue problem with a submatrix constraint, and then get necessary and sufficient conditions such that the problem is solvable. A general representation of the solutions is presented, and an analytical expression for the solution of the optimal approximation problem in the Frobenius norm is obtained. Finally, the corresponding algorithm to compute the unique optimal approximate solution is presented, and we provide an illustrative numerical example.

Computational scientists generally seek more accurate results in shorter times, and to achieve this a knowledge of evolving programming paradigms and hardware is important. In particular, optimising solvers for linear systems is a major challenge in scientific computation, and numerical algorithms must be modified or new ones created to fully use the parallel architecture of new computers. Parallel space discretisation solvers for Partial Differential Equations (PDE) such as Domain Decomposition Methods (DDM) are efficient and well documented. At first glance, parallelisation seems to be inconsistent with inherently sequential time evolution, but parallelisation is not limited to space directions. In this article, we present a new and simple method for time parallelisation, based on partial fraction decomposition of the inverse of some special matrices. We discuss its application to the heat equation and some limitations, in associated numerical experiments.

An efficient adaptive time stepping method is proposed for transient dynamic response analysis, which is frequently encountered in civil engineering and elsewhere. The reduced problem following the spatial discretisation can be discretised in the time by a C0-continuous discontinuous Galerkin method, and the adaptive time stepping strategy is based on optimal a posteriori error estimates developed using the energy method. Some numerical experiments demonstrate the effectiveness of our approach.

A generalised Hermite spectral method for Fisher's equation in genetics with different asymptotic solution behaviour at infinities is proposed, involving a fully discrete scheme using a second order finite difference approximation in the time. The convergence and stability of the scheme are analysed, and some numerical results demonstrate its efficiency and substantiate our theoretical analysis.

A gravitational search algorithm (GSA) is a meta-heuristic development that is modelled on the Newtonian law of gravity and mass interaction. Here we propose a new hybrid algorithm called the Direct Gravitational Search Algorithm (DGSA), which combines a GSA that can perform a wide exploration and deep exploitation with the Nelder-Mead method, as a promising direct method capable of an intensification search. The main drawback of a meta-heuristic algorithm is slow convergence, but in our DGSA the standard GSA is run for a number of iterations before the best solution obtained is passed to the Nelder-Mead method to refine it and avoid running iterations that provide negligible further improvement. We test the DGSA on 7 benchmark integer functions and 10 benchmark minimax functions to compare the performance against 9 other algorithms, and the numerical results show the optimal or near optimal solution is obtained faster.

Various numerical methods have been developed in order to solve complex systems with uncertainties, and the stochastic collocation method using l1-minimisation on low discrepancy point sets is investigated here. Halton and Sobol' sequences are considered, and low discrepancy point sets and random points are compared. The tests discussed involve a given target function in polynomial form, high-dimensional functions and a random ODE model. Our numerical results show that the low discrepancy point sets perform as well or better than random sampling for stochastic collocation via l1-minimisation.

Two-grid finite element methods for the steady Navier-Stokes/Darcy model are considered. Stability and optimal error estimates in the H1-norm for velocity and piezometric approximations and the L2-norm for pressure are established under mesh sizes satisfying h = H2. A modified decoupled and linearised two-grid algorithm is developed, together with some associated optimal error estimates. Our method and results extend and improve an earlier investigation, and some numerical computations illustrate the efficiency and effectiveness of the new algorithm.

Traffic flow is treated as a continuum governed by the kinematic LWR model and the Greenshield flux function. The model is modified to describe traffic flow on a road with traffic lights or a roundabout. Parameters introduced determine the traffic flow behaviour and queue formation, and numerical simulations based on the Godunov method are carried out. The numerical procedure is shown to converge, and produces results consistent with previous analytic results.

Properties and comparison theorems for the maximal solution of the periodic discrete-time Riccati equation are supplemented by an extension of some earlier results and analysis, for the discrete-time Riccati equation to the periodic case.

We introduce a new method to compute the approximate distribution of the Delta-hedging error for a path-dependent option, and calculate its value over various strike prices via a recursive relation and numerical integration. Including geometric Brownian motion and Merton's jump diffusion model, we obtain the approximate distribution of the Delta-hedging error by differentiating its price with respect to the strike price. The distribution from Monte Carlo simulation is compared with that obtained by our method.

A generalized preconditioned modified Hermitian and skew-Hermitian splitting (GPMHSS) real-valued iteration method is proposed for a class of complex symmetric indefinite linear systems. Convergence theory is established and the spectral properties of an associated preconditioned matrix are analyzed. We also give several variants of the GPMHSS preconditioner and consider the spectral properties of the preconditioned matrices. Numerical examples illustrate the effectiveness of our proposed method.