Writing scientific software: A guide for good style

Writing Scientific Software: A Guide for Good Style

Volumn 9780521858960, Issue , 2006, Pages 1-303

  Oliveira, Suely ^a   Stewart, David E ^a  

^a UNIVERSITY OF IOWA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS; COMPUTER PROGRAMMING; FORTRAN (PROGRAMMING LANGUAGE); HIGH LEVEL LANGUAGES; JAVA PROGRAMMING LANGUAGE; PROGRAM DEBUGGING; SOFTWARE TESTING;

COMPUTER SCIENTISTS; EXTENSIVE DESIGN; FORTRAN 90; GOOD CODE; GOOD PRACTICES; NUMERICAL SOFTWARE; SCIENTIFIC SOFTWARES; STYLE GUIDES;

C++ (PROGRAMMING LANGUAGE);

EID: 84925086494     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1017/CBO9780511617973     Document Type: Book

References (109)

1. ANSI/ISO/IEC. Fortran 2003 Standard: ISO/IEC 1539-1:2004, 2004. A draft standard from 2002 is available for free download from http://webstore.ansi.org/ansidocstore/default.asp; search for 1539-1.
2. Howard Anton. Elementary Linear Algebra. John Wiley & Sons, 9th edition, 2005.
3. Douglas Arnold. Some disasters attributable to bad numerical computing. URL: http://www.ima.umn.edu/~arnold/disasters/disasters.html, August 1998.
4. Kendall E. Atkinson. An Introduction to Numerical Analysis. John Wiley & Sons Inc., second edition, 1989.
5. Z. Bai, C. Bischof, S. Blackford, J. Demmel, J. Dongarra, J. Du Croz, A. Greenbaum, S. Hammarling, A. McKenney, and D. Sorensen. LAPACK Users’ Guide. SIAM 3rd edition, 1999.
6. Zhaojun Bai, James Demmel, Jack Dongarra, Axel Ruhe, and Henk van der Vorst, editors. Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide. Number 11 in Software, Environments, and Tools. SIAM 2000.
7. Richard Barrett, Michael W. Berry, Tony F. Chan, James Demmel, June Donato, Jack Dongarra, Victor Eijkhout, Roldan Pozo, Charles Romine, and Henk van der Vorst, editors. Templates for the Solution ofLinear Systems: Building Blocks for Iterative Methods. SIAM 1993.
8. BLAS technical forum. URL: www.netlib.org/blas/blast-forum/, 1999.
9. Hans Boehm. Bounding space usage of conservative garbage collectors. In Proceeedings of the 29th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 93-100, New York, January 2002. Association for Computing Machinery.
10. R. F. Boisvert, J. Hicklin, B. Miller, C. Moler, R. Pozo, K. Remington, and P. Webb. Jama: A Java matrix package, 1998. Library available through http://math.nist.gov/javanumerics/jama/.
11. Ronald F. Boisvert, Jack J. Dongarra, Roldan Pozo, Karin A. Remington, and G. W. Stewart. Developing numerical libraries in Java. Concurrency: Practice and Experience, 10:1117-1129, 1998.
12. Ronald F. Boisvert, Sally E. Howe, and David K. Kahaner. GAMS: A framework for the management of scientific software. ACM Transactions on Mathematical Software, 11(4):313-355, December 1985.
13. Susanne C. Brenner and L. Ridgway Scott. The Mathematical Theory of Finite Element Methods, volume 15 of Texts in Applied Mathematics. Springer-Verlag, second edition, 2002.
14. R. P. Brent. Algorithms for matrix multiplication. Technical Report TR-CS-70-157, Stanford University, March 1970.
15. R. P. Brent. Algorithms for Minimization without Derivatives. Automatic Computation. Prentice-Hall, 1973.
16. William L. Briggs, Van Emden Henson, and Steve F. McCormick. A Multigrid Tutorial. SIAM, second edition, 2000.
17. Frederick Brooks. The Mythical Man Month. Addison-Wesley, 1982.
18. R. L. Burden and J. D. Faires. Numerical Analysis. Wadsworth Group, 7th edition, 2001.
19. Conor Cahill. Dbmalloc documentation, 1990-1992. Available via http://dickey.his.com/dbmalloc/dbmalloc.html.
20. J. Carrier, L. Greengard, and V. Rokhlin. A fast adaptive multipole algorithm for particle simulations. SIAM J. Sci. Statist. Comput., 9(4):669-686, 1988.
21. Chromatic. Extreme Programming: Pocket Guide. O’Reilly & Associates, 2003.
22. James W. Cooley and John W. Tukey. An algorithm for the machine calculation of complex Fourier series. Math. Comp., 19:297-301, 1965.
23. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, 2nd edition, 2001.
24. BitMover Corp. Bitkeeper. Available via http://www.bitkeeper.com/
25. Intel Corp. IA-32 Intel Architecture Optimization Reference Manual. Number 248966-011. Intel Corp., 1999-2004. Available via http://developer.intel.com.
26. J. Date. An Introduction to Database Systems. Pearson/Addison Wesley, 8th edition, 2004.
27. Mark de Berg, Marc van Kreveld, Mark Overmars, and Otfried Schwarzkopf. Computational Geometry: Algorithms and applications. Springer-Verlag, 1997.
28. Erik Demaine. Cache-oblivious algorithms and data structures. In EEF Summer School on Massive Data Sets, Aarhus, Denmark, Lecture Notes in Computer Science. Springer, June-July 2002. To appear.
29. J. Dongarra, J. DuCroz, I. S. Duff, and S. Hammarling. A set of level-3 basic linear algebra subprograms. ACM Trans. Math. Software, 16:1-28, 1990.
30. J. Dongarra, J. DuCroz, S. Hammarling, and R. J. Hanson. An extended set of Fortran basic linear algebra subprograms. ACM Trans. Math. Software, 14:1-32, 1988.
31. Dale Dougherty and Arnold Robbins. sed & awk. O’Reilly Media, Inc., 2nd edition, 1997.
32. I. S. Duff, A. M. Erisman, and J. K. Reid. Direct Methods for Sparse Matrices. Monographs on Numerical Analysis. Oxford University Press, second edition, 1989.
33. I. S. Duff, M. A. Heroux, and R. Pozo. An overview of the sparse basic linear algebra subprograms: The new standard of the blas technical forum. ACM Transactions on Mathematical Software, 28(2):239-267, 2002. Current code available via http://math.nist.gov/spblas/.
34. Alan Edelman, Eric Kostlan, and Michael Shub. How many eigenvalues of a random matrix are real? J. Amer. Math. Soc., 7(1):247-267, 1994.
35. E. Elmroth, F. Gustavson, I. Jonsson, and B. Kagstrom. Recursive blocked algorithms and hybrid data structures for dense matrix library software. SIAM Rev., 46(1):3-45, March 2004.
36. K. Eriksson, D. Estep, P. Hansbo, and C. Johnson. Computational Differential Equations. Cambridge University Press, 1996.
37. James D. Foley, Andries van Dam, Steven K. Feiner, John F. Hughes, and Richard L. Phillips. Introduction to Computer Graphics. Addison-Wesley, 1st edition, 1993.
38. Association for Computing Machinery. Collected algorithms of the ACM. URL: http://www.acm.org/pubs/calgo/, 1960-2005. The algorithms in thic collection are mostly from the journal Transactions on Mathematical Software.
39. Matteo Frigo, Charles E. Leiserson, Harald Prokop, and Sridhar Ramachandran. Cache-oblivious algorithms. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science, pages 285-297, New York, October 1999. ACM.
40. E. Gamma, R. Helm, R. Johnson, and J. Vlissides. Design Patterns: Elements of Reusable Object-Oriented Software. Addison-Wesley Professional Computing Series. Addison-Wesley, 1994.
41. United States General Accounting Office (GAO). GAO report: Patriot missile defence - software problem led to system failure at Dharhan, Saudi Arabia. Available via
42. http://www.fas.org/spp/starwars/gao/im92 02 6.htm, 1992. GAO/IMTEC report # 92-26.
43. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, 1979.
44. A. George and J. Liu. Computer Solution of Large, Sparse, Positive-Definite Systems. Prentice-Hall, 1981.
45. David Goldberg. SmallTalk-80: the Language. Addison-Wesley, 1989.
46. David Goldberg. What every computer scientist should know about floating-point arithmetic. ACM Computing Surveys, 32(1):5-48, 1991.
47. G. Golub and C. Van Loan. Matrix Computations. Johns Hopkins Press, 2nd edition, 1989.
48. Leslie Greengard and Vladimir Rokhlin. A new version of the fast multipole method for the Laplace equation in three dimensions. In Acta Numerica, 1997, pages 229-269. Cambridge University Press, 1997.
49. E. Hairer, S. P. Norsett, and G. Wanner. Solving Ordinary Differential Equations I. Ser. in Comp. Math. #8. Springer-Verlag, 2nd edition, 1993.
50. E. Hairer and G. Wanner. Solving Ordinary Differential Equations II: Stiff and Differential-Algebraic Problems. Ser. in Comp. Math. #14. Springer-Verlag, 1991.
51. D. Harel and Y. Feldman. Algorithmics: The Spirit of Computing. Addison-Wesley, 3rd edition, 2004.
52. Donald Hearn and M. Pauline Baker. Computer Graphics, C Version. Prentice-Hall, 2nd edition, 1994.
53. N. J. Higham. Accuracy and Stability of Numerical Algorithms. SIAM, 1996.
54. Glenn Hinton, Dave Sager, Mike Upton, Darrell Boggs, Doug Carmean, Alan Kyker, and Patrice Roussel. The microarchitecture of the Pentium 4 processor. Intel Technology Journal, (Q1):1-12, 2001. Available at URL http://developer.intel.com/technology/itj/q12001.htm.
55. Ivar Holand. Sleipner A GBS Loss. Report 17. Main Report. SINTEF: Civil and Environmental Engineering report STF22-A97861, 1997.
56. R. A. Horne and C. A. Johnson. Matrix Analysis. Cambridge University Press, 1985.
57. J. C. Hubbell. You are under attack! The strange incident of October 5. Reader's Digest, 78(468):37-41, April 1961.
58. Thomas Huckle. Collection of software bugs. URL: http://www5.in.tum.de/~huckle/bugse.html, March 2004.
59. Andrew Hunt and David Thomas. The Pragmatic Programmer. Addison-Wesley, 1st edition, 2000.
60. IEEE. IEEE Standard 754-1985 Standard for Binary Floating Point Arithmetic, New York edition, 1985.
61. Intel Corp., Denver, CO. IA-32 Intel Architecture Software Developer's Manual, Volume 1: Basic Architecture, 2004.
62. Intel Corp., Denver, CO. IA-32 Intel Architecture Software Developer's Manual, Volume 3: System Programming Guide, 2004.
63. W. Kahan and Joseph D. Darcy. How Java's floating-point hurts everyone everywhere. Technical report, Department of Mathematics and Department of Electrical Engineering and Computer Science, University of California, Berkeley, Berkeley, CA, USA, June 1998.
64. Willliam Kahan. How futile are mindless assessments of roundoff in floating-point computation? Technical report, Department of Computer Science, University of California, Berkeley, June 2005. Available via http://www.cs.berkeley.edu/~wkahan/Mindless.pdf.
65. Willliam Kahan and Charles Severance. IEEE 754: An interview with William Kahan. IEEE Computer, 33(3):114-115, March 1998.
66. B. Kernighan and P. J. Plauger. The Elements of Programming Style. McGraw-Hill Publ., 2nd edition, 1978.
67. J. Kleinberg and E. Tardos. Algorithm Design. Pearson/Addison-Wesley, 2005.
68. G. Krasner, editor. SmallTalk-80: Bits of History, Words of Advice. Addison-Wesley series in computer science. Addison-Wesley, 1983.
69. Michael J. Laszlo. Computational Geometry and Computer Graphics in C++. Prentice Hall, Inc., 1996.
70. L. Lawson, R. J. Hanson, D. R. Kincaid, and F. T. Krogh. Basic linear algebra subprograms for Fortran usage. ACM Trans. Math. Software, 5:308-325, 1979.
71. Randall J. LeVeque. Finite Volume Methods for Hyperbolic Problems. Cambridge University Press, 2002.
72. J. L. Lions. Ariane 5: Flight 501 failure, report by the inquiry board. Originally appeared at
73. http://www.esrin.esa.it/htdocs/tidc/Press/Press9 6/ariane5rep.html. Available via http://www.ima.umn.edu/~arnold/disasters/ariane5rep.html., July 1996.
74. David Loshin. Efficient Memory Programming. McGraw-Hill, 1999.
75. Mark Lutz and David Ascher. Learning Python. O’Reilly Media, Inc., 2nd edition, 2003.
76. M. Mason. Pragmatic Version Control: using Subversion. Pragmatic Bookshelf, 2005.
77. S. F. McCormick, editor. Multigrid Methods. Frontiers in Applied Math. SIAM, 1987.
78. R. W. Mecklenburg. Managing Projects with GNU Make. O’Reilly Media, Inc., 3rd edition, 2005.
79. Bertrand Meyer. Eiffel: The Language. Prentice-Hall, 1991. Second revised printing, 1992. Third edition in preparation. Tutorials on Eiffel available online at http://docs.eiffel.com.
80. Webb Miller. Computational complexity and numerical stability. SIAM J. Comput., 4:97-107, 1975.
81. Webb Miller. The Engineering of Numerical Software. Prentice-Hall, Inc., 1984.
82. Jean Francois Monin. Understanding Formal Methods. Springer, 2003.
83. Gordon E. Moore. Cramming more components onto integrated circuits. Electronics, 38(8):114-117, 1965.
84. J. Nocedal and S. J. Wright. Numerical Optimization. Springer, 1999.
85. Jesper Holm Olsen and Sreren Christian Skov. Cache-oblivious algorithms in practice. Master's thesis, Department of Computer Science, University of Copenhagen, December 2002.
86. Michael L. Overton. Numerical Computing with IEEE Floating Point Arithmetic. SIAM, 2001.
87. Bruce Perens. Electric Fence documentation. Available via http://perens.com/FreeSoftware/.
88. Shari L. Pfleeger. Software Engineering: Theory and Practice. Prentice Hall, 2nd edition, 2001.
89. W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery. Numerical Recipies in C: the Art of Scientific Computing. Cambridge University Press, second edition, 1992.
90. Harald Prokop. Cache-oblivious algorithms. Master's thesis, Massachusetts Institute of Technology, Cambridge, MA, June 1999.
91. John Reid. The new features of Fortran 2003. Technical Report JTC1/SC22/WG5 N1579, ISO/IEC, JKR Associates, Oxon, UK, 2003. Available via URL http://www.kcl.ac.uk/kis/support/cit/fortran/john_reidnew_2003.pdf.
92. Ellen Siever, Stephen Spainhour, and Nathan Patwardhan. Perl in a Nutshell. O’Reilly Media, Inc., 2nd edition, 2002.
93. Silicon Graphics Inc. (SGI). Standard template library programmer's guide. Available via http://www.sgi.com/tech/stl/, 1993-2006.
94. E. Stewart and Z. Leyk. Meschach: Matrix Computations in C. Australian National University, Canberra, 1994. Proceedings of the CMA, #32.
95. G. W. Stewart. Building an old-fashioned sparse solver. Technical Report TR-203-95 or TR-4527, University of Maryland, College Park, Institute for Advanced Computer Studies, Department of Computer Science, August 2003.
96. David Stoutamire and Stephen Omohundro. Sather 1.1, August 1996. Available via http://www.icsi.berkeley.edu/~sather/.
97. Volker Strassen. Gaussian elimination is not optimal. Numer. Math., 13:354-356, 1969.
98. Bjarne Stroustrup. The C++ Programming Language. Pearson/Addison-Wesley, 3rd edition, 1997.
99. K. Stuben. A review of algebraic multigrid. J. Comput. Appl. Math., 128(1-2):281-309, 2001.
100. Sun Microsystems. The Java Tutorial, 2004. Available via http://java.sun.com/docs/books/tutorial/.
101. J. W. Thomas. Numerical Partial Differential Equations: Finite Difference Methods, volume 22 of Texts in Applied Mathematics. Springer-Verlag, 1995.
102. Lloyd N. Trefethen and David Bau III. Numerical Linear Algebra. SIAM, 1997.
103. U. Trottenberg, C. W. Oosterlee, and A. Schuller. Multigrid. Academic Press Inc., San Diego, CA, 2001. With contributions by A. Brandt, P. Oswald and K. Stuben.
104. Todd L. Veldhuizen and M. E. Jernigan. Will C++ be faster than Fortran? In Proceedings of the 1st International Scientific Computing in Object-Oriented Parallel Environments (ISCOPE’97), Marina delRey, CA, Springer-Verlag, 1997.
105. J. Vespemann. Essential CVS. O’Reilly Media, Inc., 2003.
106. Gray Watson. Dmalloc Documentation. Available via http://dmalloc.com/.
107. R. Clint Whaley, Antoine Petitet, and Jack J. Dongarra. Automated empirical optimization of software and the ATLAS project. Technical Report 147, LAPACK Working notes, September 2000. Available via netlib.
108. J. H. Wilkinson. The Algebraic Eigenvalue Problem. Oxford University Press, 1965.
109. Edward Yourdon. Rise and Resurrection of the American Programmer. Yourdon Press Computing Series. Prentice-Hall, 1996.