In this work we demonstrate how the extension of the Evans function method using the compound matrix approach can be implemented to undertake the stability analysis (normally done through numerical means) of nonlinear travelling waves. The main advantage of this approach is that it can easily overcome the stiffness which is normally associated with these kinds of problems. We present a general ...

This paper considers the bonded joint as a multilayer structure that is analysed using the Transfer Matrix method. In this particular case three layers (two adherents and the adhesive) are considered. The study of this propagation problem may be developed from matrix formulations which describe elastic waves in layered media. This technique combines the theory of the dynamics of the continuum w...

In this report a general approach to algebraic multigrid methods for problems arising from the nite element discretization of a second order, self-adjoint, elliptic partial diierential equation is proposed. Special attention is paid to the coarsening process and the transfer operators. In order to construct a more exible method an auxiliary matrix is introduced which represents a virtual nite e...

This paper presents a novel AR registration method for overlaying a virtual object onto real world by multiple planes in arbitrary positions and poses. In this method, we do not require neither artificial markers nor sensors, but natural feature points on arbitrary multiple planes. We assign a 3D coordinate system for each plane independently. For each coordinate system, the projection matrix i...

Discrete Fracture and Matrix (DFM) models describe fractured porous media as complex sets of 2D planar polygons embedded in a 3D matrix representing the surrounding medium. The numerical simulation flow DFM requires discretization partial differential equations on three dimensional matrix, fractures one fracture intersections, suitable coupling conditions between entities different dimensionali...

We develop a novel and powerful technique for communication lower bounds, the pattern matrix method. Specifically, fix an arbitrary function f : {0, 1}n → {0, 1} and let Af be the matrix whose columns are each an application of f to some subset of the variables x1, x2, . . . , x4n. We prove that Af has bounded-error communication complexity Ω(d), where d is the approximate degree of f. This res...

Due to the frequent drought periods, water consumption increase, and competition of different water-using sectors, the Hirmand catchment is in a critical water status in the Sistan region. This threat has been intensified in recent years. To cope with this problem, we must pay more attention to different types of water use such as virtual water as a water saving method. The present study calcul...

In this paper we give a self-contained proof of Sherstov’s pattern matrix method. This theorem combines two main ideas—an extension of the discrepancy method known as the generalized discrepancy method and the notion of dual polynomials—with the techniques of matrix norms, Fourier analysis, and approximate degree. All together, this results in lower bounds on the randomized communication comple...

We argue that a network of shipping companies, that cooperatively executes transportation tasks, can be viewed as a special instance of a virtual enterprise. We propose the matrix auction as an efficient, incentive compatible allocation mechanism for virtual transportation enterprises. The implementation of the matrix auction in a multi-agent fleet scheduling system is described, and we were ab...