Ural Mathematical Journal (UMJ)
Not a member yet
    157 research outputs found

    A NEW ROOT–FINDING ALGORITHM USING EXPONENTIAL SERIES

    Get PDF
    In this paper, we present a new root-finding algorithm to compute a non-zero real root of the transcendental equations using exponential series. Indeed, the new proposed algorithm is based on the exponential series and in which Secant method is special case. The proposed algorithm produces better approximate root than bisection method, regula-falsi method, Newton-Raphson method and secant method. The implementation of the proposed algorithm in Matlab and Maple also presented. Certain numerical examples are presented to validate the efficiency of the proposed algorithm. This algorithm will help to implement in the commercial package for finding a real root of a given transcendental equation

    RESTRAINED DOUBLE MONOPHONIC NUMBER OF A GRAPH

    Get PDF
    For a connected graph GG of order at least two, a double monophonic set SS of a graph GG is a restrained double monophonic set if  either S=VS=V or the subgraph induced by VSV-S has no isolated vertices. The minimum cardinality of a restrained double  monophonic set of GG is the restrained double monophonic number of GG and is denoted by dmr(G)dm_{r}(G). The restrained double monophonic number of certain classes graphs are determined. It is shown that for any integers a,b,ca,\, b,\, c with 3abc3 \leq a \leq b \leq c, there is a connected graph GG with m(G)=am(G) = a, mr(G)=bm_r(G) = b and dmr(G)=cdm_{r}(G) = c, where m(G)m(G) is the monophonic number and mr(G)m_r(G) is the restrained monophonic number of a graph GG

    INTERPOLATING WAVELETS ON THE SPHERE

    Get PDF
    There are several works where bases of wavelets on the sphere (mainly orthogonal and wavelet-like bases) were constructed. In all such constructions, the authors seek to preserve the most important properties of classical wavelets including constructions on the basis of the lifting-scheme. In the present paper, we propose one more construction of wavelets on the sphere. Although two of three systems of wavelets constructed in this paper are orthogonal, we are more interested in their interpolation properties. Our main idea consists in a special double expansion of the unit sphere in R3\mathbb{R}^3 such that any continuous function on this sphere defined in spherical coordinates is easily mapped into a 2π2\pi-periodic function on the plane. After that everything becomes simple, since the classical scheme of the tensor product of one-dimensional bases of functional spaces works to construct bases of spaces of functions of several variables.There are several works where bases of wavelets on the sphere (mainly orthogonal and wavelet-like bases) were constructed. In all such constructions, the authors seek to preserve the most important properties of classical wavelets including constructions on the basis of the lifting-scheme. In the present paper, we propose one more construction of wavelets on the sphere. Although two of three systems of wavelets constructed in this paper are orthogonal, we are more interested in their interpolation properties. Our main idea consists in a special double expansion of the unit sphere in R3\mathbb{R}^3 such that any continuous function on this sphere defined in spherical coordinates is easily mapped into a 2π2\pi-periodic function on the plane. After that everything becomes simple, since the classical scheme of the tensor product of one-dimensional bases of functional spaces works to construct bases of spaces of functions of several variables

    COMMUTATIVE WEAKLY INVO–CLEAN GROUP RINGS

    Get PDF
    A ring RR is called weakly invo-clean if any its element is the sum or the difference of an involution and an idempotent. For each commutative unital ring RR and each abelian group GG, we find only in terms of RR, GG and their sections a necessary and sufficient condition when the group ring R[G]R[G] is weakly invo-clean. Our established result parallels to that due to Danchev-McGovern published in J. Algebra (2015) and proved for weakly nil-clean rings

    HARMONIC INTERPOLATING WAVELETS IN NEUMANN BOUNDARY VALUE PROBLEM IN A CIRCLE

    Get PDF
    The Neumann boundary value problem (BVP) in a unit circle is discussed. For the solution of the Neumann BVP, we built a method employing series representation of given 2π2 \pi-periodic continuous boundary function by interpolating wavelets consisting of trigonometric polynomials. It is convenient to use the method due to the fact that such series is easy to extend to harmonic polynomials inside a circle. Moreover, coefficients of the series have an easy-to-calculate form. The representation by the interpolating wavelets is constructed by using an interpolation projection to subspaces of a multiresolution analysis with basis 2π2 \pi-periodic scaling functions (more exactly, their binary rational compressions and shifts). That functions were developed by Subbotin and Chernykh on the basis of Meyer-type wavelets. We will use three kinds of such functions, where two out of the three generates systems, which are orthogonal and simultaneous interpolating on uniform grids of the corresponding scale and the last one generates only interpolating on the same uniform grids system. As a result, using the interpolation property of wavelets mentioned above, we obtain the exact representation of the solution for the Neumann BVP by series of that wavelets and numerical bound of the approximation of solution by partial sum of such series

    A NUMERICAL TECHNIQUE FOR THE SOLUTION OF GENERAL EIGHTH ORDER BOUNDARY VALUE PROBLEMS: A FINITE DIFFERENCE METHOD

    Get PDF
    In this article, we present a novel finite difference method for the numerical solution of the eighth order boundary value problems in ordinary differential equations. We have discretized the problem by using the boundary conditions in a natural way to obtain a system of equations. Then we have solved system of equations to obtain a numerical solution of the problem. Also we obtained numerical values of derivatives of solution as a byproduct of the method. The numerical experiments show that proposed method is efficient and fourth order accurate

    EVALUATION OF SOME NON-ELEMENTARY INTEGRALS INVOLVING SINE, COSINE, EXPONENTIAL AND LOGARITHMIC INTEGRALS: PART II

    Get PDF
    The non-elementary integrals \mbox{Si}_{\beta,\alpha}=\int [\sin{(\lambda x^\beta)}/(\lambda x^\alpha)] dx,  β1,\beta\ge1, α>β+1\alpha>\beta+1 and \mbox{Ci}_{\beta,\alpha}=\int [\cos{(\lambda x^\beta)}/(\lambda x^\alpha)] dx,  β1,\beta\ge1,  α>2β+1,\alpha>2\beta+1, where {β,α}R,\{\beta,\alpha\}\in\mathbb{R}, are evaluated in terms of the hypergeometric function  2F3_{2}F_3. On the other hand, the exponential integral \mbox{Ei}_{\beta,\alpha}=\int (e^{\lambda x^\beta}/x^\alpha) dx,  β1,\beta\ge1,  α>β+1\alpha>\beta+1 is expressed in terms of 2F2_{2}F_2. The method used to evaluate these integrals consists of expanding the integrand  as a Taylor series and integrating the series term by term

    AUTOMORPHISMS OF DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {39; 36; 4; 1; 1; 36}

    Get PDF
    Makhnev and Nirova have found intersection arrays of distance-regular graphs with no more than 40964096 vertices, in which λ=2\lambda=2  and μ=1\mu=1. They proposed the program of investigation of distance-regular graphs with λ=2\lambda=2 and μ=1\mu=1. In this paper the automorphisms of a distance-regular graph with intersection array {39,36,4;1,1,36}\{39,36,4;1,1,36\} are studied

    ON THE 75TH BIRTHDAY OF PROFESSOR VITALII VLADIMIROVICH ARESTOV

    Get PDF
    July 16, 2018, was the 75th birthday of famous Russian scientist, prominent mathematician, Doctor of Physics and Mathematics, Professor Vitalii Vladimirovich Arestov

    ASYMPTOTIC EXPANSION OF A SOLUTION FOR THE SINGULARLY PERTURBED OPTIMAL CONTROL PROBLEM WITH A CONVEX INTEGRAL QUALITY INDEX AND SMOOTH CONTROL CONSTRAINTS

    Get PDF
    The paper deals with the problem of optimal control with a convex integral quality index for a linear steady-state control system in the class of piecewise continuous controls with smooth control constraints. In a general case, to solve such a problem, the Pontryagin maximum principle is applied as the necessary and sufficient optimum condition. The main difference from the preceding article [10] is that the terminal part of the convex integral quality index depends not only on slow, but also on fast variables. In a particular case, we derive an equation that is satisfied by an initial vector of the conjugate system. Then this equation is extended to the optimal control problem with the convex integral quality index for a linear system with the fast and slow variables. It is shown that the solution of the corresponding equation as ε0\varepsilon\to0 tends to the solution of an equation corresponding to the limit problem. The results obtained are applied to study a problem which describes the motion of a material point in Rn\mathbb{R}^{n} for a fixed interval of time. The asymptotics of the initial vector of the conjugate system that defines the type of optimal control is built. It is shown that the asymptotics is a power series of expansion

    144

    full texts

    157

    metadata records
    Updated in last 30 days.
    Ural Mathematical Journal (UMJ)
    Access Repository Dashboard
    Do you manage Open Research Online? Become a CORE Member to access insider analytics, issue reports and manage access to outputs from your repository in the CORE Repository Dashboard! 👇