Related papers: Fuchsia: a tool for reducing differential equation…
Feynman integral reduction by means of integration-by-parts identities is a major power gadget in a theorist toolbox indispensable for calculation of multiloop quantum effects relevant for particle phenomenology and formal theory alike. An…
This is the second part of a series devoted to the singular initial value problem for second-order hyperbolic Fuchsian systems. In the first part, we defined and investigated this general class of systems, and we established a…
We introduce an efficient algorithm for computing fractional integrals and derivatives and apply it for solving problems of the calculus of variations of fractional order. The proposed approximations are particularly useful for solving…
In this paper, we present an algorithm for computing a fundamental matrix of formal solutions of completely integrable Pfaffian systems with normal crossings in several variables. This algorithm is a generalization of a method developed for…
Over the last two decades, several fast, robust, and high-order accurate methods have been developed for solving the Poisson equation in complicated geometry using potential theory. In this approach, rather than discretizing the partial…
In this paper, we present numerical procedures to compute solutions of partial differential equations posed on fractals. In particular, we consider the strong form of the equation using standard graph Laplacian matrices and also weak forms…
This paper deals with $\tilde{\chi}^{(6)}$, the six-particle contribution to the magnetic susceptibility of the square lattice Ising model. We have generated, modulo a prime, series coefficients for $\tilde{\chi}^{(6)}$. The length of the…
Fermionic Gaussian operators are foundational tools in quantum many-body theory, numerical simulation of fermionic dynamics, and fermionic linear optics. While their structure is fully determined by two-point correlations, evaluating their…
In this paper, we introduce an algorithm that provides approximate solutions to semi-linear ordinary differential equations with highly oscillatory solutions, which, after an appropriate change of variables, can be rewritten as…
Solving a Poisson equation is generally reduced to solving a linear system with a coefficient matrix $A$ of entries $a_{ij}$, $i,j=1,2,...,n$, from the discretized Poisson equation. Although the variational quantum algorithms are promising…
Given an affine transformation $T$, we define its Fisher distortion $Dist_F(T)$. We show that the Fisher distortion has Riemannian metric structure and provide an algorithm for finding mean distorting transformation -- namely -- for a given…
The integration of differential equations of Feynman integrals can be greatly facilitated by using a canonical basis. This paper presents the Mathematica package CANONICA, which implements a recently developed algorithm to automatize the…
We study second-order modular differential equations whose solutions transform equivariantly under the modular group. In the reducible case, we construct all such solutions using an explicit ansatz involving Eisenstein series and the…
We present an algorithm for the numerical solution of nonlinear parabolic partial differential equations. This algorithm extends the classical Feynman-Kac formula to fully nonlinear partial differential equations, by using random trees that…
The role of differential equations in the process of calculating Feynman integrals is reviewed. An example of a diagram is given for which the method of differential equations was introduced, the properties of the inverse-mass-expansion…
In a recent paper \cite{ft} a new powerful method to calculate Feynman diagrams was proposed. It consists in setting up a Taylor series expansion in the external momenta squared. The Taylor coefficients are obtained from the original…
Using an expansion method in the variables $ x_i$ that appear in the $(n-1)$-dimensional integrals representing the $n$-particle contribution to the Ising square lattice model susceptibility $\chi$, we generate a long series of coefficients…
For a wide class of polynomially nonlinear systems of partial differential equations we suggest an algorithmic approach to the s(trong)-consistency analysis of their finite difference approximations on Cartesian grids. First we apply the…
Partial differential equations describing the dynamics of physical systems rarely have closed-form solutions. Fourier spectral methods, which use Fast Fourier Transforms (FFTs) to approximate solutions, are a common approach to solving…
In this paper, an efficient modified Newton type algorithm is proposed for nonlinear unconstrianed optimization problems. The modified Hessian is a convex combination of the identity matrix (for steepest descent algorithm) and the Hessian…