scholarly journals Some Refinements and Generalizations of I. Schur Type Inequalities

2014 ◽  
Vol 2014 ◽  
pp. 1-8
Author(s):  
Xian-Ming Gu ◽  
Ting-Zhu Huang ◽  
Wei-Ru Xu ◽  
Hou-Biao Li ◽  
Liang Li ◽  
...  

Recently, extensive researches on estimating the value ofehave been studied. In this paper, the structural characteristics of I. Schur type inequalities are exploited to generalize the corresponding inequalities by variable parameter techniques. Some novel upper and lower bounds for the I. Schur inequality have also been obtained and the upper bounds may be obtained with the help ofMapleand automated proving package (Bottema). Numerical examples are employed to demonstrate the reliability of the approximation of these new upper and lower bounds, which improve some known results in the recent literature.

2020 ◽  
Vol 26 (2) ◽  
pp. 131-161
Author(s):  
Florian Bourgey ◽  
Stefano De Marco ◽  
Emmanuel Gobet ◽  
Alexandre Zhou

AbstractThe multilevel Monte Carlo (MLMC) method developed by M. B. Giles [Multilevel Monte Carlo path simulation, Oper. Res. 56 2008, 3, 607–617] has a natural application to the evaluation of nested expectations {\mathbb{E}[g(\mathbb{E}[f(X,Y)|X])]}, where {f,g} are functions and {(X,Y)} a couple of independent random variables. Apart from the pricing of American-type derivatives, such computations arise in a large variety of risk valuations (VaR or CVaR of a portfolio, CVA), and in the assessment of margin costs for centrally cleared portfolios. In this work, we focus on the computation of initial margin. We analyze the properties of corresponding MLMC estimators, for which we provide results of asymptotic optimality; at the technical level, we have to deal with limited regularity of the outer function g (which might fail to be everywhere differentiable). Parallel to this, we investigate upper and lower bounds for nested expectations as above, in the spirit of primal-dual algorithms for stochastic control problems.


1965 ◽  
Vol 2 (01) ◽  
pp. 79-87
Author(s):  
Masanobu Shinozuka

Upper and lower bounds are given for the probability that a separable random process X(t) will take values outside the interval (— λ 1, λ 2) for 0 ≦ t ≦ T, where λ 1 and λ 2 are positive constants. The random process needs to be neither stationary, Gaussian nor purely random (white noise). In engineering applications, X(t) is usually a random process decaying with time at least in the long run such as the structural response to the acceleration of ground motion due to earthquake. Numerical examples show that the present method estimates the probability between the upper and lower bounds which are sufficiently close to be useful when the random processes decay with time.


2012 ◽  
Vol 29 (3) ◽  
pp. 642-658 ◽  
Author(s):  
Benedikt M. Pötscher

Upper and lower bounds on the order of magnitude of $\sum\nolimits_{t = 1}^n {\lefttnq#x007C; {x_t } \righttnq#x007C;^{ - \alpha } } $, where xt is an integrated process, are obtained. Furthermore, upper bounds for the order of magnitude of the related quantity $\sum\nolimits_{t = 1}^n {v_t } \lefttnq#x007C; {x_t } \righttnq#x007C;^{ - \alpha } $, where vt are random variables satisfying certain conditions, are also derived.


In this paper a theorem of Kato (1949) which provides upper and lower bounds for the eigenvalues of a Hermitian operator is modified and generalized so as to give upper and lower bounds for the normal frequencies of oscillation of a conservative dynamical system. The method given here is directly applicable to a system specified by generalized co-ordinates with both elastic and inertial couplings. It can be applied to any one of the normal modes of vibration of the system. The bounds obtained are much closer than those given by Rayleigh’s comparison theorems in which the inertia or elasticity of the system is changed, and they are in fact the ‘best possible’ bounds. The principles of the computation of upper and lower bounds is explained in this paper and will be illustrated by some numerical examples in a subsequent paper.


1991 ◽  
Vol 234 ◽  
Author(s):  
David J. Bergman ◽  
Ohad Levy

ABSTRACTA theoretical study of composite thermoelectric media has resulted in the development of a number of simple approximations, as well as some exact results. The latter include exact upper and lower bounds on the bulk effective thermoelectric transport coefficients of the composite and upper bounds on the bulk effective thermoelectric quality factor Ze. In particular, as a result of some exact theorems and computer simulations we conclude that Ze can never be greater than the largest value of Z in the different components that make up the composite.


Author(s):  
Krishnendu Chatterjee ◽  
Hongfei Fu ◽  
Amir Goharshady ◽  
Nastaran Okati

We consider the stochastic shortest path (SSP) problem for succinct Markov decision processes (MDPs), where the MDP consists of a set of variables, and a set of nondeterministic rules that update the variables. First, we show that several examples from the AI literature can be modeled as succinct MDPs. Then we present computational approaches for upper and lower bounds for the SSP problem: (a) for computing upper bounds, our method is polynomial-time in the implicit description of the MDP; (b) for lower bounds, we present a polynomial-time (in the size of the implicit description) reduction to quadratic programming. Our approach is applicable even to infinite-state MDPs. Finally, we present experimental results to demonstrate the effectiveness of our approach on several classical examples from the AI literature.


2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Guimin Liu ◽  
Hongbin Lv

<p style='text-indent:20px;'>We obtain the improved results of the upper and lower bounds for the spectral radius of a nonnegative tensor by its majorization matrix's digraph. Numerical examples are also given to show that our results are significantly superior to the results of related literature.</p>


1967 ◽  
Vol 9 (2) ◽  
pp. 149-156 ◽  
Author(s):  
G. Fauconneau ◽  
W. M. Laird

Upper and lower bounds for the eigenvalues of uniform simply supported beams carrying uniformly distributed axial load and constant end load are obtained. The upper bounds were calculated by the Rayleigh-Ritz method, and the lower bounds by a method due to Bazley and Fox. Some results are given in terms of two loading parameters. In most cases the gap between the bounds over their average is less than 1 per cent, except for values of the loading parameters corresponding to the beam near buckling. The results are compared with the eigenvalues of the same beam carrying half of the distributed load lumped at each end. The errors made in the lumping process are very large when the distributed load and the end load are of opposite signs. The results also indicate that the Rayleigh-Ritz upper bounds computed with the eigenfunctions of the unloaded beam as co-ordinate functions are quite accurate.


1965 ◽  
Vol 2 (1) ◽  
pp. 79-87 ◽  
Author(s):  
Masanobu Shinozuka

Upper and lower bounds are given for the probability that a separable random process X(t) will take values outside the interval (— λ1, λ2) for 0 ≦ t ≦ T, where λ1 and λ2 are positive constants.The random process needs to be neither stationary, Gaussian nor purely random (white noise).In engineering applications, X(t) is usually a random process decaying with time at least in the long run such as the structural response to the acceleration of ground motion due to earthquake.Numerical examples show that the present method estimates the probability between the upper and lower bounds which are sufficiently close to be useful when the random processes decay with time.


2018 ◽  
Vol 26 (2) ◽  
pp. 269-297 ◽  
Author(s):  
Anton V. Eremeev

In this article, we consider a fitness-level model of a non-elitist mutation-only evolutionary algorithm (EA) with tournament selection. The model provides upper and lower bounds for the expected proportion of the individuals with fitness above given thresholds. In the case of so-called monotone mutation, the obtained bounds imply that increasing the tournament size improves the EA performance. As corollaries, we obtain an exponentially vanishing tail bound for the Randomized Local Search on unimodal functions and polynomial upper bounds on the runtime of EAs on the 2-SAT problem and on a family of Set Cover problems proposed by E. Balas.


Sign in / Sign up

Export Citation Format

Share Document