In this paper, an efficient numerical method to solve sliding contact problems is proposed. Explicit formulae for the Gauss–Jacobi numerical integration scheme appropriate for the singular integral equations of the second kind with Cauchy kernels are derived. The resulting quadrature formulae for the integrals are valid at nodal points determined from the zeroes of a Jacobi polynomial. Gaussian...

The variable-step Störmer-Cowell integrator is a non-summed, double-integration multi-step integrator derived in variable-step form. The method has been implemented with a Shampine-Gordon style error control algorithm that uses an approximation of the local error at each step to choose the step size for the subsequent step. In this paper, the variable-step Störmer-Cowell method is compared to s...

few problems lend themselves to closed-form solution, we often need to convert formal definitions into practical numerical methods. One such problem deals with the Principal Value integral, which many students encounter in a course on functions of a complex variable. However, the prospect of evaluating one numerically might seem rather daunting. To the best of my knowledge, the subject remains ...

In this paper we suggest a Stata routine for multinomial logit models with unobserved heterogeneity using maximum simulated likelihood based on Halton sequences. The purpose of this paper is twofold: First, we provide a description of the technical implementation of the estimation routine and discuss its properties. Further, we compare our estimation routine to the Stata program gllamm which so...

On the line and its tensor products, Fekete points are known to be the Gauss–Lobatto quadrature points. But unlike high-order quadrature, Fekete points generalize to non-tensor-product domains such as the triangle. Thus Fekete points might serve as an alternative to the Gauss–Lobatto points for certain applications. In this work we present a new algorithm to compute Fekete points and give resul...

The Gauss map of a smooth doubly{curved surface characterizes the range of variation of the surface normal as an area on the unit sphere. An algorithm to approximate the Gauss map boundary to any desired accuracy is presented, in the context of a tensor{product polynomial surface patch, r(u;v) for (u; v) 2 0; 1 ] 0; 1 ]. Boundary segments of the Gauss map correspond to variations of the normal ...

Several stabilized finite element methods for the Stokes eigenvalue problem based on the lowest equal-order finite element pair are numerically investigated. They are penalty, regular, multiscale enrichment, and local Gauss integration method. Comparisons between them are carried out, which show that the local Gauss integration method has good stability, efficiency, and accuracy properties, and...

Nyström method is a standard numerical technique to solve Fredholm integral equations of the second kind where integration kernel approximated using quadrature formula. Traditionally, rule used classical polynomial Gauss quadrature. Motivated by observation that given function can be better spline lower degree than single piece higher degree, in this work, we investigate use Gaussian rules for ...

This paper proposes a new paradigm for solving systems of nonlinear equations through using Genetic Algorithm (GA) techniques. So, a great attention was presented to illustrate how genetic algorithms (GA) techniques can be used in finding the solution of a system described by nonlinear equations. To achieve this purpose, we apply Gauss–Legendre integration as a technique to solve the system of ...