Results 1 to 10 of about 42,681 (238)
On a theorem of V.N. Nikolski on characterization of best approximation for convex sets
Journal of Numerical Analysis and Approximation Theory, 1990 Not available.
Ş. Cobzaş
doaj +2 more sources
Improved Shape Parameter Estimation in K Clutter with Neural Networks and Deep Learning
International Journal of Interactive Multimedia and Artificial Intelligence, 2016 The discrimination of the clutter interfering signal is a current problem in modern radars’ design, especially in coastal or offshore environments where the histogram of the background signal often displays heavy tails.
José Raúl Machado Fernández +1 more
doaj +1 more source
Adaptive Generation and Diagnostics of Linear Few-Cycle Light Bullets
Applied Sciences, 2013 Recently we introduced the class of highly localized wavepackets (HLWs) as a generalization of optical Bessel-like needle beams. Here we report on the progress in this field.
Martin Bock, Ruediger Grunwald
doaj +1 more source
PLoS Computational Biology, 2020 The mapping of molecular inputs to their molecular outputs (input/output, I/O mapping) is an important characteristic of gene circuits, both natural and synthetic. Experimental determination of such mappings for synthetic circuits is best performed using
Christoph Stelzer, Yaakov Benenson
doaj +1 more source
Characterization of \(\varepsilon\)-nearest points in spaces with asymmetric seminorm
Journal of Numerical Analysis and Approximation Theory, 2004 In this note we are concerned with the characterization of the elements of \(\varepsilon\)-best approximation (\(\varepsilon\)-nearest points) in a subspace \(Y\) of space \(X\) with asymmetric seminorm. For this we use functionals in the asymmetric dual
Costică Mustăţa
doaj +2 more sources
Characterizations of local best Chebyshev approximations
Journal of Approximation Theory, 1981 AbstractLocal best Chebyshev approximations are characterized by a condition which can be considered as a generalization of the general Kolmogoroff criterion. In the discrete case, this condition is shown to be equivalent to the general Kolmogoroff criterion itself. Finally, local characterizations of the general Kolmogoroff criterion are given.
openaire +2 more sources
Characterization of generalized convex functions by best L2-approximations
Journal of Approximation Theory, 1975 AbstractLet M be a normed linear space, and {Mn}1∞ a sequence of increasing finite dimensional subspaces, i.e., Mn ⊂ Mn + 1, for all n. For any element ƒ ϵ M, we obviously have d(ƒ, Mn) ⩾ d(ƒ, Mn + 1), for all n, (1) where d(ƒ, Mk) is the distance, in the metric induced by the norm, from Mk to ƒ.In a recent paper [2], we discussed the space M = C[a,b ...
Amir, Dan, Ziegler, Zvi
openaire +2 more sources
A characterization of the unicity property in best approximation
Journal of Approximation Theory, 1973 AbstractIn this paper we consider the problem of characterizing those situations under which the best uniform linear approximation to an arbitrary continuous function is unique. The problem has been solved by Haar where the set of approximants is a finite dimensional subspace, but in this paper we generalize this by allowing the set of approximants to ...
openaire +2 more sources
Characterization of best approximations by sums of exponentials
Journal of Approximation Theory, 1973 AbstractAn exponential sum y can be specified by giving the coefficients b, c of the corresponding initial value problem (Dn + c1Dn − 1 + ··· + cn)y = 0, Dj − 1y(0) = bj, j = 1, 2,…, n. We discuss some of the topological properties of this parametric form, noting that the associated tangential manifold does not suffer a “loss of dimension” when the ...
openaire +2 more sources
EURO Journal on Transportation and LogisticsThe widespread adoption of digital distribution channels both enables and forces more and more logistics service providers to manage booking processes actively to maintain competitiveness.
David Fleckenstein +3 more
doaj +1 more source