Array-oriented programming languages such as APL [1] and J [2] pay special attention to manipulating array structures: rank-one vectors (sequences of values), rank-two matrices (which can be seen as rectangular sequences of sequences), rank-three cuboids (sequences of sequences of sequences), rank-zero scalars, and so on. One appealing consequence of this unification is the prospect of rank pol...

We describe the local structure of an irreducible algebraic monoid M at an idempotent element e. When e is minimal, we show that M is an induced variety over the kernel MeM (a homogeneous space) with fibre the two-sided stabilizer Me (a connected affine monoid having a zero element and a dense unit group). This yields the irreducibility of stabilizers and centralizers of idempotents when M is n...

We introduce a new iterative algorithm for finding a common element of the solution set of the variational inequality problem for a continuous monotone mapping, the zero point set of a maximal monotone operator, and the fixed point set of a continuous pseudocontractive mapping in a Hilbert space. Then we establish strong convergence of the sequence generated by the proposed algorithm to a commo...

We introduce a new iterative scheme for finding the common element of the set of common fixed points of nonexpansive mappings, the set of solutions of an equilibrium problem, and the set of solutions of the variational inequality. We show that the sequence converges strongly to a common element of the above three sets under some parameters controlling conditions. Moreover, we apply our result t...

Proof. Consider the map g:A/I → C , a+I 7→ f (a). It is well defined: a+I = a′ +I implies a− a′ ∈ I implies f (a) = f (a′). The element a + I belongs to the kernel of g iff g(a + I) = f (a) = 0, i.e. a ∈ I , i.e. a + I = I is the zero element of A/I . Thus, ker(g) = 0. The image of g is g(A/I) = {f (a) : a ∈ A} = C . Thus, g is an isomorphism. The inverse morphism to g is given by f (a) 7→ a + I .

Spectral element methods (SEM) are superior to general finite element methods (FEM) in achieving high order accuracy through p-type refinement. Owing to orthogonal polynomials in both expansion and test functions, the discretization errors in SEM could be reduced exponentially to machine zero so that the spectral convergence rate can be achieved. Inherited the advantage of FEM, SEM can enhance ...

This paper generalizes slightly a result of Kunz [l ] and Nakai [2]. If R>S are commutative rings with identity we introduce a module D*(R/S) defined as the quotient of the module D(R/S) oí S differentials of A by the submodule consisting of elements which are mapped to zero by every homomorphism of D(R/S) having values in a finitely generated A module. The characteristic exponent of a field is...

the cracked brazilian disc (cbd) specimen is widely used in order to determine mode-i/ii and mixed-mode fracture toughness of a rock medium. in this study, the stress intensity factor (sif) on the crack-tip in this specimen is calculated for various geometrical crack conditions using the extended-finite element method (x-fem). this method is based upon the finite element method (fem). in this m...

Second order elliptic boundary value problems which are allowed to degenerate into zero order equations are considered. The behavior of the ordinary Galerkin finite element method without special arrangements to treat singularities is studied as the problem ranges from true second order to singularly perturbed.

We analyze a semidiscrete scheme for the Cahn-Hilliard equation in one space dimension, when the interface length parameter is equal to zero. We prove convergence of the scheme for a suitable class of initial data, and we identify the limit equation. We also characterize the long-time behavior of the limit solutions. keywords: Nonconvex functionals, forward-backward parabolic equations, finite ...