Bounding the Range of a Rational Functiom over a Box

Kurzanzeige
dc.contributor.authorNarkawicz, Anthonydeu
dc.contributor.authorGarloff, Jürgen
dc.contributor.authorSmith, Andrew P.deu
dc.contributor.authorMunoz, César A.deu
dc.date.accessioned2013-03-19T12:18:53Zdeu
dc.date.available2013-03-19T12:18:53Zdeu
dc.date.issued2012deu
dc.description.abstractA 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.eng
dc.description.versionpublished
dc.identifier.citationReliable Computing ; 17 (2012). - S. 34-39deu
dc.identifier.ppn38026255Xdeu
dc.identifier.urihttp://kops.uni-konstanz.de/handle/123456789/21974
dc.language.isoengdeu
dc.legacy.dateIssued2013-03-19deu
dc.rightsterms-of-usedeu
dc.rights.urihttps://rightsstatements.org/page/InC/1.0/deu
dc.subjectBernstein polynomialsdeu
dc.subjectrational functiondeu
dc.subjectrange enclosuredeu
dc.subject.ddc510deu
dc.titleBounding the Range of a Rational Functiom over a Boxeng
dc.typeJOURNAL_ARTICLEdeu
dspace.entity.typePublication
kops.citation.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.}
}
kops.citation.iso690NARKAWICZ, 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-1340deu
kops.citation.iso690NARKAWICZ, 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-1340eng
kops.citation.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>
kops.description.openAccessopenaccessgolddeu
kops.flag.knbibliographytrue
kops.identifier.nbnurn:nbn:de:bsz:352-219744deu
kops.sourcefieldReliable Computing. 2012, <b>17</b>, pp. 34-39. ISSN 1573-1340deu
kops.sourcefield.plainReliable Computing. 2012, 17, pp. 34-39. ISSN 1573-1340deu
kops.sourcefield.plainReliable Computing. 2012, 17, pp. 34-39. ISSN 1573-1340eng
kops.submitter.emailjuergen.garloff@uni-konstanz.dedeu
relation.isAuthorOfPublication1334440c-fd44-4ab2-a83b-bf9d0308f277
relation.isAuthorOfPublication.latestForDiscovery1334440c-fd44-4ab2-a83b-bf9d0308f277
source.bibliographicInfo.fromPage34
source.bibliographicInfo.toPage39
source.bibliographicInfo.volume17
source.identifier.issn1573-1340deu
source.periodicalTitleReliable Computing

Dateien

Originalbündel

Gerade angezeigt 1 - 1 von 1
Vorschaubild nicht verfügbar
Name:
Narkawicz_219744.pdf
Größe:
282.36 KB
Format:
Adobe Portable Document Format
Narkawicz_219744.pdf
Narkawicz_219744.pdfGröße: 282.36 KBDownloads: 157

Lizenzbündel

Gerade angezeigt 1 - 1 von 1
Vorschaubild nicht verfügbar
Name:
license.txt
Größe:
1.92 KB
Format:
Plain Text
Beschreibung:
license.txt
license.txtGröße: 1.92 KBDownloads: 0

Sammlungen

Mathematik und Statistik: Publikationen