Complex numbers for Java
Günthner E, Philippsen M (1999)
Publication Language: English
Publication Type: Conference contribution, Original article
Publication year: 1999
Publisher: Springer
Series: Lecture Notes in Computer Science
City/Town: Berlin Heidelberg
Book Volume: 1732
Pages Range: 1-12
Conference Proceedings Title: Computing in Object-Oriented Parallel Environments
Event location: San Francisco/USA
ISBN: 978-3-540-66818-3
URI: https://www2.cs.fau.de/publication/download/complexe.pdf
DOI: 10.1007/10704054_1
Abstract
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 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).
Authors with CRIS profile
How to cite
APA:
Günthner, E., & Philippsen, M. (1999). Complex numbers for Java. In Matsuoka, Satoshi ; Oldehoeft, Rodney R. ; Tholburn, Marydell (Eds.), Computing in Object-Oriented Parallel Environments (pp. 1-12). San Francisco/USA, US: Berlin Heidelberg: Springer.
MLA:
Günthner, Edwin, and Michael Philippsen. "Complex numbers for Java." Proceedings of the 3rd International Symposium on Computing in Object-Oriented Parallel Environments (ISCOPE'99), San Francisco/USA Ed. Matsuoka, Satoshi ; Oldehoeft, Rodney R. ; Tholburn, Marydell, Berlin Heidelberg: Springer, 1999. 1-12.
BibTeX: Download