An algebraic equation for linear operators

Let T be a linear operator on a vector space V, possibly of infinite dimension, over a general field K. We solve the functional equation p(T) = F where p ∈ K[x] and F, an algebraic operator on V, are given. For nilpotent F we give an explicit linear system which determines the solutions by their similarity classes. The method is based on a canonical decomposition theorem.     

On the positive definite solutions of nonlinear matrix equation X + A⋆ X−δA = Q

In this paper we consider the positive definite solutions of nonlinear matrix equation X + A^⋆X^−δA = Q, where δ ∈ (0, 1], which appears for the first time in [S.M. El-Sayed, A.C.M. Ran, On an iteration methods for solving a class of nonlinear matrix equations, SIAM J. Matrix Anal. Appl. 23 (2001) 632–645]. The necessary and sufficient conditions for the existence of a solution are derived. An iterative algorithm for obtaining the positive definite solutions of the equation is discussed. The error estimations are found.     

Calculation of a static potential created by plane fractal cluster

In this paper we demonstrate new approach that can help in calculation of electrostatic potential of a fractal (self-similar) cluster that is created by a system of charged particles. For this purpose we used the simplified model of a plane dendrite cluster [1] that is generated by a system of the concentric charged rings located in some horizontal plane (see Fig. 2). The radiuses and charges of the system of concentric rings satisfy correspondingly to relationships: r_n = r₀ξⁿ and e_n = e₀bⁿ, where n determines the number of a current ring. The self-similar structure of the system considered allows to reduce the problem to consideration of the functional equation that similar to the conventional scaling equation. Its solution represents itself the sum of power-low terms of integer order and non-integer power-law term multiplied to a log-periodic function [5], [6]. The appearance of this term was confirmed numerically for internal region of the self-similar cluster (r₀ ≪ r ≪ r_N−1), where r₀, r_N−1 determine the smallest and the largest radiuses of the limiting rings correspondingly. The results were obtained for homogeneously (b > 0) and heterogeneously (b < 0) charged rings. We expect that this approach allows to consider more complex self-similar structures with different geometries of charge distributions.     

The stochastic soliton-like solutions of stochastic KdV equations

By means of a generalized method and symbolic computation, we consider a stochastic KdV equation U_t + f(t)U ♢ U_x + g(t)U_xxx = W(t) ♢ R^♢(t, U, U_x, U_xxx). We construct new and more general formal solutions. At the same time, we recover all the solutions found by Xie [Phys. Lett. A 310 (2003) 161]. The solutions obtained include the nontravelling wave and coefficient function’s stochastic soliton-like solutions, singular stochastic soliton-like solutions, stochastic triangular functions solutions.     

Fractional dynamics of systems with long-range interaction

We consider one-dimensional chain of coupled linear and nonlinear oscillators with long-range powerwise interaction defined by a term proportional to 1/∣n − m∣^α+1. Continuous medium equation for this system can be obtained in the so-called infrared limit when the wave number tends to zero. We construct a transform operator that maps the system of large number of ordinary differential equations of motion of the particles into a partial differential equation with the Riesz fractional derivative of order α, when 0 < α < 2. Few models of coupled oscillators are considered and their synchronized states and localized structures are discussed in details. Particularly, we discuss some solutions of time-dependent fractional Ginzburg–Landau (or nonlinear Schrodinger) equation.     

Quantum Complexity of Integration

It is known that quantum computers yield a speed-up for certain discrete problems. Here we want to know whether quantum computers are useful for continuous problems. We study the computation of the integral of functions from the classical Hölder classes F^k, α_d on [0, 1]^d and define γ by γ=(k+α)/d. The known optimal orders for the complexity of deterministic and (general) randomized methods are comp(F^k, α_d, ε)≍ε^−1/γ and comp^random(F^k, α_d, ε)≍ε^−2/(1+2γ). For a quantum computer we prove comp^quant_query(F^k, α_d, ε)≍ε^−1/(1+γ) and comp^quant(F^k, α_d, ε)⩽Cε^−1/(1+γ)(log ε⁻¹)^1/(1+γ). For restricted Monte Carlo (only coin tossing instead of general random numbers) we prove comp^coin(F^k, α_d, ε)⩽Cε^−2/(1+2γ)(log ε⁻¹)^1/(1+2γ). To summarize the results one can say that   • there is an exponential speed-up of quantum algorithms over deterministic (classical) algorithms, if γ is small;   • there is a (roughly) quadratic speed-up of quantum algorithms over randomized classical methods, if γ is small.     

On generalized Jordan 1-derivation in rings

Let n ⩾ 1 be a fixed integer and let R be an (n + 1)!-torsion free 1-ring with identity element e. If F, d:R → R are two additive mappings satisfying F(xⁿ⁺¹) = F(x)(x¹)ⁿ + xd(x)(x¹)ⁿ⁻¹ + x²d(x)(x¹)ⁿ⁻²+ ⋯ +xⁿd(x) for all x ∈ R, then d is a Jordan 1-derivation and F is a generalized Jordan 1-derivation on R.     

An extended rational interpolation method

To interpolate function, f(x), a ? x ? b, when we have some information about the values of f(x) and their derivatives in separate points on {x₀, x₁, … , x_n} ? [a, b], the Hermit interpolation method is usually used. Here, to solve this kind of problems, extended rational interpolation method is presented and it is shown that the suggested method is more efficient and suitable than the Hermit interpolation method, especially when the function f(x) has singular points in interval [a, b]. Also for implementing the extended rational interpolation method, the direct method and the inverse differences method are presented, and with some examples these arguments are examined numerically.     

A semi-Markov process with an inverse Gaussian distribution as sojourn time

Let X_n denote the state of a device after n repairs. We assume that the time between two repairs is the time τ taken by a Wiener process {W(t), t ? 0}, starting from w₀ and with drift μ < 0, to reach c ∈ [0, w₀). After the nth repair, the process takes on either the value X_n?1 + 1 or X_n?1 + 2. The probability that X_n = X_n?1 + j, for j = 1, 2, depends on whether τ ? t₀ (a fixed constant) or τ > t₀. The device is considered to be worn out when X_n ? k, where k ∈ {1, 2, …}. This model is based on the ones proposed by Rishel (1991) [1] and Tseng and Peng (2007) [2]. We obtain an explicit expression for the mean lifetime of the device. Numerical methods are used to illustrate the analytical findings.     

Filter matrix based on interpolation wavelets for solving Fredholm integral equations

The interpolation wavelet is used to solve the Fredholm integral equation of the second kind in this study. Hence, by the extension of interpolation wavelets that [−1, 1] is divided to 2^N+1 (N ⩾  − 1) subinterval, we have polynomials with a degree less than M + 1 in each new interval. Therefore, by considering the two-scale relation the filter coefficients and filter matrix are used as the proof of theorems. The important point is interpolation wavelets lead to more sparse matrix when we try to solve integral equation by an approximate kernel decomposed to a lower and upper resolution. Using n-time, where (n ⩾ 2), two-scale relation in this method errors of approximate solution as O((2^−(N+1))ⁿ⁺¹). Also, the filter coefficient simplifies the proof of some theorems and the order of convergence is estimated by numerical errors.     

The Exponent of Discrepancy Is at Least 1.0669

LetP⊂[0, 1]^dbe ann-point set and letw: P→[0, ∞) be a weight function withw(P)=∑_z∈P w(z)=1. TheL₂-discrepancy of the weighted set (P, w) is defined as theL₂-average ofD(x)=vol(B_x)−w(P∩B_x) overx∈[0, 1]^d, where vol(B_x) is the volume of thed-dimensional intervalB_x=∏^d_k=1 [0, x_k). The exponent of discrepancyp* is defined as the infimum of numberspsuch that for all dimensionsd⩾1 and allε>0 there exists a weighted set of at mostKε^−ppoints in [0, 1]^dwithL₂-discrepancy at mostε, whereK=K(p) is a suitable number independent ofεandd. Wasilkowski and Woźniakowski proved thatp*⩽1.4779, by combining known bounds for the error of numerical integration and using their relation toL₂-discrepancy. In this note we observe that a careful treatment of a classical lower- bound proof of Roth yieldsp*⩾1.04882, and by a slight modification of the proof we getp*⩾1.0669. Determiningp* exactly seems to be quite a difficult problem.     

Free in-plane vibration analysis of a curved beam (arch) with arbitrary various concentrated elements

In the existing literature, the information regarding the exact solutions for free in-plane vibrations of the curved beams (or arches) carrying various concentrated elements is rare, particularly for the case with multiple attachments including eccentricities and mass moments of inertias. For this reason, this paper aims at presenting an effective approach to tackle the title problem. First of all, the un-coupled equation of motion for the circumferential displacement of an arch segment is derived. Next, based on the value of the discriminate parameter for a cubic equation, the exact solutions for the three types of roots of the un-coupled equation are determined and, corresponding to each type of roots, all displacement functions for the arch segment in terms of the real numbers (instead of the complex ones) are obtained. Finally, use of the compatible equations for the displacements and slopes together with the equilibrium equations for the forces and moments at each intermediate node and two ends of the entire curved beam, a frequency equation of the form ∣H(ω)∣ = 0 is obtained. It is found that the conventional approach by using the condition “∣H(ω^t)∣ ? ε” to search for the approximate value of ω^t is difficult even if the convergence tolerance ε is greater than 10⁺³ (i.e., ε > 10⁺³) instead of less than 10^?3 (i.e., ε < 10^?3), however, the half-interval method is one of the effective tools for solving the problem if all coefficients of the determinant ∣H(ω)∣ are the real numbers. In addition to comparing with the existing literature, most of the numerical results obtained from the presented method are compared with those obtained from the conventional finite element method (FEM) and good agreement is achieved.     

On “P” property and the column-W property

P-matrices play an important role in the well-posedness of a linear complementarity problem (LCP). Similarly, the well-posedness of a horizontal linear complementarity problem (HLCP) is closely related to the column-W property of a matrix k-tuple.In this paper we first consider the problem of generating P-matrices from a given pair of matrices. Given a matrix pair (D, F) where D is a square matrix of order m and matrix F has m rows, “what are the conditions under which there exists a matrix G such that (D + FG) is a P-matrix?”. We obtain necessary and sufficient conditions for the special case when the column rank of F is m ? 1. A decision algorithm of complexity O(m²) to check whether the given pair of matrices (D, F) is P-matrisable is obtained. We also obtain a necessary and an independent sufficient condition for the general case when rank(F) is less than m ? 1.We then generalise the P-matrix generating problem to the generation of matrix k-tuples satisfying the column-W property from a given matrix (k + 1)-tuple. That is, given a matrix (k + 1)-tuple (D₁, … ,D_k, F), where D_js are square matrices of order m and F is a matrix having m rows, we determine the conditions under which the matrix k-tuple (D₁ + FG₁, … ,D_k + FG_k) satisfies the column-W property. As in the case of P-matrices we obtain necessary and sufficient conditions for the case when rank(F) = m ? 1. Using these conditions a decision algorithm of complexity O(km²) to check whether the given matrix (k + 1)-tuple is column-W matrisable is obtained. Then for the case when rank(F) is less than m ? 1, we obtain a necessary and an independent sufficient condition.For a special sub-class of P-matrices we give a polynomial time decision algorithm for P-matrisability. Finally, we obtain a geometric characterisation of column-W property by generalising the well known separation theorem for P-matrices.     

Comment on: New exact traveling wave solutions of the (3 + 1)-dimensional Kadomtsev–Petviashvili (KP) equation

We demonstrate that four solutions from 13 of the (3 + 1)-dimensional Kadomtsev–Petviashvili equation obtained by Khalfallah [1] are wrong and do not satisfy the equation. The other nine exact solutions are the same and all “new” solutions by Khalfallah can be found from the well known solution.     

Existence of quasibounded solutions for the higher order dynamic equations on measure chains

By using the exponential dichotomy and Schauder’s fixed point theorem, some new criteria are established for the existence of quasibounded solutions of the inhomogeneous system x^Δ = A(t)x + g(t, x) + h(t), which generalize the previous results in [15], [19].     

Short note on Hilbert’s inequality

Considering five different parameters, we obtain some new Hilbert-type integral inequalities for functions f(x), g(x) in L²[0, ∞). Then, we extract from our results some special cases which have been proved before.     

Comments on “The generalizing Riccati equation mapping method in nonlinear evolution equation: Application to (2 + 1)-dimensional Boiti–Leon–Pempinelle equation”

By means of a so-called generalizing Riccati equation mapping method, Zhu [Zhu S D, Chaos, Solitons & Fractals; 2006. doi:10.1016/j.chaos.2006.10.015] has claimed that abundant new solutions to the (2 + 1)-dimensional Boiti–Leon–Pempinelle (BLP) equation are derived. Based on the derived variable separation solution and by selecting appropriate functions, he has asserted that abundant new non-travelling waves are obtained. We show that the generalizing Riccati equation mapping method is equivalent to the usual mapping approach, and say nothing of the conclusion that many new non-travelling wave solutions have been found.     

An approximate solution of nonlinear fractional reaction–diffusion equation

The article presents a mathematical model of nonlinear reaction diffusion equation with fractional time derivative α (0 < α ? 1) in the form of a rapidly convergent series with easily computable components. Fractional reaction diffusion equation is used for modeling of merging travel solutions in nonlinear system for popular dynamics. The fractional derivatives are described in the Caputo sense. The anomalous behaviors of the nonlinear problems in the form of sub- and super-diffusion due to the presence of reaction term are shown graphically for different particular cases.