You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/11449/74608
Title: 
Constrained intervals and interval spaces
Author(s): 
Institution: 
  • University of Colorado Denver
  • Universidade Estadual Paulista (UNESP)
ISSN: 
  • 1432-7643
  • 1433-7479
Abstract: 
Constrained intervals, intervals as a mapping from [0, 1] to polynomials of degree one (linear functions) with non-negative slopes, and arithmetic on constrained intervals generate a space that turns out to be a cancellative abelian monoid albeit with a richer set of properties than the usual (standard) space of interval arithmetic. This means that not only do we have the classical embedding as developed by H. Radström, S. Markov, and the extension of E. Kaucher but the properties of these polynomials. We study the geometry of the embedding of intervals into a quasilinear space and some of the properties of the mapping of constrained intervals into a space of polynomials. It is assumed that the reader is familiar with the basic notions of interval arithmetic and interval analysis. © 2013 Springer-Verlag Berlin Heidelberg.
Issue Date: 
19-Feb-2013
Citation: 
Soft Computing, v. 17, n. 8, p. 1393-1402, 2013.
Time Duration: 
1393-1402
Keywords: 
  • (standard) interval arithmetic
  • Constrained interval arithmetic
  • Interval analysis
  • Interval spaces
  • Interval arithmetic
  • Linear functions
  • Non negatives
  • Quasi-linear
  • Soft computing
  • Software engineering
  • Polynomials
Source: 
http://dx.doi.org/10.1007/s00500-013-1006-x
URI: 
Access Rights: 
Acesso restrito
Type: 
outro
Source:
http://repositorio.unesp.br/handle/11449/74608
Appears in Collections:Artigos, TCCs, Teses e Dissertações da Unesp

There are no files associated with this item.
 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.