Abstract
This article describes some internals of the design and implementation of an interpreted programming environment for scientific computing. A high level, hybrid approach to numerical computations is discussed with examples focused on sparse matrix computations.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
E. Anderson, 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. Society for Industrial and Applied Mathematics, Philadelphia, PA, third edition, 1999.
Anonymous. “Why APL”. http://www.acm.org/sigapl/whyapl.html.
Aptech Systems, Inc. “The GAUSS Mathematical and Statistical System”. http://www.aptech.com/.
E. Bacry. “LastWave, the signal processing command language”. http://www.cmap.polytechnique.fr/~bacry/LastWavea/.
R. N. Banerjee and M. W. Benson. “An approximate inverse based multigrid approach to biharmonic problem”. Inter. J. Computer Math., 40:201–210, 1991.
R. E. Bank and C. C. Douglas. “Sparse Matrix Multiplication Package (SMMP)”. correct version, 2001, http://citeseer.nj.nec.com/correct/445062, first appeared in Advances in Computational Mathematics, vol. 1, pp. 127–137, 1993.
P. Braaten, M. Sauvaud, and Ben Langmead. “An Environment for Sparse Matrix Computation”. http://www.cs.umn.edu/~saad/spmath/.
R. Cauble and A. Rodrigues. “Gnatlab, release version 0.99b Programmer’s Manual”. http://sourceforge.net/projects/gnatlab/.
C. Donnelly and R. Stallman. “The Bison Manual: Using the YACC-compatible Parser Generator”. GNU Press, version 1.35 edition, 2002.
J. A. Doornik and M. Ooms. “Introduction to Ox”, 2001. version 3.
I. S. Duff, M. A. Heroux, and R. Pozo. “An overview of the sparse basic linear algebra subprograms: The new standard from the BLAS technical forum”. ACM Transactions on Mathematical Software (TOMS), 28: 299–267, 2002.
J. Eaton. “GNU Octave, A high-level interactive language for numerical computations”. Edition 3 for version 2.0.5, http://www.octave.org/.
S. C. Eisenstat, H. C. Elman, M. H. Schultz, and A. H. Sherman. “The (new) Yale sparse matrix package”. In G. Birkhoff and A. Schoenstadt, editors, Elliptic problem solvers II, pages 45–52. Academic Press, 1984.
S. C. Eisenstat, M. C. Gursky, M. H. Schultz, and A. H. Sherman. “Yale sparse matrix package II: the nonsymmetric codes”. Technical Report Research Report 114, Department of Computer Science, Yale University, New Haven, CT, 1977.
S. C. Eisenstat, M. C. Gursky, M. H. Schultz, and A. H. Sherman. “Yale sparse matrix package I: the symmetric codes”. Int. J. Numer. Methods in Engin., 18:1145–1151, 1982.
V. Frayssé, L. Girand, S. Gratton, and J. Langou. “A Set of GMRES Routines for Real and Complex Arithmetics on High Performance Computers”. Technical Report TR/PA/03/3, CERFACS, 2003.
M. Galassi and J. Bloom. “Gnudl: The GNU Data Language”. http://nis-www.lanl.gov/~rosalia/.
R. Grothmann. “EULER, version 1.68”. http://www.rene-grothmann.de/.
K. S. Hunziker. “Algae, Another Matrix Programming Language”, 2002. version 4.0.1.
Abraxas Software Inc. “PCYACC — Portable Compiler Toolkit version 10.0”.
K. E. Iverson. “J Introduction and Dictionary”. Iverson Software, Inc., 1995.
P. Janhunen. “Tela User’s Guide”. http://www.geo.fmi.fi/prog/tela.html/.
S. C. Johnson. “Yet Another Compiler Compiler”. Technical Report Comp. Sci. Tech. Rep. No. 32, Bell Laboratories, 1975.
Kachina Technologies, Inc. “Scientific Applications on Linux”. http://www.kachinatech.com/.
B. Kernighan and R. Pike. “The UNIX Programming Environment”. Prentice-Hall, 1984.
M. E. Lesk. “Lex — A Lexical Analyzer Generator”. Technical Report Comp. Sci. Tech. Rep. No. 39, Bell Laboratories, 1975.
J. Levine, T. Mason, and D. Brown. “lex & yacc”. O’Reilly & Associates, Inc., 1995.
X. Li. “Xlab — An Interpreted Language of Matrix Computing”. Department of Applied Mathematics, The University of Western Ontario, Canada.
Numerical Algorithms Group Ltd. “NAG Numerical Libraries”.
M. Lutz. “Programming Python”. O’Reilly & Associates, 2 edition, 1998.
S. Mallat and Z. Zhang. “Matching pursuit with time-frequency dictionaries”. ftp://cs.nyu.edu/pub/wave/software/mpp.tar.Z.
MathSoft, Inc. “S-Plus 6.0 User’s Guide”, 2000.
MKS, Inc. “MKS lex and yacc Release Notes, Release 3.3.1”.
B. Mourrain and H. Prieto. “A framework for Symbolic and Numeric Computations”. Technical Report RR-4013, INRIA, 2000.
D. Munro. “Yorick version 1.4”. ftp://ftp-icf.llnl.gov/pub/Yorick/.
Netlib. “Netlib Libraries”. http://www.netlib.org/.
G. Nicol. “Fast Lexical Scanner Generator”. GNU Press, version 2.3.7 edition, 1993.
Research Systems, Inc. “What’s New in IDL 5.6”, 2002.
J. W. Ruge and K. Stuben. “Algebraic Multigrid”. In S. F. McCormic, editor, Multigrid Methods, volume 66. SIAM, Philadelphia, 1987.
Y. Saad. “SPARSKIT: a basic tool kit for sparse matrix computations (version 2, 1999)”. ftp://ftp.csd.umn.edu/dept/sparse/.
Scilab Group. “Introduction to Scilab: User’s Guide”. http://www.scilab.org.
I. Searle. “Rlab2 Reference Manual”, 1999. http://rlab.sourceforge.net/.
The MatheWorks, Inc. “MATLAB, The Language of Technical Computing”. version 5, 1999.
The R-Project for Statistical Computing. “An Introduction to R”. version 1.6.2 (2003-01-10), http://www.r-project.org/.
S. Wolfram. “The Mathematica Book”. Cambridge University Press, 4 edition, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ge, B. (2003). Programming in a High Level Approach for Scientific Computing. In: Kumar, V., Gavrilova, M.L., Tan, C.J.K., L’Ecuyer, P. (eds) Computational Science and Its Applications — ICCSA 2003. ICCSA 2003. Lecture Notes in Computer Science, vol 2667. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44839-X_70
Download citation
DOI: https://doi.org/10.1007/3-540-44839-X_70
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40155-1
Online ISBN: 978-3-540-44839-6
eBook Packages: Springer Book Archive