Constrained intervals and interval spaces
Carregando...
Data
Autores
Orientador
Coorientador
Pós-graduação
Curso de graduação
Título da Revista
ISSN da Revista
Título de Volume
Editor
Tipo
Artigo
Direito de acesso
Acesso restrito
Resumo
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.
Descrição
Palavras-chave
(standard) interval arithmetic, Constrained interval arithmetic, Interval analysis, Interval spaces, Interval arithmetic, Linear functions, Non negatives, Quasi-linear, Soft computing, Software engineering, Polynomials
Idioma
Inglês
Citação
Soft Computing, v. 17, n. 8, p. 1393-1402, 2013.
