Results 251 to 260 of about 1,539,341 (287)

MONOAMINE OXIDASE: AN APPROXIMATION OF TURNOVER RATES

Journal of Neurochemistry, 1971
AbstractOne hour after the intravenous injection of pargyline (10 mg/kg), the activity of monoamine oxidase (EC 1.4.3.4) in various brain regions, in the submaxillary gland and in the superior cervical ganglion of the rat was inhibited by about 95 per cent.
C, Goridis, N H, Neff
openaire   +2 more sources

Rate of Convergence in Trotter’s Approximation Theorem

Constructive Approximation, 2008
The authors give a quantitative estimate of the convergence in Trotter's approximation theorem on the convergence of iterates of linear operators. An application is also given concerning the classical Bernstein operators on the d-dimensional simplex.
CAMPITI, Michele, TACELLI, CRISTIAN
openaire   +4 more sources

Rate of Approximation for Certain Durrmeyer Operators

gmj, 2006
Abstract In the present note, we study a certain Durrmeyer type integral modification of Bernstein polynomials. We investigate simultaneous approximation and estimate the rate of convergence in simultaneous approximation.
Gupta, Vijay, Shervashidze, Tengiz, Craciun, Maria   +2 more
openaire   +2 more sources

Rate of approximation of minimizing measures

Nonlinearity, 2007
For T a continuous map from a compact metric space to itself and f a continuous function, we study the minimum of the integral of f with respect to the members of the family of invariant measures for T and in particular the rate at which this minimum is approached when the minimum is restricted to the family of invariant measures supported on periodic ...
Xavier Bressaud, Anthony Quas
openaire   +1 more source

Rates of A-statistical convergence of approximating operators

Calcolo, 2005
Using the concepts of rates of statistical convergence we investigate approximation properties of positive linear operators defined on the space C[0,b], 0 < b < 1, which includes many well-known operators in approximation theory. We also use the modulus of continuity and Lipschitz functions.
Doğru, O., Duman, Oktay, Özarslan, M. Ali   +2 more
openaire   +3 more sources

Rates of Convergence for Stochastic Approximation Type Algorithms

SIAM Journal on Control and Optimization, 1979
We consider the general form of the stochastic approximation algorithm$X_{n + 1} = X_n + a_n h(X_n ,\xi _n )$, where h is not necessarily additive in $\xi _n $. Such algorithms occur frequently in applications to adaptive control and identification problems, where $\{ \xi _n \} $ is usually obtained from measurements of the input and output, and is ...
Kushner, Harold J., Huang, Hai
openaire   +2 more sources

L 1-approximation rate of certain trigonometric series

Acta Mathematica Hungarica, 2011
The authors claim that they refigure out the whole frame of \(L^1\)-approximation. This sounds too optimistic. For example, it is quite common to start from trigonometric series rather than from the Fourier series of an integrable function and only then to use specific properties of the coefficients of the series in order to ensure integrability ...
Le, R. J., Zhou, S. P.
openaire   +1 more source

Rate of Convergence for Constrained Stochastic Approximation Algorithms

SIAM Journal on Control and Optimization, 2002
The authors consider stochastic approximation-type algorithms of the form (essentially, extensions are stated and referred to) (1) \( \theta_{n+1} = \theta_{n} + \varepsilon_n Y_n\), decreasing step-size, and \(\varepsilon_n \rightarrow 0\). They treat the case where the stochastic approximation algorithm is constrained, that is the iterates are ...
Buche, Robert, Kushner, Harold J.
openaire   +2 more sources

Rate of Convergence in Simultaneous Approximation

2014
In the theory of approximation, the study of the rate of convergence in simultaneous approximation is also an interesting area of research. Several researchers have worked in this direction; some of them have obtained the rate of convergence for bounded/bounded variation functions in simultaneous approximation.
Vijay Gupta, Ravi P. Agarwal
openaire   +1 more source

THE RATE OF BEST APPROXIMATION FOR ENTIRE FUNCTIONS

Analysis, 1985
The rate of best polynomial approximation of an entire function f on a compact Faber set K in the complex plane is characterized in terms of the Taylor- and Faber-coefficients of f and in terms of the maximum norms of the derivatives of f on K. Emphasis is placed on high precision in describing the rate of approximation, i.e.
Freund, M., Görlich, E.
openaire   +1 more source