Related papers: Complete Reduction for Derivatives in a Primitive …
Inspired by previous work of Shoup, Lenstra-De Smit and Couveignes-Lercier, we give fast algorithms to compute in (the first levels of) the ell-adic closure of a finite field. In many cases, our algorithms have quasi-linear complexity.
Applying proper orthogonal decomposition to a usual finite element (FE) formulation for space fractional partial differential equation, we get a reduced FE model, which greatly reduces the complexity of computation. Then, the stability…
Let $\phi: A\to A$ be a (not necessarily linear, additive or continuous) map of a standard operator algebra. Suppose for any $a,b\in A$ there is an algebra automorphism $\theta_{a,b}$ of $ A$ such that \begin{align*} \phi(a)\phi(b) =…
A new calculus based on fractal subsets of the real line is formulated. In this calculus, an integral of order $\alpha, 0 < \alpha \leq 1$, called $F^\alpha$-integral, is defined, which is suitable to integrate functions with fractal…
In industry, shape optimization problems are of utter importance when designing structures such as aircraft, automobiles and turbines. For many of these applications, the structure changes over time, with a prescribed or non-prescribed…
Backpropagation algorithm is the cornerstone for neural network analysis. Paper extends it for training any derivatives of neural network's output with respect to its input. By the dint of it feedforward networks can be used to solve or…
A recently proposed integral representation for permanents is rederived using only elementary combinatorics. For this proof the assumption that the matrix, for which the permanent is calculated, has an inverse is not necessary.
Let $\alpha\in\,]0,1[$. We prove that the existence of the conformable fractional derivative $T_{\alpha}f$ of a function $f:[0,\infty[\,\longrightarrow \mathbb{R}$ introduced by Khalil et al. in [R. Khalil, M. Al Horani, A. Yousef, M.…
We use a generalised real-time path formalism with properly regularised propagators based on Le Bellac and Mabilat \cite{belmab} and calculate the effective potential and the higher order derivative terms of the effective action in the case…
We propose a simple recursive algorithm that allows the computation of the first- and second-order derivatives with respect to the inputs of an arbitrary deep feed forward neural network (DFNN). The algorithm naturally incorporates the…
In classical factorization theory, an integral domain is called \emph{atomic} if every nonzero nonunit element can be written as a finite product of irreducible elements. Here, we introduce and study a weaker notion of atomicity, which…
In the case of finite measures on finite spaces, we state conditions under which {\phi}- projections are continuously differentiable. When the set on which one wishes to {\phi}- project is convex, we show that the required assumptions are…
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 present a new algorithm for constructing minimal telescopers for rational functions in three discrete variables. This is the first discrete reduction-based algorithm that goes beyond the bivariate case. The termination of the algorithm…
Derivative-free optimization (DFO) is the mathematical study of the optimization algorithms that do not use derivatives. One branch of DFO focuses on model-based DFO methods, where an approximation of the objective function is used to guide…
Let $F$ be a finite field, let $f$ be a function from $F$ to $F$, and let $a$ be a nonzero element of $F$. The discrete derivative of $f$ in direction $a$ is $\Delta_a f \colon F \to F$ with $(\Delta_a f)(x)=f(x+a)-f(x)$. The differential…
We introduce derivation depth-a computable metric of the reasoning effort needed to answer a query based on a given set of premises. We model information as a two-layered structure linking abstract knowledge with physical carriers, and…
A general procedure for constructing conservative numerical integrators for time dependent partial differential equations is presented. In particular, linearly implicit methods preserving a time discretised version of the invariant is…
This short article contains the construction of a construction that generalizes the concept of the derivative of a function of one variable, using the theory of filters. The paper presents a new concept, demonstrates that it really…
Narrowing is a procedure that was first studied in the context of equational E-unification and that has been used in a wide range of applications. The classic completeness result due to Hullot states that any term rewriting derivation…