Results 21 to 30 of about 1,527,957 (300)
Multilevel weighted least squares polynomial approximation [PDF]
ESAIM: Mathematical Modelling and Numerical Analysis, 2017 Weighted least squares polynomial approximation uses random samples to determine projections of functions onto spaces of polynomials. It has been shown that, using an optimal distribution of sample locations, the number of samples required to achieve ...
A. Haji-Ali +3 more
semanticscholar +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
Polynomial approximation of non-Gaussian unitaries by counting one photon at a time [PDF]
, 2017 In quantum computation with continous-variable systems, quantum advantage can only be achieved if some non-Gaussian resource is available. Yet, non-Gaussian unitary evolutions and measurements suited for computation are challenging to realize in the lab.
F. Arzani, N. Treps, G. Ferrini
semanticscholar +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
Open Mathematics, 2021 Fourier approximation plays a key role in qualitative theory of deterministic and random differential equations. In this paper, we will develop a new approximation tool.
Zhang Zhihua
doaj +1 more source
Polynomial approximation via compressed sensing of high-dimensional functions on lower sets [PDF]
Mathematics of Computation, 2016 This work proposes and analyzes a compressed sensing approach to polynomial approximation of complex-valued functions in high dimensions. Of particular interest is the setting where the target function is smooth, characterized by a rapidly decaying ...
A. Chkifa +3 more
semanticscholar +1 more source
Vestnik Samarskogo Gosudarstvennogo Tehničeskogo Universiteta. Seriâ: Fiziko-Matematičeskie Nauki, 2018 The use of the Taylor polynomial of the second degree when approximating the derivatives by finite differences leads to the second order of approximation of the traditional method of nets in the numerical integration of second-order ordinary differential
Vladimir N Maklakov, Yanina G Stelmakh
doaj +1 more source
IEEE transactions on industrial electronics (1982. Print), 2019 In this paper, a cost-effective and highly accurate resolver-to-digital conversion method is presented. The core of the idea is to apply a third-order rational fraction polynomial approximation for the conversion of sinusoidal signals into the pseudo ...
Shuo Wang +3 more
semanticscholar +1 more source
Data-Driven Polynomial Ridge Approximation Using Variable Projection [PDF]
SIAM Journal on Scientific Computing, 2017 Inexpensive surrogates are useful for reducing the cost of science and engineering studies involving large-scale, complex computational models with many input parameters.
J. Hokanson, P. Constantine
semanticscholar +1 more source
Vestnik Samarskogo Gosudarstvennogo Tehničeskogo Universiteta. Seriâ: Fiziko-Matematičeskie Nauki, 2016 We present the first message of the cycle from two articles where the rearrangement of the order of approximation of the matrix method of numerical integration depending on the degree in the Taylor’s polynomial expansion of solutions of boundary value ...
Vladimir N Maklakov
doaj +1 more source