Exact Interval Solutions of the Discrete Bellman Equation and Polynomial Complexity of Problems in Interval Idempotent Linear Algebra

@inproceedings{Litvinov2001ExactIS,
  title={Exact Interval Solutions of the Discrete Bellman Equation and Polynomial Complexity of Problems in Interval Idempotent Linear Algebra},
  author={Grigori L. Litvinov and A N Sobolevskii},
  year={2001}
}
In this paper, we construct a solution to a linear matrix interval equation of the form X = AX + B (the discrete stationary Bellman equation) over partially ordered semirings, including the semiring R + of nonnegative real numbers and all idempotent semirings. We also discuss the computational complexity of problems in interval idempotent linear algebra (for more detail on idempotent mathematics , see, e.g., [1, 2]). In traditional interval analysis, problems of this kind are generally N P-hard… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Computational Complexity and Feasibility of Data Processing and Interval Computations. — Dordrecht: Kluwer

  • V Kreinovich, A V Lakeyev, J Rohn, P Kahl
  • Computational Complexity and Feasibility of Data…
  • 1998

Idempotent Analysis and Applications . — Dordrecht: Kluwer

  • V N Kolokoltsov, V P Malsov
  • Idempotent Analysis and Applications…
  • 1997

Introduction to Interval Computations

  • G Alefeld, J Herzberger
  • Introduction to Interval Computations
  • 1983

Methods and Applications of Interval Analysis. — Philadelphia: SIAM

  • R E Moore
  • Methods and Applications of Interval Analysis…
  • 1979

An algebra for network routing problems

  • B A Carré
  • J. Inst. Maths Applics. —
  • 1971

ACKNOWLEDGEMENTS: The authors are grateful to V. P. Maslov and S. P. Shary for useful discussions. The work was supported by Russian Foundation for Basic Research (project no

  • ACKNOWLEDGEMENTS: The authors are grateful to V…

Similar Papers

Loading similar papers…