Abstract: We are concerned with a class of quadratic matrix
equations arising from the overdamped mass-spring system. By
exploring the structure of coefficient matrices, we propose a fast
cyclic reduction algorithm to calculate the extreme solutions of the
equation. Numerical experiments show that the proposed algorithm
outperforms the original cyclic reduction and the structure-preserving
doubling algorithm.
Abstract: Knowledge of factors, which influence stress and its
distribution, is of key importance to the successful production of
durable restorations. One of this is the marginal geometry. The
objective of this study was to evaluate, by finite element analysis
(FEA), the influence of different marginal designs on the stress
distribution in teeth prepared for cast metal crowns. Five margin
designs were taken into consideration: shoulderless, chamfer,
shoulder, sloped shoulder and shoulder with bevel. For each kind of
preparation three dimensional finite element analyses were initiated.
Maximal equivalent stresses were calculated and stress patterns were
represented in order to compare the marginal designs. Within the
limitation of this study, the shoulder and beveled shoulder margin
preparations of the teeth are preferred for cast metal crowns from
biomechanical point of view.
Abstract: Heating is inevitable in any bearing operation. This
leads to not only the thinning of the lubricant but also could lead to a
thermal deformation of the bearing. The present work is an attempt to
analyze the influence of thermal deformation on the thermohydrodynamic
lubrication of infinitely long tilted pad slider rough
bearings. As a consequence of heating the slider is deformed and is
assumed to take a parabolic shape. Also the asperities expand leading
to smaller effective film thickness. Two different types of surface
roughness are considered: longitudinal roughness and transverse
roughness. Christensen-s stochastic approach is used to derive the
Reynolds-type equations. Density and viscosity are considered to be
temperature dependent. The modified Reynolds equation, momentum
equation, continuity equation and energy equation are decoupled and
solved using finite difference method to yield various bearing
characteristics. From the numerical simulations it is observed that the
performance of the bearing is significantly affected by the thermal
distortion of the slider and asperities and even the parallel sliders
seem to carry some load.
Abstract: We propose a reduced-ordermodel for the instantaneous
hydrodynamic force on a cylinder. The model consists of a system of
two ordinary differential equations (ODEs), which can be integrated
in time to yield very accurate histories of the resultant force and
its direction. In contrast to several existing models, the proposed
model considers the actual (total) hydrodynamic force rather than its
perpendicular or parallel projection (the lift and drag), and captures
the complete force rather than the oscillatory part only. We study
and provide descriptions of the relationship between the model
parameters, evaluated utilizing results from numerical simulations,
and the Reynolds number so that the model can be used at any
arbitrary value within the considered range of 100 to 500 to provide
accurate representation of the force without the need to perform timeconsuming
simulations and solving the partial differential equations
(PDEs) governing the flow field.
Abstract: By using the method of coincidence degree theory and constructing suitable Lyapunov functional, several sufficient conditions are established for the existence and global exponential stability of anti-periodic solutions for Cohen-Grossberg shunting inhibitory neural networks with delays. An example is given to illustrate our feasible results.
Abstract: In this paper, the telegraph equation is solved numerically by cubic B-spline quasi-interpolation .We obtain the numerical scheme, by using the derivative of the quasi-interpolation to approximate the spatial derivative of the dependent variable and a low order forward difference to approximate the temporal derivative of the dependent variable. The advantage of the resulting scheme is that the algorithm is very simple so it is very easy to implement. The results of numerical experiments are presented, and are compared with analytical solutions by calculating errors L2 and L∞ norms to confirm the good accuracy of the presented scheme.
Abstract: Recently, it is found that telegraph equation is more suitable than ordinary diffusion equation in modelling reaction diffusion for such branches of sciences. In this paper, a numerical solution for the one-dimensional hyperbolic telegraph equation by using the collocation method using the septic splines is proposed. The scheme works in a similar fashion as finite difference methods. Test problems are used to validate our scheme by calculate L2-norm and L∞-norm. The accuracy of the presented method is demonstrated by two test problems. The numerical results are found to be in good agreement with the exact solutions.
Abstract: In this paper, we study the numerical method for solving second-order fuzzy differential equations using Adomian method under strongly generalized differentiability. And, we present an example with initial condition having four different solutions to illustrate the efficiency of the proposed method under strongly generalized differentiability.
Abstract: Recent quasi-experimental evaluation of the Canadian Active Labour Market Policies (ALMP) by Human Resources and Skills Development Canada (HRSDC) has provided an opportunity to examine alternative methods to estimating the incremental effects of Employment Benefits and Support Measures (EBSMs) on program participants. The focus of this paper is to assess the efficiency and robustness of inverse probability weighting (IPW) relative to kernel matching (KM) in the estimation of program effects. To accomplish this objective, the authors compare pairs of 1,080 estimates, along with their associated standard errors, to assess which type of estimate is generally more efficient and robust. In the interest of practicality, the authorsalso document the computationaltime it took to produce the IPW and KM estimates, respectively.
Abstract: The problem addressed herein is the efficient management of the Grid/Cluster intense computation involved, when the preconditioned Bi-CGSTAB Krylov method is employed for the iterative solution of the large and sparse linear system arising from the discretization of the Modified Helmholtz-Dirichlet problem by the Hermite Collocation method. Taking advantage of the Collocation ma-trix's red-black ordered structure we organize efficiently the whole computation and map it on a pipeline architecture with master-slave communication. Implementation, through MPI programming tools, is realized on a SUN V240 cluster, inter-connected through a 100Mbps and 1Gbps ethernet network,and its performance is presented by speedup measurements included.
Abstract: In this research, the authors analyze network stability
using agent-based simulation. Firstly, the authors focus on analyzing
large networks (eight agents) by connecting different two stable small
social networks (A small stable network is consisted on four agents.).
Secondly, the authors analyze the network (eight agents) shape which
is added one agent to a stable network (seven agents). Thirdly, the
authors analyze interpersonal comparison of utility. The “star-network
"was not found on the result of interaction among stable two small
networks. On the other hand, “decentralized network" was formed
from several combination. In case of added one agent to a stable
network (seven agents), if the value of “c"(maintenance cost of per
a link) was larger, the number of patterns of stable network was
also larger. In this case, the authors identified the characteristics of a
large stable network. The authors discovered the cases of decreasing
personal utility under condition increasing total utility.
Abstract: Equations with differentials relating to the inverse of an unknown function rather than to the unknown function itself are solved exactly for some special cases and numerically for the general case. Invertibility combined with differentiability over connected domains forces solutions always to be monotone. Numerical function inversion is key to all solution algorithms which either are of a forward type or a fixed point type considering whole approximate solution functions in each iteration. The given considerations are restricted to ordinary differential equations with inverted functions (ODEIs) of first order. Forward type computations, if applicable, admit consistency of order one and, under an additional accuracy condition, convergence of order one.
Abstract: A spanning tree of a connected graph is a tree which
consists the set of vertices and some or perhaps all of the edges from
the connected graph. In this paper, a model for spanning tree
transformation of connected graphs into single-row networks, namely
Spanning Tree of Connected Graph Modeling (STCGM) will be
introduced. Path-Growing Tree-Forming algorithm applied with
Vertex-Prioritized is contained in the model to produce the spanning
tree from the connected graph. Paths are produced by Path-Growing
and they are combined into a spanning tree by Tree-Forming. The
spanning tree that is produced from the connected graph is then
transformed into single-row network using Tree Sequence Modeling
(TSM). Finally, the single-row routing problem is solved using a
method called Enhanced Simulated Annealing for Single-Row
Routing (ESSR).
Abstract: Fuzzy linear programming is an application of fuzzy set theory in linear decision making problems and most of these problems are related to linear programming with fuzzy variables. A convenient method for solving these problems is based on using of auxiliary problem. In this paper a new method for solving fuzzy variable linear programming problems directly using linear ranking functions is proposed. This method uses simplex tableau which is used for solving linear programming problems in crisp environment before.
Abstract: By using Mawhin-s continuation theorem of coincidence degree theory, we establish the existence of 2n positive periodic solutions for n species non-autonomous Lotka-Volterra competition systems with harvesting terms. An example is given to illustrate the effectiveness of our results.
Abstract: The real representation of the quaternionic matrix is
definited and studied. The relations between the positive (semi)define
quaternionic matrix and its real representation matrix are presented.
By means of the real representation, the relation between the positive
(semi)definite solutions of quaternionic matrix equations and those of
corresponding real matrix equations is established.
Abstract: This paper is concerned with the numerical minimization
of energy functionals in BV (
) (the space of bounded variation
functions) involving total variation for gray-scale 1-dimensional inpainting
problem. Applications are shown by finite element method
and discontinuous Galerkin method for total variation minimization.
We include the numerical examples which show the different recovery
image by these two methods.
Abstract: We present linear codes over finite commutative rings
which are not necessarily Frobenius. We treat the notion of syndrome
decoding by using Pontrjagin duality. We also give a version of Delsarte-s
theorem over rings relating trace codes and subring subcodes.
Abstract: The paper attempts to elucidate the columnar structure
of the cortex by answering the following questions. (1) Why the
cortical neurons with similar interests tend to be vertically arrayed
forming what is known as cortical columns? (2) How to describe the
cortex as a whole in concise mathematical terms? (3) How to design
efficient digital models of the cortex?
Abstract: This research work is concerned with the eigenvalue problem for the integral operators which are obtained by linearization of a nonlocal evolution equation. The purpose of section II.A is to describe the nature of the problem and the objective of the project. The problem is related to the “stable solution" of the evolution equation which is the so-called “instanton" that describe the interface between two stable phases. The analysis of the instanton and its asymptotic behavior are described in section II.C by imposing the Green function and making use of a probability kernel. As a result , a classical Theorem which is important for an instanton is proved. Section III devoted to a study of the integral operators related to interface dynamics which concern the analysis of the Cauchy problem for the evolution equation with initial data close to different phases and different regions of space.