Universal numerical algorithms and their software implementation

Programming and Computer Software

Volumn 26, Issue 5, 2000, Pages 275-280

  Litvinov, G L ^a   Maslova, E V ^a  

^a International Centre Sophus Lie   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039974073     PISSN: 03617688     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02759321     Document Type: Article

References (19)

1. Backhouse, R., Jansson, P., Jeuring, J., and Meertens, L., Generic Programming - An Introduction, Lect. Notes Comput. Sci., 1999, vol. 1608, pp. 28-115.
2. ++, Moscow: Binom, 1999.
3. ++, Moscow: Binom, 1999.
4. Lehmann, D.J., Algebraic Structures for Transitive Closure, Theor. Comput. Sci., 1977, vol. 4, pp. 59-76.
5. Litvinov, G.L. and Maslov, V.P., Correspondence Principle for Idempotent Calculus and Some Computer Applications, Bures-sur-Yvette: Institut des Hautes Etudes Scientifiques, IHES/M/95/33, 1995. See also in Idempotency, Gunawardena, J. Ed., Cambridge: Newton Institute, Cambrige Univ. Press, 1998, pp. 420-443.
6. Litvinov, G.L. and Maslov, V.P., Correspondence Principle for Idempotent Calculus and Some Computer Applications, Bures-sur-Yvette: Institut des Hautes Etudes Scientifiques, IHES/M/95/33, 1995. See also in Idempotency, Gunawardena, J. Ed., Cambridge: Newton Institute, Cambrige Univ. Press, 1998, pp. 420-443.
7. Litvinov, G.L., Maslov, V.P., and Rodionov, A.Ya., Unifying Approach to Software and Hardware Design for Scientific Calculations, Preprint of Int. Sophus Lie Centre, 1995. See also LANL e-print archive (http://arXiv.org, quant-ph/9 904 024).
8. Kolokoltsov, V.N. and Maslov, V.P., Idempotent Analysis and Applications, Dordrecht: Kluwer, 1997.
9. Litvinov, G.L., Rodionov, A.Ya., and Churkin, A.V., Approximate Rational Arithmetic with Controllable Rounding Errors, in Vychislitel'nye tekhnologii (Computational Technologies) (in press).
10. Litvinov, G.L., Maslov, V.P., and Sobolevskii, A.N., Idempotent Mathematics and Interval Analysis, in Vychislitel'nye tekhnologii (Computational Technologies) (in press).
11. Litvinov G.L. and Sobolevskii, A.N., Exact Interval Solutions to the Discrete Bellman Equation and Polynomial Complexity of Problems in Interval Idempotent Linear Algebra, Dokl. Ross. Akad. Nauk (in press).
12. Matiyasevich, Yu.V., Real Numbers and Computers, Kibernetika i vychislitel'naya technika, 1986, issue 2, pp. 104-133.
13. Golan, J., Semirings and Their Applications, Dordrecht: Kluwer, 1999.
14. Carré, B.A., An Algebra for Network Routing Problems, J. Inst. Math. Appl., 1971, vol. 7, pp. 273-294.
15. Golub, G.H. and van Loan, C.F., Matrix Computations, John Hopkins Univ. Press, 1989. Translated under the title Matrichnye vychisleniya, Moscow: Mir, 1999.
16. Golub, G.H. and van Loan, C.F., Matrix Computations, John Hopkins Univ. Press, 1989. Translated under the title Matrichnye vychisleniya, Moscow: Mir, 1999.
17. Backhouse, R.C. and Carré, B.A., Regular Algebra Applied to Path-finding Problems, J. Inst. Math. Appl., 1975, vol. 15, pp. 161-186.
18. Rote, G.A., A Systolic Array Algorithm for the Algebraic Path Problem (Shortest Paths; Matrix Inversion), Computing, 1985, vol. 34, pp. 191-219.
19. Stepanov, A. and Lee, M., The Standard Template Library, Palo Alto: Hewlett-Packard, 1994.