Results 31 to 40 of about 822,442 (292)
Journal of Modern Power Systems and Clean Energy, 2021 In power systems, there are many uncertainty factors such as power outputs of distributed generations and fluctuations of loads. It is very beneficial to power system analysis to acquire an explicit function describing the relationship between these ...
Hao Wu +5 more
doaj +1 more source
Structured Low-rank Approximation as a Rational Function Minimization [PDF]
, 2012 Many problems of system identification, model reduction and signal processing can be posed and solved as a structured low-rank approximation problem (SLRA).
Markovsky, Ivan, Usevich, Konstantin
core +1 more source
An Efficient Method for Solving [PDF]
Kirkuk Journal of Science, 2008 This paper presents a new method for solving fractional partial differential equations (FPDE) which is called the polynomial approximation method based on the polynomial approximation uN(x,t) and on its general fractional derivative formula.By modifying ...
Omar M. Al-Faour
doaj +1 more source
On a polynomial approximation problem
Journal of Approximation Theory, 2010 AbstractLet F be a closed subset of the unit circle T and let f∈C(F). We investigate the problem of uniform approximation of f on F by polynomials Pn which are uniformly bounded on the unit disk Δ. In a particular case when F is a closed arc of T, the problem was solved by L. Zalcman in 1982, who has also pointed out the possibility of considering more
Department of Mathematics and Statistics, University of South Florida, Tampa, FL 33620, USA ( host institution ) +1 more
openaire +2 more sources
Minimax polynomial approximation [PDF]
Mathematics of Computation, 1966 Some new methods for obtaining the minimax polynomial approximation of degree n n to a continuous function are introduced ...
openaire +1 more source
Square-rich fixed point polynomial evaluation on FPGAs [PDF]
, 2014 Polynomial evaluation is important across a wide range of application domains, so significant work has been done on accelerating its computation. The conventional algorithm, referred to as Horner's rule, involves the least number of steps but can lead to
McLoughlin, Ian V. +5 more
core +1 more source
Hardness of approximation for orthogonal rectangle packing and covering problems [PDF]
, 2009 Bansal and Sviridenko [N. Bansal, M. Sviridenko, New approximability and inapproximability results for 2-dimensional bin packing, in: Proceedings of the 15th Annual ACM–SIAM Symposium on Discrete Algorithms, SODA, 2004, pp.
Chlebikova, Janka +4 more
core +1 more source
The best uniform quadratic approximation of circular arcs with high accuracy
Open Mathematics, 2016 In this article, the issue of the best uniform approximation of circular arcs with parametrically defined polynomial curves is considered. The best uniform approximation of degree 2 to a circular arc is given in explicit form.
Rababah Abedallah
doaj +1 more source
Vestnik Samarskogo Gosudarstvennogo Tehničeskogo Universiteta. Seriâ: Fiziko-Matematičeskie Nauki, 2020 The paper includes the well-known matrix method of numerical integration of boundary value problems for inhomogeneous linear ordinary differential equations with variable coefficients, which provides retaining an arbitrary number of Taylor series ...
Vladimir Nikolaevich Maklakov
doaj +1 more source
Polynomial approximation of regular functions of a quaternionic variable
Science, Technology and Innovation, 2022 We consider Bernstein-Walsh-Siciak-type theorems on the polynomial approximation in the case of regular functions of one quaternionic variable and their applications to the uniform approximation and approximation in Lp norms with respect to measures ...
Jerzy Szczepański
doaj +1 more source