@phdthesis{Hamadneh2018Bound-41052,
  year={2018},
  title={Bounding Polynomials and Rational Functions in the Tensorial and Simplicial Bernstein Forms},
  author={Hamadneh, Tareq},
  address={Konstanz},
  school={Universität Konstanz}
}

<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/41052">
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/41052/3/Hamadneh_2-1b4w1bae5w20e2.pdf"/>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/41052"/>
    <dc:rights>terms-of-use</dc:rights>
    <dcterms:issued>2018</dcterms:issued>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/41052/3/Hamadneh_2-1b4w1bae5w20e2.pdf"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:language>eng</dc:language>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-01-15T09:41:46Z</dc:date>
    <dcterms:title>Bounding Polynomials and Rational Functions in the Tensorial and Simplicial Bernstein Forms</dcterms:title>
    <dc:creator>Hamadneh, Tareq</dc:creator>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-01-15T09:41:46Z</dcterms:available>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:abstract xml:lang="eng">This thesis considers bounding functions for multivariate polynomials and rational functions over boxes and simplices. It also considers the synthesis of polynomial Lyapunov functions for obtaining the stability of control systems. Bounding the range of functions is an important issue in many areas of mathematics and its applications like global optimization, computer aided geometric design, robust control etc. The expansion of a given polynomial into Bernstein polynomials provides bounds for the range of this polynomial over the given domain. The Bernstein expansion is used due to the tightness of the enclosure and its rate of convergence to the true range. Bounds for the range of a rational function can easily obtained from the Bernstein expansions of the numerator and denominator polynomials of this function. The main achievements of this thesis are as follows: Firstly, we show that the 'enclosure' bounds converge monotonically and linearly to the range of the (polynomial and rational) function if the degree of the Bernstein expansion is elevated. If the region is subdivided then the convergence is quadratic with respect to the width of the subregions. The inclusion isotonicity and the sharpness property of the related enclosure function are investigated for polynomials and rational functions given over boxes or simplices. We provide a representation for computing the Bernstein coefficients and the enclosure bound of polynomials over a simplex. % Additionally, we study the face values of the simplicial Bernstein form. Algebraic identities certifying the positivity of polynomials and rational functions over boxes and simplices are given, i.e., certificates of positivity in the (tensorial and simplicial) Bernstein basis. Subdivision of a simplex is a widely applied scheme, wherein a starting region is successively subdivided into sub-regions. It follows that the barycentric Bernstein form is inclusion isotone and the certificates of positivity are local. The Lyapunov stability of systems is addressed over boxes and simplices. We consider the stability by developing algorithms to search for Lyapunov functions that demonstrate stability of control systems. We then extend these algorithms for obtaining the stability of the feedback controller design. Subsequently, the control synthesis problem is reduced to finite number of evaluations of a polynomial within a real bound in the space of parameters representing controls and Lyapunov functions. These results provide theoretical foundations for analysis and design of polynomial control systems, i.e., control systems with polynomial vector fields. Minimization of polynomials and rational functions over a given box or simplex is considered, too. Finally, several new methods are presented for the construction of affine lower bounding functions for polynomials and rational functions over boxes and simplices. The convergence properties of these bounds are shown.</dcterms:abstract>
    <dc:contributor>Hamadneh, Tareq</dc:contributor>
  </rdf:Description>
</rdf:RDF>