Abstract

For solving the linear system A ⊗ x = b we introduce some iteration algorithms, where A = ( a ij ) and b = b i a given matrix and a column vector with elements from a Brouwerian lattice, and ⊗ is a max–min composite operation.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call