Explicit solutions to constrained linear MPC problems can be obtained by solving multi-parametric quadratic programs (mp-QP) where the parameters are the components of the state vector. We study the properties of the polyhedral partition of the state-space induced by the multiparametric piecewise linear solution and propose a new mp-QP solver. Compared to existing algorithms, our approach adopt...

This paper gives an analysis of surfaces generated by subdividing control nets of arbitrary topology. We assume that the underlying subdivision algorithm is stationary on the regular parts of the control nets and described by a matrix iteration around an extraordinary point. For these subdivision schemes we derive conditions on the spectrum of the matrix and its generalized eigenvectors such th...

Let TsH be the graph obtained from a given graph H by subdividing each edge s times. Motivated by a problem raised by Igor Pak [Mixing time and long paths in graphs, in Proc. of the 13th annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002) 321–328], we prove that, for any graph H , there exist graphs G with O(s) edges that are Ramsey with respect to TsH . Mathematics Subject Classificat...

In this paper, development of a semi-two- dimensional mathematical model called SDAR is introduced. The model is composed of two principal modules of hydraulics and sediment transport. The newly developed SDAR model has a number of capabilities including determination of sediment transport rate, aggradation - degradation calculation, longitudinal profile and lateral cross–sectional variation s...

the most costly operation in the oil exploration is the well network drilling. one of the most effectiveways to reduce the cost of drilling networks is decreasing the number of the required wells byselecting the optimum situation of the rig placement. in this paper, balas algorithm is used as a modelfor optimizing the cost function in oil well network, where the vertical and directional drillin...

In this paper, the problem of the minimal description of the structure of a vector function f (x) over an N-dimensional interval is studied. Methods adaptively subdividing the original interval in smaller subintervals and evaluating f (x) at only one point within each subin-terval are considered. Two partition strategies traditionally used for solving this problem are analyzed. A new partition ...

An adaptive algorithm to compute the medial axis transform of 2D polygonal domains with arbitrary genus is presented. The algorithm is based in the reenement of a coarse medial axis transform by subdividing the domain adaptively. The algorithm provides the medial axis represented by a set of triangles of a predeened size and the closest boundary element. Examples of results are also presented t...

Background CMR can provide details on ventricular pumping by subdividing the contribution to stroke volume (SV) into longitudinal shortening and radial inward motion of the ventricular borders. Previous studies have shown that patients with volume loaded dilated right ventricles (RV) due to pulmonary regurgitation (PR) have decreased longitudinal contribution to RVSV. Patients with atrial septa...

This paper presents and discusses a method for assuring an upper bound of the structured singular value (), by treating the frequency as a real parametric uncertainty on continuous time systems. Using this approach a complete frequency interval can be covered in one-computation. By subdividing the frequency range and using a pruning scheme an ee-cient and accurate method is obtained for computi...