相关论文: An improved algorithm and a Fortran 90 module for …

Basic computer arithmetic operations, such as $+$, $\times$, or $\div$ are correctly rounded, whilst mathematical functions such as $e^x$, $\ln(x)$, or $\sin(x)$ in general are not, meaning that separate implementations may provide…

This paper presents a novel boundary-optimized fast Fourier extension algorithm for efficient approximation of non-periodic functions. The proposed methodology constructs periodic extensions through strategic utilization of boundary…

This remark describes efficiency improvements to Algorithm 916 [Zaghloul and Ali 2011]. It is shown that the execution time required by the algorithm, when run at its highest accuracy, may be improved by more than a factor of two. A better…

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…

Introduced in the 1960s, the Moreau envelope has grown to become a key tool in non\-smooth analysis and optimization. Essentially an infimal convolution with a parametrized norm squared, the Moreau envelope is used in many applications and…

We study a class of projective transformations of spectraplexes associated with self-dual cones and, on this basis, propose a polynomial-time algorithm for convex feasibility problems with positive definite constraints. At each iteration of…

This paper proposes QPALM, a proximal augmented Lagrangian method based on quadratic approximations, for solving nonlinear programming problems with weakly convex objective and constraint functions. The algorithm is constructed by…

In this paper, we consider optimizing a smooth, convex, lower semicontinuous function in Riemannian space with constraints. To solve the problem, we first convert it to a dual problem and then propose a general primal-dual algorithm to…

Non-convex functional constrained optimization problems have gained substantial attention in machine learning and data science, addressing broad requirements that typically go beyond the often performance-centric objectives. An influential…

This paper discusses the properties and the numerical discretizations of the fractional substantial integral $$I_s^\nu f(x)=\frac{1}{\Gamma(\nu)} \int_{a}^x{\left(x-\tau\right)^{\nu-1}}e^{-\sigma(x-\tau)}{f(\tau)}d\tau,\nu>0, $$ and the…

A constrained optimization problem is primal infeasible if its constraints cannot be satisfied, and dual infeasible if the constraints of its dual problem cannot be satisfied. We propose a novel iterative method, named proportional-integral…

In this paper, we consider a method for fast numerical computation of the Fourier transform of a slowly decaying function with given accuracy in given ranges of the frequency. In these decades, some useful formulas for the Fourier transform…

In this paper, by making use of a certain family of fractional derivative operators in the complex domain, we introduce and investigate a new subclass $\mathcal{P}_{\tau,\mu}(k,\delta,\gamma)$ of analytic and univalent functions in the open…

This paper studies the numerical computation of integrals, representing estimates or predictions, over the output $f(x)$ of a computational model with respect to a distribution $p(\mathrm{d}x)$ over uncertain inputs $x$ to the model. For…

Physics-informed neural networks (PINNs) have plateaued at errors of $10^{-3}$-$10^{-4}$ for fourth-order partial differential equations, creating a perceived precision ceiling that limits their adoption in engineering applications. We…

We present an efficient multi-accuracy algorithm for the computations of a set of special functions of a complex argument, z=x+iy. These functions include the complex probability function w(z), and closely related functions such as the…

We present a new muon propagation Monte Carlo FORTRAN code MUM (MUons+Medium) which possesses some advantages over analogous codes presently in use. The most important features of the algorithm are described. Data on the test for algorithm…

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…

Monte Carlo algorithms are barely considered in spin foam quantum gravity. Due to the quantum nature of spin foam amplitudes one cannot readily apply them, and the present sign problem is a threat to convergence and thus efficiency. Yet,…

We investigate the possibility of fast, accurate and reliable computation of the Cauchy principal value integrals $\mathrm{P}\!\int_{a}^{b} f(x)(x-\tau)^{-1} dx$ $(a < \tau < b)$ using standard adaptive quadratures. In order to properly…