loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Making the Complex Simple
May/June 2007 (vol. 9 no. 3)
pp. 84-89
ASCII Text
x 
 
Julian V. Noble, "Making the Complex Simple," Computing in Science and Engineering, vol. 9, no. 3, pp. 84-89, May/June, 2007.
 
 
BibTex
x
 
@article{ 10.1109/MCSE.2007.54,
author = {Julian V. Noble},
title = {Making the Complex Simple},
journal ={Computing in Science and Engineering},
volume = {9},
number = {3},
issn = {1521-9615},
year = {2007},
pages = {84-89},
doi = {http://doi.ieeecomputersociety.org/10.1109/MCSE.2007.54},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - MGZN
JO - Computing in Science and Engineering
TI - Making the Complex Simple
IS - 3
SN - 1521-9615
SP84
EP89
EPD - 84-89
A1 - Julian V. Noble,
PY - 2007
KW - arithmetic
KW - algorithms
KW - vectors
VL - 9
JA - Computing in Science and Engineering
ER -
 
Julian V. Noble, University of Virginia
This installment of Computing Prescriptions illustrates how complex arithmetic can simplify algorithms in two-dimensional Cartesian vector space as well as how to make difficult numerical integrals tractable. In other words, computer languages for scientific applications should support complex arithmetic.
Index Terms:
arithmetic, algorithms, vectors
Citation:
Julian V. Noble, "Making the Complex Simple," Computing in Science and Engineering, vol. 9, no. 3, pp. 84-89, May/June 2007, doi:10.1109/MCSE.2007.54
Usage of this product signifies your acceptance of the Terms of Use.