Results 31 to 40 of about 18,405,059 (322)
Fractional power series neural network for solving delay fractional optimal control problems
In this paper, we develop a numerical method for solving the delay optimal control problems of fractional-order. The fractional derivatives are considered in the Caputo sense.
Farzaneh Kheyrinataj, Alireza Nazemi
doaj +1 more source
Entanglement-assisted zero-error capacity is upper-bounded by the Lovász ϑ function [PDF]
The zero-error capacity of a classical channel is expressed in terms of the independence number of some graph and its tensor powers. This quantity is hard to compute even for small graphs such as the cycle of length seven, so upper bounds such as the ...
Beigi, Salman
core +1 more source
Complex Zeros of the Error Function and of the Complementary Error Function [PDF]
The first one hundred zeros of the error function and of the complementary error function are given. An asymptotic formula for the higher zeros is also derived.
Fettis, Henry E. +2 more
openaire +2 more sources
ENO-wavelet transforms for piecewise smooth functions [PDF]
We have designed an adaptive essentially nonoscillatory (ENO)-wavelet transform for approximating discontinuous functions without oscillations near the discontinuities. Our approach is to apply the main idea from ENO schemes for numerical shock capturing
Chan, Tony F., Zhou, H. M.
core +2 more sources
Minimization of Error Functionals over Variable-Basis Functions [PDF]
Summary: Generalized Tikhonov well-posedness is investigated for the problem of minimization of error functionals over admissible sets formed by variable-basis functions, i.e., linear combinations of a fixed number of elements chosen from a given basis without a prespecified ordering.
P. C. KAINEN +2 more
openaire +2 more sources
Analytic Error Function and Numeric Inverse Obtained by Geometric Means
Using geometric considerations, we provided a clear derivation of the integral representation for the error function, known as the Craig formula. We calculated the corresponding power series expansion and proved the convergence.
Dmitri Martila, Stefan Groote
doaj +1 more source
Separations in Query Complexity Based on Pointer Functions [PDF]
In 1986, Saks and Wigderson conjectured that the largest separation between deterministic and zero-error randomized query complexity for a total boolean function is given by the function $f$ on $n=2^k$ bits defined by a complete binary tree of NAND gates
Ambainis, Andris +5 more
core +3 more sources
Accurate approximations for the complex error function with small imaginary argument [PDF]
In this paper we present two efficient approximations for the complex error function $w \left( {z} \right)$ with small imaginary argument $\operatorname{Im}{\left[ { z } \right]} < < 1$ over the range $0 \le \operatorname{Re}{\left[ { z } \right]} \le 15$
S. Abrarov, B. Quine
semanticscholar +1 more source
Temporal evolution of generalization during learning in linear networks [PDF]
We study generalization in a simple framework of feedforward linear networks with n inputs and n outputs, trained from examples by gradient descent on the usual quadratic error function.
Baldi, Pierre, Chauvin, Yves
core +1 more source
As harmonic distortion of voltage and current is reality in the power system, the need for accurate measurement of electrical power and energy goes beyond the instruments’ specifications and calibration procedures regarding pure sine wave signals ...
Demerdziev Kiril, Dimchev Vladimir
doaj +1 more source

