scholarly journals Sharp bounds on the minimum $M$-eigenvalue and strong ellipticity condition of elasticity $Z$-tensors-tensors

2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Chong Wang ◽  
Gang Wang ◽  
Lixia Liu
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Necessary Conditions ◽  
Upper And Lower Bounds ◽  
Symmetric Matrices ◽  
Strong Ellipticity ◽  
Ellipticity Condition ◽  
Numerical Examples ◽  
Extreme Eigenvalue ◽  
Strong Ellipticity Condition

<p style='text-indent:20px;'>In this paper, we establish sharp upper and lower bounds on the minimum <i>M</i>-eigenvalue via the extreme eigenvalue of the symmetric matrices extracted from elasticity <i>Z</i>-tensors without irreducible conditions. Based on the lower bound estimations for the minimum <i>M</i>-eigenvalue, we provide some checkable sufficient or necessary conditions for the strong ellipticity condition. Numerical examples are given to demonstrate the proposed results.</p>

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.

scholarly journals On the Rank of $p$-Schemes

10.37236/3097 ◽  
2013 ◽  
Vol 20 (2) ◽  
Author(s):  
Fateme Raei Barandagh ◽  
Amir Rahnamai Barghi
Keyword(s):  
Lower Bound ◽  
Prime Number ◽  
Lower Bounds ◽  
Upper Bound ◽  
Upper And Lower Bounds ◽  
Minimum Rank

Let $n>1$ be an integer and $p$ be a prime number. Denote by $\mathfrak{C}_{p^n}$ the class of non-thin association $p$-schemes of degree $p^n$. A sharp upper and lower bounds on the rank of schemes in $\mathfrak{C}_{p^n}$ with a certain order of thin radical are obtained. Moreover, all schemes in this class whose rank are equal to the lower bound are characterized and some schemes in this class whose rank are equal to the upper bound are constructed. Finally, it is shown that the scheme with minimum rank in $\mathfrak{C}_{p^n}$ is unique up to isomorphism, and it is a fusion of any association $p$-schemes with degree $p^n$.

Elasticity M-tensors and the strong ellipticity condition

2020 ◽  
Vol 373 ◽  
pp. 124982 ◽  
Author(s):  
Weiyang Ding ◽  
Jinjie Liu ◽  
Liqun Qi ◽  
Hong Yan
Keyword(s):  
Strong Ellipticity ◽  
Ellipticity Condition ◽  
Strong Ellipticity Condition

On the two sided barrier problem

1965 ◽  
Vol 2 (01) ◽  
pp. 79-87
Author(s):  
Masanobu Shinozuka
Keyword(s):  
Random Process ◽  
Ground Motion ◽  
Lower Bounds ◽  
Present Method ◽  
Structural Response ◽  
Random Processes ◽  
Upper And Lower Bounds ◽  
Numerical Examples ◽  
Long Run ◽  
Barrier Problem

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.

THE RATE OF CONVERGENCE AND WEAKER CONVERGENT CONDITION FOR THE METHOD FOR FINDING THE LARGEST SINGULAR VALUE OF RECTANGULAR TENSORS

2016 ◽  
Vol 78 (6-5) ◽  
Author(s):  
Nur Fadhilah Ibrahim ◽  
Nurul Akmal Mohamed
Keyword(s):  
Quantum Physics ◽  
Solid Mechanics ◽  
Linear Convergence ◽  
Singular Value ◽  
Strong Ellipticity ◽  
Ellipticity Condition ◽  
Condition Problem ◽  
Strong Ellipticity Condition ◽  
Weak Irreducibility ◽  
Rectangular Tensors

The applications of real rectangular tensors, among others, including the strong ellipticity condition problem within solid mechanics, and the entanglement problem within quantum physics. A method was suggested by Zhou, Caccetta and Qi in 2013, as a means of calculating the largest singular value of a nonnegative rectangular tensor. In this paper, we show that the method converges under weak irreducibility condition, and that it has a Q-linear convergence.   

scholarly journals When is non-trivial estimation possible for graphons and stochastic block models?‡

2017 ◽  
Vol 7 (2) ◽  
pp. 169-181
Author(s):  
Audra McMillan ◽  
Adam Smith
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Upper Bound ◽  
Upper And Lower Bounds ◽  
Random Networks ◽  
Block Models

Abstract Block graphons (also called stochastic block models) are an important and widely studied class of models for random networks. We provide a lower bound on the accuracy of estimators for block graphons with a large number of blocks. We show that, given only the number $k$ of blocks and an upper bound $\rho$ on the values (connection probabilities) of the graphon, every estimator incurs error ${\it{\Omega}}\left(\min\left(\rho, \sqrt{\frac{\rho k^2}{n^2}}\right)\right)$ in the $\delta_2$ metric with constant probability for at least some graphons. In particular, our bound rules out any non-trivial estimation (that is, with $\delta_2$ error substantially less than $\rho$) when $k\geq n\sqrt{\rho}$. Combined with previous upper and lower bounds, our results characterize, up to logarithmic terms, the accuracy of graphon estimation in the $\delta_2$ metric. A similar lower bound to ours was obtained independently by Klopp et al.

SIMULATIONS OF UNARY ONE-WAY MULTI-HEAD FINITE AUTOMATA

2014 ◽  
Vol 25 (07) ◽  
pp. 877-896 ◽  
Author(s):  
MARTIN KUTRIB ◽  
ANDREAS MALCHER ◽  
MATTHIAS WENDLANDT
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Finite Automaton ◽  
Finite Automata ◽  
Upper And Lower Bounds ◽  
Unary Languages ◽  
Order Of Magnitude ◽  
Simulation Results ◽  
Special Case ◽  
Nondeterministic Finite Automaton

We investigate the descriptional complexity of deterministic one-way multi-head finite automata accepting unary languages. It is known that in this case the languages accepted are regular. Thus, we study the increase of the number of states when an n-state k-head finite automaton is simulated by a classical (one-head) deterministic or nondeterministic finite automaton. In the former case upper and lower bounds that are tight in the order of magnitude are shown. For the latter case we obtain an upper bound of O(n2k) and a lower bound of Ω(nk) states. We investigate also the costs for the conversion of one-head nondeterministic finite automata to deterministic k-head finite automata, that is, we trade nondeterminism for heads. In addition, we study how the conversion costs vary in the special case of finite and, in particular, of singleton unary lanuages. Finally, as an application of the simulation results, we show that decidability problems for unary deterministic k-head finite automata such as emptiness or equivalence are LOGSPACE-complete.

scholarly journals Measurement of Interobserver Disagreement: Correction of Cohen’s Kappa for Negative Values

2015 ◽  
Vol 2015 ◽  
pp. 1-8 ◽  
Author(s):  
Tarald O. Kvålseth
Keyword(s):  
Lower Bound ◽  
Statistical Inference ◽  
Lower Bounds ◽  
Interobserver Agreement ◽  
Negative Coefficient ◽  
Cohen’S Kappa ◽  
Marginal Distributions ◽  
Numerical Examples ◽  
Cohen's Kappa ◽  
Alternative Measures

As measures of interobserver agreement for both nominal and ordinal categories, Cohen’s kappa coefficients appear to be the most widely used with simple and meaningful interpretations. However, for negative coefficient values when (the probability of) observed disagreement exceeds chance-expected disagreement, no fixed lower bounds exist for the kappa coefficients and their interpretations are no longer meaningful and may be entirely misleading. In this paper, alternative measures of disagreement (or negative agreement) are proposed as simple corrections or modifications of Cohen’s kappa coefficients. The new coefficients have a fixed lower bound of −1 that can be attained irrespective of the marginal distributions. A coefficient is formulated for the case when the classification categories are nominal and a weighted coefficient is proposed for ordinal categories. Besides coefficients for the overall disagreement across categories, disagreement coefficients for individual categories are presented. Statistical inference procedures are developed and numerical examples are provided.

The accuracy of Rayleigh’s method of calculating the natural frequencies of vibrating systems

1952 ◽  
Vol 211 (1105) ◽  
pp. 204-224 ◽  
Keyword(s):  
Lower Bounds ◽  
Natural Frequencies ◽  
Hermitian Operator ◽  
Normal Modes ◽  
Comparison Theorems ◽  
Upper And Lower Bounds ◽  
Subsequent Paper ◽  
Numerical Examples ◽  
Modes Of Vibration ◽  
Vibrating Systems

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.

scholarly journals Bounds for spectral radius of nonnegative tensors using matrix-digragh-based approach

2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Guimin Liu ◽  
Hongbin Lv
Keyword(s):  
Spectral Radius ◽  
Lower Bounds ◽  
Upper And Lower Bounds ◽  
Nonnegative Tensor ◽  
Related Literature ◽  
Numerical Examples ◽  
Nonnegative Tensors

<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>

Sign in / Sign up

Export Citation Format

Share Document