A class of difference scheme for solving telegraph equation by new non-polynomial spline methods

In this paper, by using a new non-polynomial parameters cubic spline in space direction and compact finite difference in time direction, we get a class of new high accuracy scheme of O(τ⁴ + h²) and O(τ⁴ + h⁴) for solving telegraph equation if we suitably choose the cubic spline parameters. Meanwhile, stability condition of the difference scheme has been carried out. Finally, numerical examples are used to illustrate the efficiency of the new difference scheme.     

Asymptotically Nonexpansive Mappings in Modular Function Spaces

In this paper, we prove that if ρ is a convex, σ-finite modular function satisfying a Δ₂-type condition, C a convex, ρ-bounded, ρ-a.e. compact subset of L_ρ, and T: C → C a ρ-asymptotically nonexpansive mapping, then T has a fixed point. In particular, any asymptotically nonexpansive self-map defined on a convex subset of L¹(Ω, μ) which is compact for the topology of local convergence in measure has a fixed point.     

Control parameter estimation in a semi-linear parabolic inverse problem using a high accurate method

Parabolic inverse problems have an important role in many branches of science and technology. The aim of this research work is to solve these classes of equations using a high order compact finite difference scheme. We consider the following inverse problem for finding u(x, t) and p(t) governed by u_t = u_xx + p(t)u + φ(x, t) with an over specified condition inside the domain. Spatial derivatives are approximated using central difference scheme. The time advancement of the simulation is performed using a “third order compact Runge-Kutta method”. The convergence orders for the approximation of both u and p are of o(k³ + h²) which improves the results obtained in the literature. An exact test case is used to evaluate the validity of our numerical analysis. We found that the accuracy of the results is better than that of previous works in the literature.     

A note on shadowing with chain transitivity

Let f : X → X be a continuous map of a compact metric space X. The map f induces in a natural way a map f_M on the space M(X) of probability measures on X, and a transformation f_K on the space K(X) of closed subsets of X. In this paper, we show that if (X, f) is a chain transitive system with shadowing property, then exactly one of the following two statements holds:

(a)

fⁿ and (f_K)ⁿ are syndetically sensitive for all n ? 1.

(b)

fⁿ and (f_K)ⁿ are equicontinuous for all n ? 1.

In particular, we show that for a continuous map f : X → X of a compact metric space X with infinite elements, if f is a chain transitive map with the shadowing property, then fⁿ and (f_K)ⁿ are syndetically sensitive for all n ? 1. Also, we show that if f_M (resp. f_K) is chain transitive and syndetically sensitive, and f_M (resp. f_K) has the shadowing property, then f is sensitive.In addition, we introduce the notion of ergodical sensitivity and present a sufficient condition for a chain transitive system (X, f) (resp. (M(X), f_M)) to be ergodically sensitive. As an application, we show that for a L-hyperbolic homeomorphism f of a compact metric space X, if f has the AASP, then fⁿ is syndetically sensitive and multi-sensitive for all n ? 1.     

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.     

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.     

An analytical comparison of the LP relaxations of integer models for the k-club problem

Given an undirected graph G = (V, E), a k-club is a subset of nodes that induces a subgraph with diameter at most k. The k-club problem is to find a maximum cardinality k-club. In this study, we use a linear programming relaxation standpoint to compare integer formulations for the k-club problem. The comparisons involve formulations known from the literature and new formulations, built in different variable spaces. For the case k = 3, we propose two enhanced compact formulations. From the LP relaxation standpoint these formulations dominate all other compact formulations in the literature and are equivalent to a formulation with a non-polynomial number of constraints. Also for k = 3, we compare the relative strength of LP relaxations for all formulations examined in the study (new and known from the literature). Based on insights obtained from the comparative study, we devise a strengthened version of a recursive compact formulation in the literature for the k-club problem (k > 1) and show how to modify one of the new formulations for the case k = 3 in order to accommodate additional constraints recently proposed in the literature.     

Weak separation axioms and weak covering properties

We identify some remnants of normality and call them rudimentary normality, generalize the concept of submetacompact spaces to that of a weakly subparacompact space and that of a weakly^? subparacompact space, and make a simultaneous generalization of collectionwise normality and screenability with the introduction of what is to be called collectionwise σ-normality. With these weak properties, we show that,1) on weakly subparacompact spaces, countable compactness = compactness, ω₁-compactness = Lindelöfness;2) on weakly subparacompact Hausdorff spaces with rudimentary normality, regularity = normality = countable paracompactness; and3) on weakly subparacompact regular T₁-spaces with rudimentary normality, collectionwise σ-normality = screenability = collectionwise normality = paracompactness.The famous Normal Moore Space Conjecture is thus given an even more striking appearance and Worrell and Wicke?s factorization of paracompactness (over Hausdorff spaces) along with Krajewski?s are combined and strengthened. The methodology extends itself to the factorization of paracompactness on locally compact, locally connected spaces in the manner of Gruenhage and on locally compact spaces in that of Tall, and to the factorization of subparacompactness and metacompactness in the genre of Katuta, Chaber, Junnila and Price and Smith and that of Boone, improving all of them.     

A new off-step high order approximation for the solution of three-space dimensional nonlinear wave equations

In this paper, we propose a new high accuracy numerical method of O(k² + k²h² + h⁴) based on off-step discretization for the solution of 3-space dimensional non-linear wave equation of the form u_tt = A(x,y,z,t)u_xx + B(x,y,z,t)u_yy + C(x,y,z,t)u_zz + g(x,y,z,t,u,u_x,u_y,u_z,u_t), 0 < x,y,z < 1,t > 0 subject to given appropriate initial and Dirichlet boundary conditions, where k > 0 and h > 0 are mesh sizes in time and space directions respectively. We use only seven evaluations of the function g as compared to nine evaluations of the same function discussed in  and . We describe the derivation procedure in details of the algorithm. The proposed numerical algorithm is directly applicable to wave equation in polar coordinates and we do not require any fictitious points to discretize the differential equation. The proposed method when applied to a telegraphic equation is also shown to be unconditionally stable. Comparative numerical results are provided to justify the usefulness of the proposed method.     

Meromorphic Functions That Share Fixed-Points

In this paper, we prove the following result: Let f(z) and g(z) be two nonconstant meromorphic(entire) functions, n ≥ 11(n ≥ 6) a positive integer. If fⁿ(z)f′(z) and gⁿ(z)g′(z) have the same fixed-points, then either f(z) = c₁e^cz2, g(z) = c₂e^− cz2, where c₁, c₂, and c are three constants satisfying 4(c₁c₂)^n + 1c² = −1, or f(z) ≡ tg(z) for a constant t such that t^n + 1 = 1.     

One-point pseudospectral collocation for the one-dimensional Bratu equation

The one-dimensional planar Bratu problem is u_xx + λ exp(u) = 0 subject to u(±1) = 0. Because there is an analytical solution, this problem has been widely used to test numerical and perturbative schemes. We show that over the entire lower branch, and most of the upper branch, the solution is well approximated by a parabola, u(x) ≈ u₀ (1 − x²) where u₀ is determined by collocation at a single point x = ξ. The collocation equation can be solved explicitly in terms of the Lambert W-function as u(0) ≈ −W(−λ(1 − ξ²)/2)/(1 − ξ²) where both real-valued branches of the W-function yield good approximations to the two branches of the Bratu function. We carefully analyze the consequences of the choice of ξ. We also analyze the rate of convergence of a series of even Chebyshev polynomials which extends the one-point approximation to arbitrary accuracy. The Bratu function is so smooth that it is actually poor for comparing methods because even a bad, inefficient algorithm is successful. It is, however, a solution so smooth that a numerical scheme (the collocation or pseudospectral method) yields an explicit, analytical approximation. We also fill some gaps in theory of the Bratu equation. We prove that the general solution can be written in terms of a single, parameter-free β(x) without knowledge of the explicit solution. The analytical solution can only be evaluated by solving a transcendental eigenrelation whose solution is not known explicitly. We give three overlapping perturbative approximations to the eigenrelation, allowing the analytical solution to be easily evaluated throughout the entire parameter space.     

On some special codes over Fp + uFp + uFp

We define a new map between codes over F_p + uF_p + u²F_p and F_p which is different to that defined in [2]. It is proved that the image of the linear cyclic code over the commutative ring F_p + uF_p + u²F_p with length n under this map is a distance-invariant quasi-cyclic code of index p² with length p²n over F_p. Moreover, it is proved that, if (n, p) = 1, then every code with length p²n over F_p which is the image of a linear (1 − u²)-cyclic code with length n over F_p + uF_p + u²F_p under this map is permutation equivalent to a quasi-cyclic code of index p².     

On single and double Soules matrices

Until now the concept of a Soules basis matrix of sign patternN consisted of an orthogonal matrix R∈R^n,n, generated in a certain way from a positive n-vector, which has the property that for any diagonal matrix Λ = diag(λ₁, … , λ_n), with λ₁ ? ? ? λ_n ? 0, the symmetric matrix A = RΛR^T has nonnegative entries only. In the present paper we introduce the notion of a pair of double Soules basis matrices of sign patternN which is a pair of matrices (P, Q), each in R^n,n, which are not necessarily orthogonal and which are generated in a certain way from two positive vectors, but such that PQ^T = I and such that for any of the aforementioned diagonal matrices Λ, the matrix A = PΛQ^T (also) has nonnegative entries only. We investigate the interesting properties which such matrices A have.As a preamble to the above investigation we show that the iterates, , generated in the course of the QR-algorithm when it is applied to A = RΛR^T, where R is a Soules basis matrix of sign pattern N, are again symmetric matrices generated by the Soules basis matrices R_k of sign pattern N which are themselves modified as the algorithm progresses.Our work here extends earlier works by Soules and Elsner et al.     

Properties of non-simultaneous blow-up in heat equations coupled via different localized sources

This paper deals with u_t = Δu + u^m(x, t)e^pv(0,t), v_t = Δv + u^q(0, t)e^nv(x,t), subject to homogeneous Dirichlet boundary conditions. The complete classification on non-simultaneous and simultaneous blow-up is obtained by four sufficient and necessary conditions. It is interesting that, in some exponent region, large initial data u₀(v₀) leads to the blow-up of u(v), and in some betweenness, simultaneous blow-up occurs. For all of the nonnegative exponents, we find that u(v) blows up only at a single point if m > 1(n > 0), while u(v) blows up everywhere for 0 ? m ? 1 (n = 0). Moreover, blow-up rates are considered for both non-simultaneous and simultaneous blow-up solutions.     

Existence, attractiveness and stability of solutions for quadratic Urysohn fractional integral equations

In this paper, existence and attractiveness of solutions for quadratic Urysohn fractional integral equations on an unbounded interval are obtained by virtue of Tichonov fixed point theorem and suitable conjunction of the well known measure ω₀(X) and the spaces C(R⁺). Further, three certain solutions sets X_L,γ, X_1,α and X_{1,(1−(α+v))}, which tending to zero at an appropriate rate t^−ν (ν > 0), ν = γ (or α or 1 − (α + v)) as t → ∞, are introduced and stability of solutions for quadratic Urysohn fractional integral equations are obtained based on these solutions sets respectively by applying Schauder fixed point theorem via some easy checked conditions. An example is given to illustrate the results.     

Devaney’s chaos on uniform limit maps

Let (X, d) be a compact metric space and f_n : X → X a sequence of continuous maps such that (f_n) converges uniformly to a map f. The purpose of this paper is to study the Devaney’s chaos on the uniform limit f. On the one hand, we show that f is not necessarily transitive even if all f_n mixing, and the sensitive dependence on initial conditions may not been inherited to f even if the iterates of the sequence have some uniform convergence, which correct two wrong claims in [1]. On the other hand, we give some equivalence conditions for the uniform limit f to be transitive and to have sensitive dependence on initial conditions. Moreover, we present an example to show that a non-transitive sequence may converge uniformly to a transitive map.