Davenport, J., Bradford, R., England, M. and Wilson, D., 2012. Program Verification in the presence of complex numbers, functions with branch cuts etc. In: Proceedings of SYNASC 2012: 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing. Piscataway: IEEE, pp. 83-88.
In considering the reliability of numerical programs, it is normal to “limit our study to the semantics dealing with numerical precision” (Martel, 2005). On the other hand, there is a great deal of work on the reliability of programs that essentially ignores the numerics. The thesis of this paper is that there is a class of problems that fall between these two, which could be described as “does the lowlevel arithmetic implement the high-level mathematics”. Many of these problems arise because mathematics, particularly the mathematics of the complex numbers, is more difficult than expected: for example the complex function log is not continuous, writing down a program to compute an inverse function is more complicated than just solving an equation, and many algebraic simplification rules are not universally valid. The good news is that these problems are theoretically capable of being solved, and are practically close to being solved, but not yet solved, in several real-world examples. However, there is still a long way to go
|Item Type ||Book Sections|
|Creators||Davenport, J., Bradford, R., England, M. and Wilson, D.|
|Departments||Faculty of Science > Computer Science|
|Publisher Statement||Davenport_DBEW12.pdf: © 2012 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.|
Actions (login required)