A non-separable solution of the diffusion equation based on the Galerkin’s method using cubic splines

The two dimensional diffusion equation of the form is considered in this paper. We try a bi-cubic spline function of the form as its solution. The initial coefficients C_i,j(0) are computed simply by applying a collocation method; C_i,j = f(x_i, y_j) where f(x, y) = u(x, y, 0) is the given initial condition. Then the coefficients C_i,j(t) are computed by X(t) = e^tQX(0) where X(t) = (C_0,1, C_0,1, C_0,2, … , C_0,N, C_1,0, … , C_N,N) is a one dimensional array and the square matrix Q is derived from applying the Galerkin’s method to the diffusion equation. Note that this expression provides a solution that is not necessarily separable in space coordinates x, y. The results of sample calculations for a few example problems along with the calculation results of approximation errors for a problem with known analytical solution are included.     

Permanence and Positive Periodic Solutions for Kolmogorov Competing Species Systems

We prove the existence of periodic solutions in a compact attractor of (R⁺)ⁿ for the Kolmogorov system x′_i = x_if_i(t, x₁, …, x_n), i = l, …, n in the competitive case. Extension to differential delay equations are con- sidered too. Applications are given to Lotka-Volterra systems with periodic coefficients.     

Uniform approximation by some Hermite interpolating splines

In this paper some upper bound for the error ∥ s-f ∥_∞ is given, where f ε C¹[a,b], but s is a so-called Hermite spline interpolant (HSI) of degree 2q ?1 such that f(x_i) = s(x_i), f′(rmx_i) = s′(x_i), s^(j) (x_i) = 0 (i = 0, 1, …, n; j = 2, 3, …, q ?1; n > 0, q > 0) and the knots x_i are such that a = x₀ < x₁ < … < x_n = b. Necessary and sufficient conditions for the existence of convex HSI are given and upper error bound for approximation of the function fε C¹[a, b] by convex HSI is also given.     

Nonsingularity of matrices associated with classes of arithmetical functions on lcm-closed sets

Let S = {x₁, … , x_n} be a set of n distinct positive integers and f be an arithmetical function. Let [f(x_i, x_j)] denote the n × n matrix having f evaluated at the greatest common divisor (x_i, x_j) of x_i and x_j as its i, j-entry and (f[x_i, x_j]) denote the n × n matrix having f evaluated at the least common multiple [x_i, x_j] of x_i and x_j as its i, j-entry. The set S is said to be lcm-closed if [x_i, x_j] ∈ S for all 1 ? i, j ? n. For an integer x > 1, let ω(x) denote the number of distinct prime factors of x. Define ω(1) = 0. In this paper, we show that if S = {x₁, … , x_n} is an lcm-closed set satisfying , and if f is a strictly increasing (resp. decreasing) completely multiplicative function, or if f is a strictly decreasing (resp. increasing) completely multiplicative function satisfying (resp. f(p) ? p) for any prime p, then the matrix [f(x_i, x_j)] (resp. (f[x_i, x_j])) defined on S is nonsingular. By using the concept of least-type multiple introduced in [S. Hong, J. Algebra 281 (2004) 1-14], we also obtain reduced formulas for det(f(x_i, x_j)) and det(f[x_i, x_j]) when f is completely multiplicative and S is lcm-closed. We also establish several results about the nonsingularity of LCM matrices and reciprocal GCD matrices.     

Normal Forms for Nonautonomous Differential Equations

We extend Henry Poincarés normal form theory for autonomous differential equations x=f(x) to nonautonomous differential equations x=f(t, x). Poincarés nonresonance condition λ_j−∑ⁿ_i=1 ?_iλ_i≠0 for eigenvalues is generalized to the new nonresonance condition λ_j∩∑ⁿ_i=1 ?_iλ_i=∅ for spectral intervals.     

Positive solution of singular Dirichlet boundary value problems for second order differential equation system

This paper investigates the existence of positive solutions of singular Dirichlet boundary value problems for second order differential system. A necessary and sufficient condition for the existence of C[0,1]×C[0,1] positive solutions as well as C¹[0,1]×C¹[0,1] positive solutions is given by means of the method of lower and upper solutions and the fixed point theorems. Our nonlinearity fi(t,x₁,x₂) may be singular at x₁=0, x₂=0, t=0 and/or t=1, i=1,2.     

A note on reflexivity in Banach spaces

For any normed spaceX, the unit ball ofX is weak *-dense in the unit ball ofX ^**. This says that for any ε>0, for anyF in the unit ball ofX ^**, and for anyf ₁,…,f _n inX ^*, the system of inequalities |f _i(x)?F(f _i)|≤ε can be solved for somex in the unit ball ofX. The author shows that the requirement that ε be strictly positive can be dropped only ifX is reflexive.     

Multidimensional analog of the Hardy condition for power series

In the middle of the 20th century Hardy obtained a condition which must be imposed on a formal power series f(x) with positive coefficients in order that the series f ⁻¹(x) = $ \sum\limits_{n = 0}^\infty {b_n x^n } $ \sum\limits_{n = 0}^\infty {b_n x^n } b _n x ⁿ be such that b ₀ > 0 and b _n ≤ 0, n ≥ 1. In this paper we find conditions which must be imposed on a multidimensional series f(x ₁, x ₂, …, x _m ) with positive coefficients in order that the series f ⁻¹(x ₁, x ₂, …, x _m ) = $ \sum i_1 ,i_2 , \ldots ,i_m \geqslant 0^b i_1 ,i_2 , \ldots ,i_m ^{x_1^{i_1 } x_2^{i_2 } \ldots x_m^{i_m } } $ \sum i_1 ,i_2 , \ldots ,i_m \geqslant 0^b i_1 ,i_2 , \ldots ,i_m ^{x_1^{i_1 } x_2^{i_2 } \ldots x_m^{i_m } } satisfies the property b _{0, …, 0} > 0, $ bi_1 ,i_2 , \ldots ,i_m $ bi_1 ,i_2 , \ldots ,i_m ≤ 0, i ₁² + i ₂² + … + i _m ² > 0, which is similar to the one-dimensional case.     

Polynomial Cunningham chains

A sequence of prime numbers p₁,p₂,p₃,…, such that pi=2pi−1+? for all i, is called a Cunningham chain of the first or second kind, depending on whether ?=1 or −1 respectively. If k is the smallest positive integer such that 2pk+? is composite, then we say the chain has length k. It is conjectured that there are infinitely many Cunningham chains of length k for every positive integer k. A sequence of polynomials f₁(x),f₂(x),… in Z[x], such that f₁(x) has positive leading coefficient, each fi(x) is irreducible in Q[x] and fi(x)=xfi−1(x)+? for all i, is defined to be a polynomial Cunningham chain of the first or second kind, depending on whether ?=1 or −1 respectively. If k is the least positive integer such that fk+1(x) is reducible in Q[x], then we say the chain has length k. In this article, for polynomial Cunningham chains of both kinds, we prove that there are infinitely many chains of length k and, unlike the situation in the integers, that there are infinitely many chains of infinite length, by explicitly giving infinitely many polynomials f₁(x), such that fk+1(x) is the only term in the sequence that is reducible.     

An optimal filtering method for stable analytic continuation

In this paper, we consider the problem of numerical analytic continuation of an analytic function f(z)=f(x+iy) on a strip domain Ω⁺={z=x+iy∈C∣x∈R,0<y<y₀}, where the data is given approximately only on the real axis y=0. This problem is severely ill-posed: the solution does not depend continuously on the given data. A novel method (filtering) is used to solve this problem and an optimal error estimate with Hölder type is proved. Numerical examples show that this method works effectively.     

Pointwise Estimate for Linear Combinations of Bernstein-Kantorovich Operators

For linear combinations of Bernstein-Kantorovich operators K_n, r(f, x), we give an equivalent theorem with ω^2r_?^λ(f, t). The theorem unites the corresponding results of classical and Ditzian-Totik moduli of smoothness.     

A new inequality for symmetric functions

Let x_i ≥ 0, y_i ≥ 0 for i = 1,…, n; and let a_j(x) be the elementary symmetric function of n variables given by a_j(x) = ∑_{1 ≤ ii < … <ij ≤ n}x_ii … x_ij. Define the partical ordering x <y if a_j(x) ≤ a_j(y), j = 1,… n. We show that $\text{x}\text{\$}\text{?}\text{y ? x}{}^{\mathrm{\alpha }}\text{\$}\text{?}\text{y}{}^{\mathrm{\alpha }}\text{, 0}\text{\$}\text{?}\text{α ≤ 1}$, where {x^α}_i = x^α_i. We also give a necessary and sufficient condition on a function f(t) such that x <y ? f(x) <f(y). Both results depend crucially on the following: If x <y there exists a piecewise differentiable path z(t), with z_i(t) ≥ 0, such that z(0) = x, z(1) = y, and z(s) <z(t) if 0 ≤ s ≤ t ≤ 1.     

Full friendly index sets of Cartesian products of two cycles

Let G =（V, E） be a connected simple graph. A labeling f ： V → Z2 induces an edge labeling f＊ ： E → Z2 defined by f＊（xy） = f（x） ＋f（y） for each xy ∈ E. For i ∈ Z2, let vf（i） = ｜f^-1（i）｜ and ef（i） = ｜f＊^-1（i）｜. A labeling f is called friendly if ｜vf（1） - vf（0）｜ ≤ 1. For a friendly labeling f of a graph G, we define the friendly index of G under f by if（G） = e（1） - el（0）. The set [if（G） ｜ f is a friendly labeling of G} is called the full friendly index set of G, denoted by FFI（G）. In this paper, we will determine the full friendly index set of every Cartesian product of two cycles.     

Padé-type approximants with orthogonal generating polynomials

The interpolation of the function x → 1/(1 ? xt) generating the series f(t) = ∑^∞_{i = 0}c_itⁱ at the zeros of an orthogonal polynomial with respect to a distribution d α satisfying some conditions will give us a process for accelerating the convergence of f_n(t) = ∑ⁿ_{i = 0}c_itⁱ. Then, we shall see that the polynomial of best approximation of x → 1/(1 ? xt) over some interval or its development in Chebyshev polynomials T_n or U_n are only particular cases of the main theorem.At last, we shall show that all these processes accelerate linear combinations with positive coefficients of totally monotonic and oscillating sequences.     

Elliptic equation with a singular potential in a domain with a conic point

This paper deals with the behavior of the nonnegative solutions of the problem $$- \Delta u = V(x)u, \left. u \right|\partial \Omega = \varphi (x)$$ in a conical domain Ω ? ? ⁿ , n ≥ 3, where 0 ≤ V (x) ∈ L₁(Ω), 0 ≤ ?(x) ∈ L₁(?Ω) and ?(x) is continuous on the boundary ?Ω. It is proved that there exists a constant C _*(n) = (n ? 2)²/4 such that if V ₀(x) = (c + λ ₁)|x|^?2, then, for 0 ≤ c ≤ C _*(n) and V(x) ≤ V ₀(x) in the domain Ω, this problem has a nonnegative solution for any nonnegative boundary function ?(x) ∈ L ₁(?Ω); for c > C _*(n) and V(x) ≥ V ₀(x) in Ω, this problem has no nonnegative solutions if ?(x) > 0.     

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.     

A dynamic adaptive local search algorithm for the circular packing problem

This paper studies the circular packing problem (CPP) which consists of packing n non-identical circles C_i of known radius r_i, i ∈ N = {1, … , n}, into the smallest containing circle C. The objective is to determine the coordinates (x_i, y_i) of the center of C_i, i ∈ N, as well as the radius r and center (x, y) of C. This problem, which is a variant of the two-dimensional open dimension problem, is solved using a two-step, dynamic, adaptive, local search algorithm. At each iteration, the algorithm identifies the set of potential “best local positions” of a circle C_i, i ∈ N, given the positions of the previously packed circles, and determines for each of these positions the coordinates and radius of the smallest containing circle. The “best local position” minimizes the radius of the current containing circle. That is, every time an additional circle is packed, both the center and the radius of the containing circle are dynamically updated, and the smallest containing circle is known. The experimental results reflect the good performance of the algorithm.     

Existence of a positive solution to a system of discrete fractional boundary value problems

We analyze a system of discrete fractional difference equations subject to nonlocal boundary conditions. We consider the system of equations given by -Δ^ν_iy_i(t)=λ_ia_i(t+ν_i-1)f_i(y₁(t+ν₁-1),y₂(t+ν₂-1)), for t∈[0,b]_N0, subject to y_i(ν_i − 2) = ψ_i(y_i) and y_i(ν_i + b) = ?_i(y_i), for i = 1, 2, where ψ_i,?_i:R^b+3→R are given functionals. We also assume that ν_i ∈ (1, 2], for each i. Although we assume that both a_i and f_i(y₁, y₂) are nonnegative for each i, we do not necessarily presume that each ψ_i(y_i) and ?_i(y_i) is nonnegative for each i and each y_i ? 0. This generalizes some recent results both on discrete fractional boundary value problems and on discrete integer-order boundary value problems, and our techniques provide new results in each case.