Lower and upper bounds of matricesUsing an approach of Bergh, we give an alternate proof of Bennett's result on lower bounds for non-negative matrices acting on non-increasing non-negative sequences in l p when p 1 and its dual version, the upper bounds when 0 < p 1. We also ...
In this paper we construct two polyhedral lower bounds and one polyhedral upper bound for the nef cone of Y using an embedding of Y into a toric variety. The lower bounds generalize the combinatorial description of the nef cone of a Mori dream space, while the upper bound generalizes the F...
Upper and lower bounds for eigenvalues of the Laplacian on a spherical cap Problem 12 of the TEAM (Testing Electromagnetic Analysis Methods) Workshops for Eddy Current Code Comparison is a cantilever beam in crossed steady and tim... FE Baginski - 《Quarterly of Applied Mathematics》 被引量: ...
How can I set appropriate upper and lower bounds? I have seen it said many times while searching on websites that the bounds should be set "according to your data." What does this mean? How can I actually decide what good bounds are? Here is my data: x are time points, and...
Li J.A Lower and upper bounds version of a variational inequality. Applied Mathematics Letters . 2000Jinlu LI. A lower and upper bounds version of a variational inequality. Appl. Math. Lett., 2000, 13(5): 47-51.J. Li, "A lower and upper bounds version of a variational inequality," ...
An intermediate theorem for the Fokker-Planck equation is presented for the first time from which lower bounds for the eigenvalues can be extracted. The same theorem can be applied to the master equation in detailed balance. We discuss as a first application the lower and upper bounds for the...
On the within-family Kullback-Leibler risk in Gaussian Predictive models We produce asymptotically sharp upper and lower bounds on the within-family prediction errors for various subfamilies of $\\mathcal{G}$. Under mild ... G Mukherjee,IM Johnstone - 《Stats》 被引量: 5发表: 2012年 Efficie...
The algorithms are polynomial for the allocation problem and its extensions and are also optimal for the simple allocation problem and the generalized upper bounds allocation problem, in that the complexity meets the lower bound derived from the comparison model. For other extensions of the allocation...
Quantifying the error of convex order bounds for truncated first moments [Kaas, R., Dhaene, J., Goovaerts, M.J.,2000. Upper and lower bounds for sums of random variables. Insurance: Math. Econ. 27, 151-168] ... K Brueckner - 《Insurance》 被引量: 3发表: 2008年 TAIL BOUNDS FOR SU...
In this paper, we propose two novel methods for approximating the KL divergence between the left-to-right transient HMMs. The first method is a product approximation which can be calculated recursively without introducing extra parameters. The second method is based on the upper and lower bounds ...