Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 9 of 9 for “"explicit bounds"”.
-
Some New Results on Difference Equations of Convolution Type
… solution, in terms of the coefficient sequence. Explicit bounds and rates of convergence are considered. We use these results to provide some new bounds for inverses of positive triangular matrices with monotonic column entries. We also refine a result of Vecchio and Mallik. This new result is …
-
New progress towards three open conjectures in geometric analysis
… nodal set results of Logonov-Malinnikova. I give explicit bounds for the eigenvalue exponent in terms of dimension, and make a slight improvement on their methodology.
-
Low complexity quantized controllers for LTI systems : peak-to-peak performance guarantees
… algorithm are then evaluated by providing explicit bounds on the peak-to-peak noise attenuation, in regards to the induced l[subscript infinity symbol] gain of the closed loop . This result is obtained by constructing a new class of storage functions that can be employed to verify the …
-
Applications of robust optimization to queueing and inventory systems
… based on robust optimization. We first derive explicit upper bounds on performance for tandem single class, multiclass single server, and single class multi-server queueing systems by solving appropriate robust optimization problems. We then show that these bounds derived by solving …
-
Large scale queueing systems : asymptotics and insights
… that occurs w.r.t. this rate, and prove explicit bounds on the distance to stationarity. The results of the first part of this thesis represent an important step towards understanding how to incorporate transient effects into the analysis of parallel server queues. In the second part of …
-
Robustness of Fixed Points of Quantum Processes
… structures of states and channels and establish explicit bounds on the approximation errors between the original- and new states and channels respectively. We find a particularly desirable form of these approximation errors for a variety of interesting examples. These include the structure of …
-
Novel probabilistic and distributed algorithms for guidance, control, and nonlinear estimation of large-scale multi-agent systems
… DBF algorithm are rigorously characterized. The explicit bounds on the time step of the robust DBF algorithm are shown to depend on the time-scale of the target dynamics. Furthermore, the DBF algorithm for linear-Gaussian models can be cast into a modified form of the Kalman information filter. …
-
Learning in Quantum Mechanics
… approximately optimal measurement exists, giving explicit bounds on the level of optimality. Finally, we give several necessary conditions, and one sufficient condition, for when a measurement is admissible. Given the fundamental nature of admissibility within classical parameter estimation, our …