Günthner E, Philippsen M (2000)
Publication Language: English
Publication Type: Journal article, Original article
Publication year: 2000
Book Volume: 12
Pages Range: 477-491
Journal Issue: 6
URI: http://www2.informatik.uni-erlangen.de/publication/download/complexe.pdf
DOI: 10.1002/1096-9128(200005)12:6<477::AID-CPE486>3.0.CO;2-W
Efficient and elegant complex numbers are one of the preconditions for the use of Java in scientific computing. This paper introduces a preprocessor and its translation rules that map a new basic type complex and its operations to pure Java. For the mapping it is insufficient to just replace one complex- variable with two double-variables. Compared to code that uses Complex objects and method invocations to express arithmetic operations, the new basic type increases readability and it is also executed faster. On average, the versions of our benchmark programs that use the basic type outperform the class-based versions by a factor of 2 up to 21 (depending on the JVM used).
APA:
Günthner, E., & Philippsen, M. (2000). Complex numbers for Java. Concurrency Practice and Experience, 12(6), 477-491. https://dx.doi.org/10.1002/1096-9128(200005)12:6<477::AID-CPE486>3.0.CO;2-W
MLA:
Günthner, Edwin, and Michael Philippsen. "Complex numbers for Java." Concurrency Practice and Experience 12.6 (2000): 477-491.
BibTeX: Download