Results 11 to 20 of about 1,527,957 (300)

Interval estimation of trigonometrical splines [PDF]

open access: yesMATEC Web of Conferences, 2019
Quite often, it is necessary to quickly determine variation range of the function. If the function values are known at some points, then it is easy to construct the local spline approximation of this function and use the interval analysis rules.
Burova I.G., Ivanova E.G., Kostin V.A.
doaj   +1 more source

Polynomial Approximation of High-Dimensional Hamilton-Jacobi-Bellman Equations and Applications to Feedback Control of Semilinear Parabolic PDEs [PDF]

open access: yesSIAM Journal on Scientific Computing, 2017
A procedure for the numerical approximation of high-dimensional Hamilton--Jacobi--Bellman (HJB) equations associated to optimal feedback control problems for semilinear parabolic equations is proposed.
D. Kalise, K. Kunisch
semanticscholar   +1 more source

Spline Approximation, Part 2: From Polynomials in the Monomial Basis to B-splines—A Derivation

open access: yesMathematics, 2021
In a series of three articles, spline approximation is presented from a geodetic point of view. In part 1, an introduction to spline approximation of 2D curves was given and the basic methodology of spline approximation was demonstrated using splines ...
Nikolaj Ezhov   +2 more
doaj   +1 more source

The Stability Analysis of Linear Systems with Cauchy—Polynomial-Vandermonde Matrices

open access: yesAxioms, 2023
The numerical approximation of both eigenvalues and singular values corresponding to a class of totally positive Bernstein–Vandermonde matrices, Bernstein–Bezoutian structured matrices, Cauchy—polynomial-Vandermonde structured matrices, and quasi ...
Mutti-Ur Rehman   +3 more
doaj   +1 more source

An overview on polynomial approximation of NP-hard problems [PDF]

open access: yesYugoslav 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

Basic algorithm for approximation of the boundary trajectory of short-focus electron beam using the root-polynomial functions of the fourth and fifth order

open access: yesSistemnì Doslìdženâ ta Informacìjnì Tehnologìï, 2023
The new iterative method of approximating the boundary trajectory of a short-focus electron beam propagating in a free drift mode in a low-pressure ionized gas under the condition of compensation of the space charge of electrons is considered and ...
Igor Melnyk, Alina Pochynok
doaj   +1 more source

Probabilistic small-signal stability analysis of power systems based on Hermite polynomial approximation

open access: yesSN 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

Improved Stability Criteria for Time-Varying Delay System Using Second and First Order Polynomials

open access: yesIEEE 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

On the Expediency and Possibilities of Approximating a Pure Delay Link

open access: yesИнформатика и автоматизация, 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]

open access: yesProceedings 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   +2 more sources

Home - About - Disclaimer - Privacy