Page 1

Displaying 1 – 10 of 10

Showing per page

On an algorithm for testing T4 solvability of max-plus interval systems

Helena Myšková (2012)

Kybernetika

In this paper, we shall deal with the solvability of interval systems of linear equations in max-plus algebra. Max-plus algebra is an algebraic structure in which classical addition and multiplication are replaced by and , where a b = max { a , b } , a b = a + b . The notation 𝔸 x = 𝕓 represents an interval system of linear equations, where 𝔸 = [ b ¯ , A ¯ ] and 𝕓 = [ b ̲ , b ¯ ] are given interval matrix and interval vector, respectively. We can define several types of solvability of interval systems. In this paper, we define the T4 solvability and give an algorithm...

On the Arithmetic of Errors

Markov, Svetoslav, Hayes, Nathan (2010)

Serdica Journal of Computing

An approximate number is an ordered pair consisting of a (real) number and an error bound, briefly error, which is a (real) non-negative number. To compute with approximate numbers the arithmetic operations on errors should be well-known. To model computations with errors one should suitably define and study arithmetic operations and order relations over the set of non-negative numbers. In this work we discuss the algebraic properties of non-negative numbers starting from familiar properties of...

Currently displaying 1 – 10 of 10

Page 1