Results 1 to 10 of about 286,746 (266)
Coordinate Order of Approximation by Functional-Based Approximation Operators
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Burchard, H.G., Lei, J.J.
openaire +2 more sources
The approximation of Laplace-Stieltjes transforms with finite order
In this paper, we study the irregular growth of an entire function defined by the Laplace-Stieltjes transform of finite order convergent in the whole complex plane and obtain some results about λ-lower type.
Hong Yan Xu, San Yan Liu
doaj +1 more source
Approximation of Fractional Order PIλDμ-Controller Transfer Function Using Chain Fractions
The approximation of a fractional order PIλDμ-controller transfer function using a chain fraction theory is considered. Analytical expressions for the approximation of s±α components of the transfer functions of PIλDμ-controllers were obtained through ...
Yaroslav Marushchak +5 more
doaj +1 more source
The paper deals with the construction of high-order accuracy finite element schemes for the fourth-order ordinary differential equation with degenerate coefficients on the boundary.
A.A. Sobolev, M.R. Timerbaev
doaj
Non-Integer Order Approximation of a PID-Type Controller for Boost Converters
In this work, the voltage regulation of a boost converter is addressed. A non-integer order PID controller is proposed to deal with the closed-loop instability of the system.
Allan G. S. Sánchez +3 more
doaj +1 more source
Approximation Order for Multivariate Durrmeyer Operators with Jacobi Weights
Using the equivalence relation between K-functional and modulus of smoothness, we establish a strong direct theorem and an inverse theorem of weak type for multivariate Bernstein-Durrmeyer operators with Jacobi weights on a simplex in this paper. We also
Jianjun Wang, Chan-Yun Yang, Shukai Duan
doaj +1 more source
Optimal order for approximation of derivatives
AbstractIn this note, we show that the central difference formula for approximating f′(0) using the information {f(jh): −r ⩽j ⩽r} has maximal order of accuracy among all algorithms using this information. The technique used is an adaptation of the order-of-information approach of Wozniakowski.
openaire +2 more sources
Contextual Approximation and Higher-Order Procedures [PDF]
We investigate the complexity of deciding contextual approximation (refinement) in finitary Idealized Algol, a prototypical language combining higher-order types with state. Earlier work in the area established the borderline between decidable and undecidable cases, and focussed on the complexity of deciding approximation between terms in normal form ...
Ranko Lazic 0001, Andrzej S. Murawski
openaire +1 more source
Numerical approximation of Newell-Whitehead-Segel equation of fractional order
The aim of the present work is to propose a user friendly approach based on homotopy analysis method combined with Sumudu transform method to drive analytical and numerical solutions of the fractional Newell-Whitehead-Segel amplitude equation which ...
Kumar Devendra, Sharma Ram Prakash
doaj +1 more source
The approximation order of polysplines [PDF]
We show that the scaling spaces defined by the polysplines of order p p provide approximation order
Kounchev, Ognyan, Render, Hermann
openaire +2 more sources

