Bounding the Range of a Rational Functiom over a Box

Narkawicz, Anthony; Garloff, Jürgen; Smith, Andrew P.; Munoz, César A.

Bounding the Range of a Rational Functiom over a Box

Dateien

Narkawicz_219744.pdfGröße: 282.36 KBDownloads: 92

Datum

2012

Autor:innen

Narkawicz, Anthony

Garloff, Jürgen

Smith, Andrew P.

Munoz, César A.

URI (zitierfähiger Link)

http://nbn-resolving.de/urn:nbn:de:bsz:352-219744

Link zur Lizenz

Urheberrechtlich geschützt

Open Access-Veröffentlichung

Open Access Gold

Sammlungen

Mathematik und Statistik

Publikationstyp

Zeitschriftenartikel

Publikationsstatus

Published

Erschienen in

Reliable Computing. 2012, 17, pp. 34-39. ISSN 1573-1340

Zusammenfassung

A simple method is presented by which tight bounds on the range of a multivariate rational function over a box can be computed. The approach relies on the expansion of the numerator and denominator polynomials into Bernstein polynomials.

Fachgebiet (DDC)

510 Mathematik

Schlagwörter

Bernstein polynomials, rational function, range enclosure

Zitieren

ISO 690

NARKAWICZ, Anthony, Jürgen GARLOFF, Andrew P. SMITH, César A. MUNOZ, 2012. Bounding the Range of a Rational Functiom over a Box. In: Reliable Computing. 2012, 17, pp. 34-39. ISSN 1573-1340

BibTex

@article{Narkawicz2012Bound-21974,
  year={2012},
  title={Bounding the Range of a Rational Functiom over a Box},
  volume={17},
  issn={1573-1340},
  journal={Reliable Computing},
  pages={34--39},
  author={Narkawicz, Anthony and Garloff, Jürgen and Smith, Andrew P. and Munoz, César A.}
}

RDF

<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/21974">
    <dc:creator>Garloff, Jürgen</dc:creator>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/21974"/>
    <dc:contributor>Smith, Andrew P.</dc:contributor>
    <dcterms:bibliographicCitation>Reliable Computing ; 17 (2012). - S. 34-39</dcterms:bibliographicCitation>
    <dc:creator>Munoz, César A.</dc:creator>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/21974/1/Narkawicz_219744.pdf"/>
    <dc:creator>Narkawicz, Anthony</dc:creator>
    <dcterms:abstract xml:lang="eng">A simple method is presented by which tight bounds on the range of a multivariate rational function over a box can be computed. The approach relies on the expansion of the numerator and denominator polynomials into Bernstein polynomials.</dcterms:abstract>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/21974/1/Narkawicz_219744.pdf"/>
    <dc:contributor>Munoz, César A.</dc:contributor>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-03-19T12:18:53Z</dcterms:available>
    <dc:contributor>Garloff, Jürgen</dc:contributor>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:creator>Smith, Andrew P.</dc:creator>
    <dcterms:title>Bounding the Range of a Rational Functiom over a Box</dcterms:title>
    <dcterms:issued>2012</dcterms:issued>
    <dc:rights>terms-of-use</dc:rights>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-03-19T12:18:53Z</dc:date>
    <dc:contributor>Narkawicz, Anthony</dc:contributor>
    <dc:language>eng</dc:language>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Ja