Results 11 to 20 of about 822,442 (292)
Algorithms and error bounds for multivariate piecewise constant approximation [PDF]
, 2011 We review the surprisingly rich theory of approximation of functions of many vari- ables by piecewise constants. This covers for example the Sobolev-Poincar´e inequalities, parts of the theory of nonlinear approximation, Haar wavelets and tree ...
Davydov, Oleg
core +4 more sources
A note on the polynomial approximation of vertex singularities in the boundary element method in three dimensions [PDF]
, 2008 We study polynomial approximations of vertex singularities of the type $r^\lambda |\log r|^\beta$ on three-dimensional surfaces. The analysis focuses on the case when $\lambda > -\frac 12$.
Bespalov, A
core +7 more sources
Rational approximation of discrete data with asymptomatic behaviour [PDF]
This thesis is concerned with the least-squares approximation of discrete data that appear to exhibit asymptotic behaviour. In particular, we consider using rational functions as they are able to display a number of types of asymptotic behaviour.
Cooper, Philip
core +4 more sources
An overview on polynomial approximation of NP-hard problems [PDF]
Yugoslav Journal of Operations Research, 2009 The fact that polynomial time algorithm is very unlikely to be devised for an optimal solving of the NP-hard problems strongly motivates both the researchers and the practitioners to try to solve such problems heuristically, by making a trade-off between
Paschos Vangelis Th.
doaj +1 more source
SN Applied Sciences, 2021 This paper proposes a probabilistic small-signal stability analysis method based on the polynomial approximation approach. Since the correct determination of unknown coefficients has a direct effect on the accuracy of the polynomial approximation method,
Ali Mohammad Tabrizchi +1 more
doaj +1 more source
On the Expediency and Possibilities of Approximating a Pure Delay Link
Информатика и автоматизация, 2022 When solving problems of controlling an object with delay, it is often necessary to approximate a pure delay link with a minimum phase link in order to ensure the possibility of using analytical methods for regulator design.
Vadim Zhmud +5 more
doaj +1 more source
Convergence of approximating polynomials [PDF]
Proceedings of the 1961 16th ACM national meeting on -, 1961 I. The problem we wish to consider is the following. For each positive integer n, let En be a finite subset of [−1,1] containing at least n points. N For a real valued continuous function f defined on [−1,1] let pn (f, En) be the unique polynomial of degree at most n−1 of best approximation in the Chebycheff sense to f on En. Is it possible to choose a
openaire +3 more sources
Improved Stability Criteria for Time-Varying Delay System Using Second and First Order Polynomials
IEEE Access, 2020 This article concerns the problem of stability analysis of systems with time-varying delay. Recent developments in this direction involves approximation of a second order polynomial function of time-delay.
Sharat Chandra Mahto +5 more
doaj +1 more source
Communications, 2000 The least square method is generally used for an estimation of the coefficients of polynomial transformation. The paper describes the rationalization of polynomial approximation by the minimization of maximal error model (Chebyshew approximation).
Robert Tenzer
doaj +1 more source
Approximate zolotarev polynomials
Computers & Mathematics with Applications, 1986 The authors introduce modified Zolotarev polynomials as follows. For \(a\in R\), (1) \(Z_ a:=Z_{a,m+2}:=aT_{m+2}+T_{m+1}+q^*,\) where \(q^*\in P_ m\) is the (uniquely determined) algebraic polynomial of degree \(\leq m\) which minimizes \(\| Z_{a,m+2}\|_{\infty}=\max_{-1\leq x\leq 1}| Z_{a,m+2}(x)|;\) and \(T_ p\) is a Chebyshev polynomial of first ...
Haussmann, W., Zeller, K.
openaire +2 more sources