A smoothing self-adaptive Levenberg-Marquardt algorithm for solving system of nonlinear inequalities

In this paper, we consider the smoothing self-adaptive Levenberg-Marquardt algorithm for the system of nonlinear inequalities. By constructing a new smoothing function, the problem is approximated via a family of parameterized smooth equations H(x) = 0. A smoothing self-adaptive Levenberg-Marquardt algorithm is proposed for solving the system of nonlinear inequalities based on the new smoothing function. The Levenberg-Marquardt parameter μ_k is chosen as the product of μ_k = ∥H^k∥^δ with δ ∈ (0, 2] being a positive constant. We will show that if ∥H^k∥^δ provides a local error bound, which is weaker than the non-singularity, the proposed method converges superlinearly to the solution for δ ∈ (0, 1), while quadratically for δ ∈ [1, 2]. Numerical results show that the new method performs very well for system of inequalities.     

Optimal weighted estimates of the flows in exterior domains

In this paper, we prove some decay properties of global solutions for the Navier-Stokes equations in an exterior domain Ω⊂Rⁿ, n=2,3.When a domain has a boundary, the pressure term is troublesome since we do not have enough information on the pressure near the boundary. To overcome this difficulty, by multiplying a special form of test functions, we obtain an integral equation. He-Xin (2000) [12] first introduced this method and then Bae-Jin (2006, 2007) [1] and [13] modified their method to obtain better decay rates. Also, Bae-Roh (2009) [11] improved Bae-Jin’s results. Unfortunately, their results were not optimal, because there exists an unpleasant positive small δ in their rates.In this paper, we obtain the following optimal rate without δ,

     

Approximability of single machine scheduling with fixed jobs to minimize total completion time

We consider the single machine scheduling problem to minimize total completion time with fixed jobs, precedence constraints and release dates. There are some jobs that are already fixed in the schedule. The remaining jobs are free to be assigned to any free-time intervals on the machine in such a way that they do not overlap with the fixed jobs. Each free job has a release date, and the order of processing the free jobs is restricted by the given precedence constraints. The objective is to minimize the total completion time. This problem is strongly NP-hard. Approximability of this problem is studied in this paper. When the jobs are processed without preemption, we show that the problem has a linear-time n-approximation algorithm, but no pseudopolynomial-time (1 − δ)n-approximation algorithm exists even if all the release dates are zero, for any constant δ > 0, if P ≠ NP, where n is the number of jobs; for the case that the jobs have no precedence constraints and no release dates, we show that the problem has no pseudopolynomial-time (2 − δ)-approximation algorithm, for any constant δ > 0, if P ≠ NP, and for the weighted version, we show that the problem has no polynomial-time 2^q(n)-approximation algorithm and no pseudopolynomial-time q(n)-approximation algorithm, where q(n) is any given polynomial of n. When preemption is allowed, we show that the problem with independent jobs can be solved in O(n log n) time with distinct release dates, but the weighted version is strongly NP-hard even with no release dates; the problems with weighted independent jobs or with jobs under precedence constraints are shown having polynomial-time n-approximation algorithms. We also establish the relationship of the approximability between the fixed job scheduling problem and the bin-packing problem.     

On fractional integration formulae for Aleph functions

This paper is devoted to the study of a new special function, which is called, according to the symbol used to represent this function, as an Aleph function. This function is an extension of the I-function, which itself is a generalization of the well-known and familiar G- and H-functions in one variable. In this paper, a notation and complete definition of the Aleph function will be presented. Fractional integration of the Aleph functions, in which the argument of the Aleph function contains a factor t^λ(1 − t)^μ, λ, μ > 0, will be investigated. The results derived are of most general character and include many results given earlier by various authors including Kilbas [10], Kilbas and Saigo [11] and Galué [6] and others. The results obtained form the key formulae for the results on various potentially useful special functions of physical and biological sciences and technology available in the literature.     

Uniqueness of positive radial solutions for quasilinear elliptic equations in an annulus

Extending a previous result of Tang [1] we prove the uniqueness of positive radial solutions of Δ_pu+f(u)=0, subject to Dirichlet boundary conditions on an annulus in Rⁿ with 2<p≤n, under suitable hypotheses on the nonlinearity f. This argument also provides an alternative proof for the uniqueness of positive solutions of the same problem in a finite ball (see [9]), in the complement of a ball or in the whole space Rⁿ (see [10], [3] and [11]).     

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].     

Small Entire Functions with Infinite Growth Index

In this paper, we prove that given μ > 0 there exists a dense linear manifold M of entire functions, such that,[formula]for every f ∈ M and l straight line and with infinite growth index for all non-null functions of M. Moreover, every non-null function of M has exactly 2([2μ] + 1) Julia directions. And if l is a straight line that does not contain a Julia line, then for every f ∈ M[formula]and for j ≥ 1, f^(j) is bounded and integrable with respect to the length measure on l and ∫_lf^(j) = 0.     

Multipartite Moore digraphs

We derive some Moore-like bounds for multipartite digraphs, which extend those of bipartite digraphs, under the assumption that every vertex of a given partite set is adjacent to the same number δ of vertices in each of the other independent sets. We determine when a multipartite Moore digraph is weakly distance-regular. Within this framework, some necessary conditions for the existence of a r-partite Moore digraph with interpartite outdegree δ > 1 and diameter k = 2m are obtained. In the case δ = 1, which corresponds to almost Moore digraphs, a necessary condition in terms of the permutation cycle structure is derived. Additionally, we present some constructions of dense multipartite digraphs of diameter two that are vertex-transitive.     

Matrix inverse problem and its optimal approximation problem for R-skew symmetric matrices

Let R ∈ C^n×n be a nontrivial involution, i.e., R² = I and R ≠ ±I. A matrix A ∈ C^n×n is called R-skew symmetric if RAR = −A. The least-squares solutions of the matrix inverse problem for R-skew symmetric matrices with R∗ = R are firstly derived, then the solvability conditions and the solutions of the matrix inverse problem for R-skew symmetric matrices with R∗ = R are given. The solutions of the corresponding optimal approximation problem with R∗ = R for R-skew symmetric matrices are also derived. At last an algorithm for the optimal approximation problem is given. It can be seen that we extend our previous results [G.X. Huang, F. Yin, Matrix inverse problem and its optimal approximation problem for R-symmetric matrices, Appl. Math. Comput. 189 (2007) 482-489] and the results proposed by Zhou et al. [F.Z. Zhou, L. Zhang, X.Y. Hu, Least-square solutions for inverse problem of centrosymmetric matrices, Comput. Math. Appl. 45 (2003) 1581-1589].     

On varieties of MV-algebras with internal states

In [4] and [5] the authors introduced the variety SMV of MV-algebras with an internal operator, state MV-algebras. In [2] and [3] the authors gave a stronger version of state MV-algebras, called state-morphism MV-algebras. In this paper we continue the studies presented in [2] and [3] just looking at several proper subvarieties of SMV, obtained by imposing suitable conditions on the behavior of the internal operator.     

A quadratic programming approach to the Randić index

Let G(k, n) be the set of connected graphs without multiple edges or loops which have n vertices and the minimum degree of vertices is k. The Randi? index χ = χ(G) of a graph G   is defined by χ(G)=_∑(uv)(_δuδv)^-1/2$\chi (G)={\sum }_{(\mathit{uv})}({\delta }_u{\delta }_v{)}^{-1/2}$, where δ_u is the degree of vertex u and the summation extends over all edges (uv) of G. Caporossi et al. [G. Caporossi, I. Gutman, P. Hansen, Variable neighborhood search for extremal graphs IV: Chemical trees with extremal connectivity index, Computers and Chemistry 23 (1999) 469–477] proposed the use of linear programming as one of the tools for finding the extremal graphs. In this paper we introduce a new approach based on quadratic programming for finding the extremal graphs in G(k, n) for this index. We found the extremal graphs or gave good bounds for this index when the number n_k of vertices of degree k is between n − k and n. We also tried to find the graphs for which the Randi? index attained its minimum value with given k (k ? n/2) and n. We have solved this problem partially, that is, we have showed that the extremal graphs must have the number n_k of vertices of degree k less or equal n − k and the number of vertices of degree n − 1 less or equal k.     

Roll cutting in the curtain industry,or: A well-solvable allocation problem

We study the problem of cutting a number of pieces of the same length from n rolls of different lengths so that the remaining part of each utilized roll is either sufficiently short or sufficiently long. A piece is ‘sufficiently short’, if it is shorter than a pre-specified threshold value δ_min, so that it can be thrown away as it cannot be used again for cutting future orders. And a piece is ‘sufficiently long’, if it is longer than a pre-specified threshold value δ_max (with δ_max > δ_min), so that it can reasonably be expected to be usable for cutting future orders of almost any length. We show that this problem, faced by a curtaining wholesaler, is solvable in O(nlogn) time by analyzing a non-trivial class of allocation problems.     

Additive results for the generalized Drazin inverse in a Banach algebra

In this paper we investigate additive properties of the generalized Drazin inverse in a Banach algebra. We find some new conditions under which the generalized Drazin inverse of the sum a + b could be explicitly expressed in terms of a, a^d, b, b^d. Also, some recent results of Castro and Koliha [New additive results for the g-Drazin inverse, Proc. Roy. Soc. Edinburgh Sect. A 134 (2004) 1085-1097] are extended.     

A bifurcation theorem for the p-logistic equation

We consider a p-logistic equation with an equidiffusive reaction. Using variational methods and truncation techniques, we show that there is a critical parameter value λ^∗ > 0 such that for λ > λ^∗ the problem has a unique positive smooth solution, and for λ ∈ (0, λ^∗] the problem has no positive solution.     

New characterizations of EP, generalized normal and generalized Hermitian elements in rings

We present a number of new characterizations of EP elements in rings with involution in purely algebraic terms. Then, we study equivalent conditions for an element a in a ring with involution to satisfy aⁿa^∗ = a^∗aⁿ or aⁿ = (a^∗)ⁿ for arbitrary n ∈ N. For n = 1, we present some new characterizations of normal and Hermitian elements in rings with involution.     

Tripled coincidence theorems for contractive type mappings in partially ordered metric spaces

In this paper we introduce the concept of a tripled coincidence point for a pair of nonlinear contractive mappings F : X³ → X and g : X → X. The obtained results extend recent coincidence theorems due to ?iri? and Lakshmikantham [V. Lakshmikantham, L. ?iri?, L., Coupled fixed point theorems for nonlinear contractions in partially ordered metric spaces, Nonlinear Anal. 70 (2009) 4341-4349].     

LSQR iterative common symmetric solutions to matrix equations AXB = E and CXD = F

A new matrix based iterative method is presented to compute common symmetric solution or common symmetric least-squares solution of the pair of matrix equations AXB = E and CXD = F. By this iterative method, for any initial matrix X₀, a solution X^∗ can be obtained within finite iteration steps if exact arithmetic was used, and the solution X^∗ with the minimum Frobenius norm can be obtained by choosing a special kind of initial matrix. In addition, the unique nearest common symmetric solution or common symmetric least-squares solution to given matrix in Frobenius norm can be obtained by first finding the minimum Frobenius norm common symmetric solution or common symmetric least-squares solution of the new pair of matrix equations. The given numerical examples show that the matrix based iterative method proposed in this paper has faster convergence than the iterative methods proposed in [1] and [2] to solve the same problems.     

Fourier series of half-range functions by smooth extension

This paper considers Fourier series approximations of one- and two-dimensional functions over the half-range, that is, over the sub-interval [0, L] of the interval [−L, L] in one-dimensional problems and over the sub-domain [0, L_x] × [0, L_y] of the domain [−L_x, L_x] × [−L_y, L_y] in two-dimensional problems. It is shown how to represent these functions using a Fourier series that employs a smooth extension. The purpose of the smooth extension is to improve the convergence characteristics otherwise obtained using the even and odd extensions. Significantly improved convergence characteristics are illustrated in one-dimensional and two-dimensional problems.     

Minimal Positive Solutions to Some Singular Second-Order Differential Equations

The existence of a minimal C¹[0, 1] positive solution is established for some second-order singular boundary value and initial value problems by new schemes, which are related to x′. Our nonlinearity may be singular at t = 0, 1, x = 0, or x′ = 0.