46,666 research outputs found

    A Krylov subspace algorithm for evaluating the phi-functions appearing in exponential integrators

    Full text link
    We develop an algorithm for computing the solution of a large system of linear ordinary differential equations (ODEs) with polynomial inhomogeneity. This is equivalent to computing the action of a certain matrix function on the vector representing the initial condition. The matrix function is a linear combination of the matrix exponential and other functions related to the exponential (the so-called phi-functions). Such computations are the major computational burden in the implementation of exponential integrators, which can solve general ODEs. Our approach is to compute the action of the matrix function by constructing a Krylov subspace using Arnoldi or Lanczos iteration and projecting the function on this subspace. This is combined with time-stepping to prevent the Krylov subspace from growing too large. The algorithm is fully adaptive: it varies both the size of the time steps and the dimension of the Krylov subspace to reach the required accuracy. We implement this algorithm in the Matlab function phipm and we give instructions on how to obtain and use this function. Various numerical experiments show that the phipm function is often significantly more efficient than the state-of-the-art.Comment: 20 pages, 3 colour figures, code available from http://www.maths.leeds.ac.uk/~jitse/software.html . v2: Various changes to improve presentation as suggested by the refere

    Solving second-order linear ordinary differential equations by using interactive software

    Get PDF
    Differential equations constitute an area of great theoretical research and applications in several branches of science and technology. The scope of this work is to present new software that is able to show all the steps in the process of solving a linear second-order ordinary differential equation with constant coefficients.info:eu-repo/semantics/publishedVersio

    Solving 1ODEs with functions

    Full text link
    Here we present a new approach to deal with first order ordinary differential equations (1ODEs), presenting functions. This method is an alternative to the one we have presented in [1]. In [2], we have establish the theoretical background to deal, in the extended Prelle-Singer approach context, with systems of 1ODEs. In this present paper, we will apply these results in order to produce a method that is more efficient in a great number of cases. Directly, the solving of 1ODEs is applicable to any problem presenting parameters to which the rate of change is related to the parameter itself. Apart from that, the solving of 1ODEs can be a part of larger mathematical processes vital to dealing with many problems.Comment: 31 page

    Fast computation of power series solutions of systems of differential equations

    Get PDF
    We propose new algorithms for the computation of the first N terms of a vector (resp. a basis) of power series solutions of a linear system of differential equations at an ordinary point, using a number of arithmetic operations which is quasi-linear with respect to N. Similar results are also given in the non-linear case. This extends previous results obtained by Brent and Kung for scalar differential equations of order one and two

    The automatic solution of partial differential equations using a global spectral method

    Full text link
    A spectral method for solving linear partial differential equations (PDEs) with variable coefficients and general boundary conditions defined on rectangular domains is described, based on separable representations of partial differential operators and the one-dimensional ultraspherical spectral method. If a partial differential operator is of splitting rank 22, such as the operator associated with Poisson or Helmholtz, the corresponding PDE is solved via a generalized Sylvester matrix equation, and a bivariate polynomial approximation of the solution of degree (nx,ny)(n_x,n_y) is computed in O((nxny)3/2)\mathcal{O}((n_x n_y)^{3/2}) operations. Partial differential operators of splitting rank 3\geq 3 are solved via a linear system involving a block-banded matrix in O(min(nx3ny,nxny3))\mathcal{O}(\min(n_x^{3} n_y,n_x n_y^{3})) operations. Numerical examples demonstrate the applicability of our 2D spectral method to a broad class of PDEs, which includes elliptic and dispersive time-evolution equations. The resulting PDE solver is written in MATLAB and is publicly available as part of CHEBFUN. It can resolve solutions requiring over a million degrees of freedom in under 6060 seconds. An experimental implementation in the Julia language can currently perform the same solve in 1010 seconds.Comment: 22 page

    Differentiable Genetic Programming

    Full text link
    We introduce the use of high order automatic differentiation, implemented via the algebra of truncated Taylor polynomials, in genetic programming. Using the Cartesian Genetic Programming encoding we obtain a high-order Taylor representation of the program output that is then used to back-propagate errors during learning. The resulting machine learning framework is called differentiable Cartesian Genetic Programming (dCGP). In the context of symbolic regression, dCGP offers a new approach to the long unsolved problem of constant representation in GP expressions. On several problems of increasing complexity we find that dCGP is able to find the exact form of the symbolic expression as well as the constants values. We also demonstrate the use of dCGP to solve a large class of differential equations and to find prime integrals of dynamical systems, presenting, in both cases, results that confirm the efficacy of our approach

    A Method to Tackle First Order Differential Equations with Liouvillian Functions in the Solution - II

    Full text link
    We present a semi-decision procedure to tackle first order differential equations, with Liouvillian functions in the solution (LFOODEs). As in the case of the Prelle-Singer procedure, this method is based on the knowledge of the integrating factor structure.Comment: 11 pages, late
    corecore