Search results for " Bounds"
showing 10 items of 291 documents
Lower bound limit analysis by bem: Convex optimization problem and incremental approach
2013
Abstract The lower bound limit approach of the classical plasticity theory is rephrased using the Multidomain Symmetric Galerkin Boundary Element Method, under conditions of plane and initial strains, ideal plasticity and associated flow rule. The new formulation couples a multidomain procedure with nonlinear programming techniques and defines the self-equilibrium stress field by an equation involving all the substructures (bem-elements) of the discretized system. The analysis is performed in a canonical form as a convex optimization problem with quadratic constraints, in terms of discrete variables, and implemented using the Karnak.sGbem code coupled with the optimization toolbox by MatLab…
Inductive inference of recursive functions: complexity bounds
1991
This survey includes principal results on complexity of inductive inference for recursively enumerable classes of total recursive functions. Inductive inference is a process to find an algorithm from sample computations. In the case when the given class of functions is recursively enumerable it is easy to define a natural complexity measure for the inductive inference, namely, the worst-case mindchange number for the first n functions in the given class. Surely, the complexity depends not only on the class, but also on the numbering, i.e. which function is the first, which one is the second, etc. It turns out that, if the result of inference is Goedel number, then complexity of inference ma…
Some results on generalized coherence of conditional probability bounds
2003
Based on the coherence principle of de Finetti and a related notion of generalized coherence (g-coherence), we adopt a probabilistic approach to uncertainty based on conditional probability bounds. Our notion of g-coherence is equivalent to the 'avoiding uniform loss' property for lower and upper probabilities (a la Walley). Moreover, given a g-coherent imprecise assessment by our algorithms we can correct it obtaining the associated coherent assessment (in the sense of Walley and Williams). As is well known, the problems of checking g-coherence and propagating tight g-coherent intervals are NP and FP^NP complete, respectively, and thus NP-hard. Two notions which may be helpful to reduce co…
Guaranteed error bounds for linear algebra problems and a class of Picard-Lindelöf iteration methods
2012
This study focuses on iteration methods based on the Banach fixed point theorem and a posteriori error estimates of Ostrowski. Their application for systems of linear simultaneous equations, bounded linear operators, as well as integral and differential equations is considered. The study presents a new version of the Picard–Lindelöf method for ordinary differential equations (ODEs) supplied with guaranteed and explicitly computable upper bounds of the approximation error. The estimates derived in the thesis take into account interpolation and integration errors and, therefore, provide objective information on the accuracy of computed approximations.
Expectation Damages and Bilateral Cooperative Investments
2012
We examine the efficiency of the standard breach remedy expectation damages in a setting where the buyer invests cooperatively and the seller invests both cooperatively and selfishly. Contracts may specify a required quality level and an upper bound to the seller's coordination costs. We find that it is optimal to write an augmented Cadillac contract in which quality is stipulated such that it cannot be met with positive probability together with a very low price. Thus, the seller becomes a residual claimant and the coordination-cost threshold can be used to balance the incentives of the buyer.
Uniformization of two-dimensional metric surfaces
2014
We establish uniformization results for metric spaces that are homeomorphic to the Euclidean plane or sphere and have locally finite Hausdorff 2-measure. Applying the geometric definition of quasiconformality, we give a necessary and sufficient condition for such spaces to be QC equivalent to the Euclidean plane, disk, or sphere. Moreover, we show that if such a QC parametrization exists, then the dilatation can be bounded by 2. As an application, we show that the Euclidean upper bound for measures of balls is a sufficient condition for the existence of a 2-QC parametrization. This result gives a new approach to the Bonk-Kleiner theorem on parametrizations of Ahlfors 2-regular spheres by qu…
Phenomenology of non-standard neutrino interactions
2016
Today neutrino physics is in a privileged position within the fascinating field of particle physics. From the discovery of neutrino oscillations by Super-Kamiokande in 1998, the door to physics beyond the Standard Model (SM in what follows) has been opened. This fact implies that neutrinos have to be massive in opposition to the Standard Model assumption. However, this is not a surprise completely, but it was already hinted from theoretical and experimental observations in the two decades prior to the discovery of the oscillatory phenomenon, as neutrino masses included in unification models or the observed deficit of the atmospheric and solar neutrino fluxes. As a consequence of this new pa…
Guaranteed error bounds and local indicators for adaptive solvers using stabilised space-time IgA approximations to parabolic problems
2019
The paper is concerned with space–time IgA approximations to parabolic initial–boundary value problems. We deduce guaranteed and fully computable error bounds adapted to special features of such type of approximations and investigate their efficiency. The derivation of error estimates is based on the analysis of the corresponding integral identity and exploits purely functional arguments in the maximal parabolic regularity setting. The estimates are valid for any approximation from the admissible (energy) class and do not contain mesh-dependent constants. They provide computable and fully guaranteed error bounds for the norms arising in stabilised space–time approximations. Furthermore, a p…
The Car Resequencing Problem with Pull-Off Tables
2011
AbstractThe car sequencing problem determines sequences of different car models launched down a mixed- model assembly line. To avoid work overloads of workforce, car sequencing restricts the maximum occurrence of labor-intensive options, e.g., a sunroof, by applying sequencing rules. We consider this problem in a resequencing context, where a given number of buffers (denoted as pull-off tables) is available for rearranging a stirred sequence. The problem is formalized and suited solution procedures are developed. A lower bound and a dominance rule are introduced which both reduce the running time of our graph approach. Finally, a real-world resequencing setting is investigated.
Prediction of the next value of a function
1981
The following model of inductive inference is considered. Arbitrary set tau = {tau_1, tau_2, ..., tau_n} of n total functions N->N is fixed. A "black box" outputs the values f(0), f(1), ..., f(m), ... of some function f from the set tau. Processing these values by some algorithm (a strategy) we try to predict f(m+1) from f(0), f(1), ..., f(m). Upper and lower bounds for average error numbers are obtained for prediction by using deterministic and probabilistic strategies.