Coupling of h and p finite elements: Application to free vibration analysis of plates with curvilinear plan-forms

This paper presents a method for coupling isoparametric cubic quadrilateral h-elements and straight sided serendipity quadrilateral p-elements. The p-elements are used to model the interior of the domain while the h-elements are used to describe accurately the curved boundaries. At a common side shared by a p-element and an arbitrary number of h-elements, the field variables are minimized in the least square sense with respect to the degrees-of-freedom of the h-elements. This leads to a set of equations which relate the degrees-of-freedom of the coupled elements on the shared side. The method is applied to the calculation of frequencies for plates with curvilinear plan-forms. The effects of shear deformation and rotary inertia are taken into account. The frequencies are obtained for a sectorial plate with simply supported radial edges and free circular edge, an annular sectorial plate with simply supported radial edges and clamped circular edges, and a circular plate with one concentric ring support. Furthermore, new accurate frequencies are given for a fully clamped square plate with a corner cut-out. Constant meshes are used and convergence is sought by increasing progressively the degree p of the interpolating polynomial. The fast convergence and high accuracy of the method are validated through convergence and comparison studies.     

Soliton solutions for (2 + 1)-dimensional and (3 + 1)-dimensional K(m, n) equations

We consider the nonlinear dispersive K(m,n) equation with the generalized evolution term and derive analytical expressions for some conserved quantities. By using a solitary wave ansatz in the form of sech^p function, we obtain exact bright soliton solutions for (2 + 1)-dimensional and (3 + 1)-dimensional K(m,n) equations with the generalized evolution terms. The results are then generalized to multi-dimensional K(m,n) equations in the presence of the generalized evolution term. An extended form of the K(m,n) equation with perturbation term is investigated. Exact bright soliton solution for the proposed K(m,n) equation having higher-order nonlinear term is determined. The physical parameters in the soliton solutions are obtained as function of the dependent model coefficients.     

Approximation of signals of class Lip(α, p) by linear operators

Mittal, Rhoades [5], [6], [7] and [8] and Mittal et al. [9] and [10] have initiated a study of error estimates E_n(f) through trigonometric-Fourier approximation (tfa) for the situations in which the summability matrix T does not have monotone rows. In this paper we continue the work. Here we extend two theorems of Leindler [4], where he has weakened the conditions on {p_n} given by Chandra [2], to more general classes of triangular matrix methods. Our Theorem also partially generalizes Theorem 4 of Mittal et al. [11] by dropping the monotonicity on the elements of matrix rows, which in turn generalize the results of Quade [15].     

Demiclosedness principle and convergence theorems for k-strictly asymptotically pseudocontractive maps

Let E be a real q-uniformly smooth Banach space which is also uniformly convex (for example, Lp or ?p spaces, 1<p<∞), and K a nonempty closed convex (not necessarily bounded) subset of E. Let be a k-strictly asymptotically pseudocontractive map with a nonempty fixed-point set. It is proved that (I−T) is demiclosed at 0. Furthermore, weak and strong convergence of an averaging iteration method to a fixed point of T are proved.     

Cyclic vectors and cellular indecomposable operators on Qp spaces

We identify the functions whose polynomial multiples are weak* dense in Q p spaces and prove that if | f (z) | ≥ | g(z) | and g is cyclic in Q p , then f is cyclic in Q p . We also show that the multiplication operator M z on Q p spaces is cellular indecomposable.     

Enumerating K best paths in length order in DAGs

We address the problem of finding the K best paths connecting a given pair of nodes in a directed acyclic graph (DAG) with arbitrary lengths. One of the main results in this paper is the proof that a tree representing the kth shortest path is obtained by an arc exchange in one of the previous (k − 1) trees (each of which contains a previous best path). An O(m + K(n + log K)) time and O(K + m) space algorithm is designed to explicitly determine the K shortest paths in a DAG with n nodes and m arcs. The algorithm runs in O(m + Kn) time using O(K + m) space in DAGs with integer length arcs. Empirical results confirming the superior performance of the algorithm to others found in the literature for randomly generated graphs are reported.     

Approximation of common fixed points for finite families of total asymptotically nonexpansive mappings

Let E be a real Banach space, K a closed convex nonempty subset of E. Let be m total asymptotically nonexpansive mappings. An iterative sequence for approximation of common fixed points (assuming existence) of T₁,T₂,…,Tm is constructed; necessary and sufficient conditions for the convergence of the scheme to a common fixed point of the mappings are given. Furthermore, in the case that E is uniformly convex, a sufficient condition for convergence of the iteration process to a common fixed point of mappings under our setting is established.     

Weak barrelledness for C(X) spaces

Buchwalter and Schmets reconciled C_c(X) and C_p(X) spaces with most of the weak barrelledness conditions of 1973, but could not determine if -barrelled ⇔ ?^∞-barrelled for C_c(X). The areas grew apart. Full reconciliation with the fourteen conditions adopted by Saxon and Sánchez Ruiz needs their 1997 characterization of Ruess' property (L), which allows us to reduce the C_c(X) problem to its 1973 status and solve it by carefully translating the topology of Kunen (1980) and van Mill (1982) to find the example that eluded Buchwalter and Schmets. The more tractable C_p(X) readily partitions the conditions into just two equivalence classes, the same as for metrizable locally convex spaces, instead of the five required for C_c(X) spaces. Our paper elicits others, soon to appear, that analytically characterize when the Tychonov space X is pseudocompact, or Warner bounded, or when C_c(X) is a df-space (Jarchow's 1981 question).     

Nonlinear programming with E-preinvex and local E-preinvex functions

In this paper, we extend the class of E-convex sets, E-convex and E-quasiconvex functions introduced by [Youness, E.A., 1999. E-convex sets, E-convex functions and E-convex programming. Journal of Optimization Theory and Applications 102, 439–450], respectively by [Syau, Yu-Ru, Lee, E. Stanley, 2005. Some properties of E-convex functions. Applied Mathematics Letters 18, 1074–1080] to E-invex set, E-preinvex, E-prequasiinvex and corresponding local concepts. Some properties of these classes are studied. As an application of our results, we consider the nonlinear programming problem for which, we establish that, under mild conditions, a local minimum is a global minimum.     

On the T-ramified, S-split p-class field towers over an extension of degree prime to p

Let K be a number field, p a prime, and let be the T-ramified, S-split p-class field tower of K, i.e., the maximal pro-p-extension of K unramified outside T and totally split on S, where T and S are disjoint finite sets of places of K. Using a theorem of Tate on nilpotent quotient groups, we give (Theorem 2 in Section 3) an elementary characterisation of the finite extensions L/K, with a normal closure of degree prime to p, such that the analogous p-class field tower of L is equal to the compositum . This N.S.C. only depends on classes and units of L. Some applications and examples are given.     

Approximating Solution Of ∈ T(x) for an H-Monotone Operator in Hilbert Spaces

The purpose of this paper is to study the solution of 0 ∈ T(x) for an H-monotone operator introduced in [Fang and Huang, Appl. Math. Comput. 145(2003)795-803] in Hilbert spaces, which is the first proposal of it's kind. Some strong and weak convergence results are presented and the relations between maximal monotone operators and H-monotone operators are analyzed. Simultaneously, we apply these results to the minimization problem for T = ∂f and provide some numerical examples to support the theoretical findings.     

An extension based on qR-integral for a sequence of operators

The paper deals with a sequence of linear positive operators introduced via q-Calculus. We give a generalization in Kantorovich sense of its involving qR-integrals. Both for discrete operators and for integral operators we study the error of approximation for bounded functions and for functions having a polynomial growth. The main tools consist of the K-functional in Peetre sense and different moduli of smoothness.     

Special values of L-functions of elliptic curves over Q and their base change to real quadratic fields

For an elliptic curve E over Q, and a real quadratic extension F of Q, satisfying suitable hypotheses, we study the algebraic part of certain twisted L-values for E/F. The Birch and Swinnerton-Dyer conjecture predicts that these L-values are squares of rational numbers. We show that this question is related to the ratio of Petersson inner products of a quaternionic form on a definite quaternion algebra over Q and its base change to F.     

Complete convergence theorems for L-mixingales

Sufficient conditions for the complete convergence for the partial sums and the random selected partial sums of L^p-mixingales are given. Necessary conditions are also discussed.     

The N threshold policy for the GI/M/1 queue

We study a GI/M/1 queue with an N threshold policy. In this system, the server stops attending the queue when the system becomes empty and resumes serving the queue when the number of customers reaches a threshold value N. Using the embeded Markov chain method, we obtain the stationary distributions of queue length and waiting time and prove the stochastic decomposition properties.     

On properties of discrete (r, q) and (s, T) inventory systems

We consider single-item (r, q) and (s, T) inventory systems with integer-valued demand processes. While most of the inventory literature studies continuous approximations of these models and establishes joint convexity properties of the policy parameters in the continuous space, we show that these properties no longer hold in the discrete space, in the sense of linear interpolation extension and L^?-convexity. This nonconvexity can lead to failure of optimization techniques based on local optimality to obtain the optimal inventory policies. It can also make certain comparative properties established previously using continuous variables invalid. We revise these properties in the discrete space.     

Finding the K shortest hyperpaths using reoptimization

We present some reoptimization techniques for computing (shortest) hyperpath weights in a directed hypergraph. These techniques are exploited to improve the worst-case computational complexity (as well as the practical performance) of an algorithm finding the K shortest hyperpaths in acyclic hypergraphs.