Related papers: NSI-IBP: A General Numerical Singular Integral Met…
Most Fredholm integral equations involve integrals with weakly singular kernels. Once the domain of integration is discretized into flat triangular elements, these weakly singular kernels become strongly singular or near-singular. Common…
This paper presents a re-formulation of the boundary integral method (BIM) for the Debye-Huckel model of molecular and colloidal electrostatics that removes the mathematical singularities that have been accepted as an intrinsic part of the…
We present an efficient method to shorten the analytic integration-by-parts (IBP) reduction coefficients of multi-loop Feynman integrals. For our approach, we develop an improved version of Leinartas' multivariate partial fraction…
Real and imaginary part of the limit 2N->infinity of the integral int_{x=1..2N} exp(i*pi*x)*x^(1/x) dx are evaluated to 20 digits with brute force methods after multiple partial integration, or combining a standard Simpson integration over…
Integer Linear Programming (ILP) has a broad range of applications in various areas of artificial intelligence. Yet in spite of recent advances, we still lack a thorough understanding of which structural restrictions make ILP tractable.…
In this work, we present the package {\sc NeatIBP}, which automatically generates small-size integration-by-parts (IBP) identities for Feynman integrals. Based on the syzygy and module intersection techniques, the generated IBP identities'…
To solve boundary integral equations for potential problems using collocation Boundary Element Method (BEM) on smooth curved 3D geometries, an analytical singularity extraction technique is employed. By adopting the isoparametric approach,…
We investigate the construction and performance of summation-by-parts (SBP) operators, which offer a powerful framework for the systematic development of structure-preserving numerical discretizations of partial differential equations.…
In this paper, we construct a uniform formula that can iteratively reduce all auxiliary scalar product numerators of arbitrary multi-loop Feynman integrals. Integrals with such numerators commonly appear in Integration-By-Parts (IBP)…
This paper is concerned with developing an efficient numerical algorithm for fast implementation of the sparse grid method for computing the $d$-dimensional integral of a given function. The new algorithm, called the MDI-SG ({\em multilevel…
Integer programming (IP), as the name suggests is an integer-variable-based approach commonly used to formulate real-world optimization problems with constraints. Currently, quantum algorithms reformulate the IP into an unconstrained form…
In this paper, we introduce a new method for calculating fractional integrals and differentials. The method involves an equation that we have obtained from infinite applied integration by parts. The equation works for special class of…
We present a projective framework for the construction of Integration by Parts (IBP) identities and differential equations for Feynman integrals, working in Feynman-parameter space. This framework originates with very early results which…
Integration by parts is used to reduce scalar Feynman integrals to master integrals.
A non-singular formulation of the boundary integral method (BIM) is presented for the Laplace equation whereby the well-known singularities that arise from the fundamental solution are eliminated analytically. A key advantage of this…
A numerical tool relying on sharp Immersed Boundary Method (IBM) is developed for the analysis of aerospace applications. The method, which is conceived for application using segregated solvers relying on implicit time discretization, uses…
We present a new method to construct integration-by-part (IBP) identities from the viewpoint of differential geometry. Vectors for generating IBP identities are reformulated as differential forms, via Poincar\'{e} duality. Using the tools…
In this paper, we propose a numerical method of computing Hadamard finite-part integrals with an integral power singularity at the endpoint on a half infinite interval, that is, a finite value assigned to a divergent integral with an…
Binary (0-1) integer programming (BIP) is pivotal in scientific domains requiring discrete decision-making. As the advance of AI computing, recent works explore neural network-based solvers for integer linear programming (ILP) problems.…
A fully numerical method to calculate loop integrals, a numerical contour-integration method, is proposed. Loop integrals can be interpreted as a contour integral in a complex plane for an integrand with multi-poles in the plane. Stable and…