Results 41 to 50 of about 6,198,913 (198)
New theorems in approximation theory
مجلة بغداد للعلوم, 2010 The aim of this paper is to prove some results for equivalence of moduli of smoothnes in approximation theory , we used a"non uniform" modulus of smoothness and the weighted Ditzian –Totik moduli of smoothness in by spline functions ,several ...
Baghdad Science Journal
doaj +1 more source
IET Information Security, 2021 A simultaneous Diophantine approximation (SDA) algorithm takes instances of the partial approximate common divisor (PACD) problem as input and outputs a solution.
Wonhee Cho, Jiseung Kim, Changmin Lee
doaj +1 more source
Towards Intelligent Modeling: Statistical Approximation Theory
, 2011 The main idea of statistical convergence is to demand convergence only for a majority of elements of a sequence. This method of convergence has been investigated in many fundamental areas of mathematics such as: measure theory, approximation theory ...
Duman, Oktay +4 more
core +1 more source
On Best Approximation By Rational And Holomorphic Mappings Between Banach Spaces
, 2015 After proving a generalized version of Garkavi's theorem, we give as applications proofs of existence results on best approximation by polynomials, and fractional linear and holomorphic operators between Banach spaces.
Roversi M.S.M. +5 more
core +2 more sources
The Approximation Property For Spaces For Holomorphic Functions On Infinite-dimensional Spaces I
, 2015 For an open subset U of a locally convex space E, let (H(U), τ0) denote the vector space of all holomorphic functions on U, with the compact-open topology.
Mujica J., Dineen S.
core +3 more sources
Fast and low‐power leading‐one detectors for energy‐efficient logarithmic computing
IET Computers & Digital Techniques, 2021 The logarithmic number system (LNS) can be used to simplify the computation of arithmetic functions, such as multiplication. This article proposes three leading‐one detectors (LODs) to speed up the binary logarithm calculation in the LNS.
Mohammad Saeed Ansari +3 more
doaj +1 more source
Learning‐based control for discrete‐time constrained nonzero‐sum games
CAAI Transactions on Intelligence Technology, 2021 A generalized policy‐iteration‐based solution to a class of discrete‐time multi‐player non‐zero‐sum games concerning the control constraints was proposed. Based on initial admissible control policies, the iterative value function of each player converges
Chaoxu Mu, Jiangwen Peng, Yufei Tang
doaj +1 more source
Best Approximation Of Bounded Functions By Continuous Functions
, 2015 [No abstract available]412135148Amir, Chebyshev centers and uniform convexity (1978) Pacific Journal of Mathematics, 77, pp. 1-6Amir, Deutsch, Approximation by certain subspaces in the Banach space of continuous vector-valued functions (1979) J.
Roversi M.S.M., ROVERSI, MSM
core +1 more source
IET Signal Processing, 2021 A design technique is developed for the probing signals of a Multi‐Input Multi‐Output (MIMO) radar. The concentration of the energy of the signal in its essential duration and essential bandwidth is achieved through the use of a class of time‐frequency ...
Yuqing Liu +3 more
doaj +1 more source
Interpolation Of 2d Banach Spaces And Multiparametric Approximation
, 2015 A multiparametric approximation theory via certain inequalities of Jackson and Bernstein type is developed. An approximation space is defined and it is shown that it is actually an interpolation space among 2d Banach spaces.
Fernandez D.L., FERNANDEZ, DL
core +1 more source