Results 51 to 60 of about 69,419 (165)
Hybrid approximations via second order combined dynamic derivatives on time scales
This article focuses on the approximation of conventional second order derivative via the combined (diamond-$\alpha$) dynamic derivative on time scales with necessary smoothness conditions embedded.
Qin Sheng
doaj +1 more source
On constrained uniform approximation
The problem of uniform approximants subject to Hermite interpolatory constraints is considered with an alternate approach. The uniqueness and the convergence aspects of this problem are also discussed. Our approach is based on work of P.
M. A. Bokhari
doaj +1 more source
This article investigates an adaptive neural network (NN) control algorithm for marine surface vessels with time-varying output constraints and unknown external disturbances.
Wei Zhao, Li Tang, Yan-Jun Liu
doaj +1 more source
Optimal with Respect to Accuracy Recovery of Some Classes Functions by Fourier Series
Introduction. Function approximation (approximation or restoration) is widely used in data analysis, model building, and forecasting. The goal of function approximation is to find the function that best approximates the original function.
Olena Kolomys
doaj +1 more source
Inner approximation algorithm for generalized linear multiplicative programming problems
An efficient inner approximation algorithm is presented for solving the generalized linear multiplicative programming problem with generalized linear multiplicative constraints.
Yingfeng Zhao, Juanjuan Yang
doaj +1 more source
Conventional adaptive beamformers usually suffer from serious performance degradation when the receive array is imperfect and unknown sporadic interferences appear.
Yang Zou +5 more
doaj +1 more source
Diophantine approximation with mild divisibility constraints
Dirichlet's theorem on Diophantine approximation states that for any real \(\alpha\) and any \(N \geq 1\), there exists an integer \(n\) such that \(1 \leq n \leq N\) and \(\| n\alpha \| < N^{-1}\); here \(\| \cdot \| \) is the distance to the nearest integer function. There is a long history of estimates for \(\| n\alpha \| \) when \(n\) is subject to
Alkan, Emre +2 more
openaire +1 more source
Approximately Stable Matchings with General Constraints
This paper focuses on two-sided matching where one side (a hospital or firm) is matched to the other side (a doctor or worker) so as to maximize a cardinal objective under general feasibility constraints. In a standard model, even though multiple doctors can be matched to a single hospital, a hospital has a responsive preference and a maximum quota ...
Kawase, Yasushi, Iwasaki, Atsushi
openaire +2 more sources
Powered Descent Guidance via First-Order Optimization With Expansive Projection
This paper introduces a first-order method for solving optimal powered descent guidance (PDG) problems, that directly handles the nonconvex constraints associated with the maximum and minimum thrust bounds with varying mass and the pointing angle ...
Jiwoo Choi, Jong-Han Kim
doaj +1 more source
Uniqueness of Best Approximation with Coefficient Constraints
Let for given \(\alpha= (\alpha_ 1,\dots, \alpha_ n)\) and \(\beta= (\beta_ 1,\dots, \beta_ n)\), with \(-\infty\leq \alpha_ i< \beta_ i\leq\infty\), \(i=1,\dots, n\), and continuous functions \(u_ 1,\dots,u_ n\), set \(U(\alpha,\beta)= \{\sum_{i=1}^ n a_ i U_ i\); \(\alpha_ i\leq a_ i\leq\beta_ i\), \(i=1,\dots, n\}\). In this paper the conditions for
openaire +2 more sources

