BLOCH AMPLITUDES AND ENERGY OF SLOW LIGHT IN A TAPERED GRATING

2006 ◽  
Vol 15 (03) ◽  
pp. 381-400
Author(s):  
THEO P. VALKERING
Keyword(s):  
Energy Density ◽  
Band Gap ◽  
Transfer Matrix ◽  
Lower Bounds ◽  
Slow Light ◽  
Standing Waves ◽  
Upper And Lower Bounds ◽  
Coupled Mode ◽  
Analytical Results

Bloch amplitudes and energy density for traveling and standing waves in an apodized grating at frequencies just outside the band gap are investigated. On the basis of exact coupled mode equations for the local Bloch amplitudes, based on the transfer matrix of the grating units, the concept of local reflectance is developed. This concept appears to be particularly useful to find upper and lower bounds on amplitudes and energy density. Analytical results are tested numerically for a polynomial apodization profile.

Limit Analysis of Nonsymmetrically Loaded Spherical Shells

1972 ◽  
Vol 39 (2) ◽  
pp. 422-430 ◽  
Author(s):  
S. Palusamy ◽  
N. C. Lind
Keyword(s):  
Lower Bounds ◽  
Limit Analysis ◽  
Upper And Lower Bounds ◽  
Spherical Shells ◽  
Limit Loads ◽  
Analytical Results

Upper and lower bounds are found for limit loads on nonsymmetrically loaded spherical shells. The influence of geometrical and load parameters are discussed. The analytical results are compared with the results of tests on four steel models.

scholarly journals Infinite-order laminates in a model in crystal plasticity

2009 ◽  
Vol 139 (4) ◽  
pp. 685-708 ◽  
Author(s):  
Nathan Albin ◽  
Sergio Conti ◽  
Georg Dolzmann
Keyword(s):  
Energy Density ◽  
Lower Bounds ◽  
Crystal Plasticity ◽  
Infinite Order ◽  
Two Dimensions ◽  
Upper And Lower Bounds ◽  
Geometrically Nonlinear ◽  
Slip Systems ◽  
Quasiconvex Envelope ◽  
Active Slip

We consider a geometrically nonlinear model for crystal plasticity in two dimensions, with two active slip systems and rigid elasticity. We prove that the rank-1 convex envelope of the condensed energy density is obtained by infinite-order laminates, and express it explicitly via the 2F1 hypergeometric function. We also determine the polyconvex envelope, leading to upper and lower bounds on the quasiconvex envelope. The two bounds differ by less than 2%.

scholarly journals Oscillatority Conditions for Nonlinear Systems with Delay

2007 ◽  
Vol 2007 ◽  
pp. 1-12 ◽  
Author(s):  
Denis V. Efimov ◽  
Alexander L. Fradkov
Keyword(s):  
Computer Simulation ◽  
Time Delay ◽  
Nonlinear Systems ◽  
Lower Bounds ◽  
Oscillation Amplitude ◽  
Sufficient Conditions ◽  
Upper And Lower Bounds ◽  
Analytical Results

Sufficient conditions for oscillatority in the sense of Yakubovich for a class of time delay nonlinear systems are proposed. Under proposed conditions, upper and lower bounds for oscillation amplitude are given. Examples illustrating analytical results by computer simulation are presented.

scholarly journals On the Generalized Distance Energy of Graphs

Mathematics ◽  
2019 ◽  
Vol 8 (1) ◽  
pp. 17 ◽  
Author(s):  
Abdollah Alhevaz ◽  
Maryam Baghipur ◽  
Hilal A. Ganie ◽  
Yilun Shang
Keyword(s):  
Lower Bounds ◽  
Complete Graph ◽  
Connected Graph ◽  
Distance Matrix ◽  
Wiener Index ◽  
Diagonal Matrix ◽  
Upper And Lower Bounds ◽  
Star Graph ◽  
Extremal Graphs ◽  
Generalized Distance

The generalized distance matrix D α ( G ) of a connected graph G is defined as D α ( G ) = α T r ( G ) + ( 1 − α ) D ( G ) , where 0 ≤ α ≤ 1 , D ( G ) is the distance matrix and T r ( G ) is the diagonal matrix of the node transmissions. In this paper, we extend the concept of energy to the generalized distance matrix and define the generalized distance energy E D α ( G ) . Some new upper and lower bounds for the generalized distance energy E D α ( G ) of G are established based on parameters including the Wiener index W ( G ) and the transmission degrees. Extremal graphs attaining these bounds are identified. It is found that the complete graph has the minimum generalized distance energy among all connected graphs, while the minimum is attained by the star graph among trees of order n.

scholarly journals Hadamard k-fractional inequalities of Fejér type for GA-s-convex mappings and applications

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Hui Lei ◽  
Gou Hu ◽  
Zhi-Jie Cao ◽  
Ting-Song Du
Keyword(s):  
Lower Bounds ◽  
Hypergeometric Functions ◽  
Upper And Lower Bounds ◽  
Weighted Inequalities ◽  
Convex Mappings ◽  
Special Means

Abstract The main aim of this paper is to establish some Fejér-type inequalities involving hypergeometric functions in terms of GA-s-convexity. For this purpose, we construct a Hadamard k-fractional identity related to geometrically symmetric mappings. Moreover, we give the upper and lower bounds for the weighted inequalities via products of two different mappings. Some applications of the presented results to special means are also provided.

scholarly journals On the Second-Largest Reciprocal Distance Signless Laplacian Eigenvalue

Mathematics ◽  
2021 ◽  
Vol 9 (5) ◽  
pp. 512
Author(s):  
Maryam Baghipur ◽  
Modjtaba Ghorbani ◽  
Hilal A. Ganie ◽  
Yilun Shang
Keyword(s):  
Lower Bounds ◽  
Complete Graph ◽  
Distance Matrix ◽  
Upper And Lower Bounds ◽  
Laplacian Eigenvalue ◽  
Signless Laplacian ◽  
Graph Parameters ◽  
Simple Connected Graph ◽  
Second Largest Eigenvalue ◽  
Reciprocal Distance Matrix

The signless Laplacian reciprocal distance matrix for a simple connected graph G is defined as RQ(G)=diag(RH(G))+RD(G). Here, RD(G) is the Harary matrix (also called reciprocal distance matrix) while diag(RH(G)) represents the diagonal matrix of the total reciprocal distance vertices. In the present work, some upper and lower bounds for the second-largest eigenvalue of the signless Laplacian reciprocal distance matrix of graphs in terms of various graph parameters are investigated. Besides, all graphs attaining these new bounds are characterized. Additionally, it is inferred that among all connected graphs with n vertices, the complete graph Kn and the graph Kn−e obtained from Kn by deleting an edge e have the maximum second-largest signless Laplacian reciprocal distance eigenvalue.

scholarly journals Multilevel Monte Carlo methods and lower–upper bounds in initial margin computations

2020 ◽  
Vol 26 (2) ◽  
pp. 131-161
Author(s):  
Florian Bourgey ◽  
Stefano De Marco ◽  
Emmanuel Gobet ◽  
Alexandre Zhou
Keyword(s):  
Monte Carlo ◽  
Lower Bounds ◽  
Asymptotic Optimality ◽  
Upper Bounds ◽  
Upper And Lower Bounds ◽  
Independent Random Variables ◽  
Outer Function ◽  
Control Problems ◽  
Multilevel Monte Carlo ◽  
Primal Dual

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.

scholarly journals A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels and a Provably Optimal Instance-Based Schema

Algorithms ◽  
2021 ◽  
Vol 14 (6) ◽  
pp. 164
Author(s):  
Tobias Rupp ◽  
Stefan Funke
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Real World ◽  
Road Network ◽  
Upper And Lower Bounds ◽  
Bounded Degree ◽  
Shortest Path Routing ◽  
Graph Classes ◽  
Speed Up ◽  
To Come

We prove a Ω(n) lower bound on the query time for contraction hierarchies (CH) as well as hub labels, two popular speed-up techniques for shortest path routing. Our construction is based on a graph family not too far from subgraphs that occur in real-world road networks, in particular, it is planar and has a bounded degree. Additionally, we borrow ideas from our lower bound proof to come up with instance-based lower bounds for concrete road network instances of moderate size, reaching up to 96% of an upper bound given by a constructed CH. For a variant of our instance-based schema applied to some special graph classes, we can even show matching upper and lower bounds.

Sign in / Sign up

Export Citation Format

Share Document