Related papers: TaylUR, an arbitrary-order diagonal automatic diff…
We present the Unified Form Language (UFL), which is a domain-specific language for representing weak formulations of partial differential equations with a view to numerical approximation. Features of UFL include support for variational…
A unified explicit form for difference formulas to approximate the fractional and classical derivatives is presented. The formula gives finite difference approximations for any classical derivatives with a desired order of accuracy at nodal…
Undisputedly, derivation of theoretical systematic uncertainties is an inseparable ingredient of any robust analysis dealing with experimental data. However, it is not uncommon, even for those analyses that use state of the art methods and…
Quaternion derivatives in the mathematical literature are typically defined only for analytic (regular) functions. However, in engineering problems, functions of interest are often real-valued and thus not analytic, such as the standard…
The Weyl closure is a basic operation in algebraic analysis: it converts a system of differential operators with rational coefficients into an equivalent system with polynomial coefficients. In addition to encoding finer information on the…
We introduce a new fractional derivative which obeys classical properties including: linearity, product rule, quotient rule, power rule, chain rule, vanishing derivatives for constant functions, the Rolle's Theorem and the Mean Value…
We describe a method for calculating the roots of special functions satisfying second order linear ordinary differential equations. It exploits the recent observation that the solutions of a large class of such equations can be represented…
Fractional operators play an important role in modeling nonlocal phenomena and problems involving coarse-grained and fractal spaces. The fractional calculus of variations with functionals depending on derivatives and/or integrals of…
We develop in this paper a new framework for discrete calculus of variations when the actions have densities involving an arbitrary discretization operator. We deduce the discrete Euler-Lagrange equations for piecewise continuous critical…
One-loop functions with loop masses larger than external masses and momenta can always be expanded in terms of external masses and momenta. The precision requested for observables determines the number of the expansion terms retained in the…
This book intends to deepen the study of the fractional calculus, giving special emphasis to variable-order operators. It is organized in two parts, as follows. In the first part, we review the basic concepts of fractional calculus (Chapter…
We create a sequence version of calculus. First, we define equivalence, some fundamental operations, differential, and integral for sequences. Then, we propose sequence versions of identity function, power function, exponential function,…
In mathematics and computer algebra, automatic differentiation (AD) is a set of techniques to evaluate the derivative of a function specified by a computer program. AD exploits the fact that every computer program, no matter how…
Existing refinement calculi provide frameworks for the stepwise development of imperative programs from specifications. This paper presents a refinement calculus for deriving logic programs. The calculus contains a wide-spectrum logic…
In this paper, we present a new algorithm and an experimental implementation for factoring elements in the polynomial n'th Weyl algebra, the polynomial n'th shift algebra, and ZZ^n-graded polynomials in the n'th q-Weyl algebra. The most…
How does one compile derivatives of tensor programs, such that the resulting code is purely functional (hence easier to optimize and parallelize) and provably efficient relative to the original program? We show that naively differentiating…
Function approximation is a generic process in a variety of computational problems, from data interpolation to the solution of differential equations and inverse problems. In this work, a unified approach for such techniques is…
This paper presents a new approach in application of the Fourier transform to the complex error function resulting in an efficient rational approximation. Specifically, the computational test shows that with only $17$ summation terms the…
In the present article, the author uses Fourier theory of tempered distributions (generalized functions) in deriving a formula for Dirichlet-like integrals. The applied method is remarkably efficient and allows a solution in a few…
We describe a complete algorithm to compute millions of coefficients of classical modular forms in a few seconds. We also review operations on Euler products and illustrate our methods with a computation of triple product L-function of…