Abstract
This paper provides a concise survey of the role played by vector and parallel computers in the solution of problems in computational mathematics. Some vectorization and parallelization techniques are discussed. Many examples illuminate the discussion.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Reference
Bernutat-Buchmann, U., Rudolph, D., and Schlosser, K.-H., 1983, “Parallel Computing I, Eine Bibliographie”, Bochumer Schriften zur Parallelen Datenverarbeitung 1, Computer Centre, Bochum, second ed., September 1983.
Böhm, A.P.W., 1983, “Dataflow Computation”, CWI Tract 6, Centre for Mathematics and Computer Science, Amsterdam.
Csanky, L., 1976, Fast parallel matrix inversion algorithms,SIAM J. Comput5: 618 –623.
Dongarra, J.J., Du Cros, J., Hammarling, S., and Hanson, R.J., 1984, A proposal for an extended set of Fortran Basic Linear Algebra Subprograms, Techn. Memo. No. 41, Argonne National Lab., Argonne, 111. 60439f December 1984.
Dongarra, J.J., Gustavson, F.G., and Karp, A., 1984, Implementing linear algebra algorithms for dense matrices on a vector pipeline machine,SIAM Review26: 91 –112.
Dongarra, J.J., and Hewitt, T., 1985, Implementing dense linear algebra algorithms using multitasking on the CRAY X-MP-4 (or approaching the gigaflop), Techn. Memo. No. 55, Argonne National Lab., Argonne, August 1985.
Duff, I.S., and Reid, J.K., eds., 1985, “Vector and Parallel Processors in Computational Science”, proceedings of the Second International Conference in VPPCS, Oxford, August 1984, North-Holland, Amsterdam.
Emmen, A.H.L., ed., 1985, “Supercomputer Applications”, Proceedings of the International Supercomputer Applications Symposium, Amsterdam, November 1984, North-Holland, Amsterdam.
Flynn, M.J., 1966, Very high speed computing systems,Proc. IEEE14: 1901 –1909.
Fornberg, B., 1981, A vector implementation of the Fast Fourier Transform Algorithm,Math. Comp.36: 189 –191
Heller, D., 1978, A survey of parallel algorithms in numerical linear algebra,SIAM Review20: 740 –777.
Hockney, R.W., and Jesshope, C.R., 1981, “Parallel Computers”, Adam Hilger Ltd., Bristol.
Hoffmann, W., 1985, Gaussian elimination algorithms on a vector computer, Rept. 85–10, Dept. of Math., Univ. of Amsterdam, June 1985.
Kindervater, G.A.P., and Lenstra, J.K., 1983, “Parallel algorithms in Combinatorial Optimization: an Annotated Bibliography”, Report BW189/83, Centre for Mathematics and Computer Science, August 1983.
Korn, D.G., and Lambiotte, J.L., Jr., 1979, Computing the Fast Fourier Transform on a vector computer,Math. Comp33: 977 –992.
Lawson, C., Hanson, R., Kincaid, D., and Krogh, F., 1979, Basic linear algebra subprograms for Fortran usage,ACM Trans, on Math. Software5: 308 –323.
Madsen, N.K., Rodrigue, G.H., and Karush, J.I., 1976, Matrix multiplication by diagonals on a vector/parallel processor,Information Process. Letters5: 41 –45.
Miranker, W.L., 1971, A survey of parallelism in numerical analysis,SIAM Review13: 524 –547.
Miranker, W.L., and Liniger, W.M., 1967, Parallel methods for the numerical integration of ODEs,Math. Comp21: 303 –320.
Ortega, J.M., and Voigt, R.G., 1985, “Solution of Partial Differential Equations on Vector and Parallel Computers”, ICASE Rept. No. 85–1, NASA Langley Research Center, Hamption, Virginia 23665, January 1985.
Riesel, H., 1985, “Prime Numbers and Computer Factorization”, Birkhauser.
Rodrigue, G.H., Madsen, N.K., and Karush, J.I., 1979, Odd-even reduction for banded linear equations,JACM26: 72 –81.
Sameh, A.H., 1977, Numerical parallel algorithms—A survey,in:“High Speed Computer and Algorithm Organization”, D.J. Kuck et al., eds., Academic Press, p. 207 –228.
Schendel, U., 1984, “Introduction to Numerical Methods for Parallel Computers” (translated from German), Ellis Horwood Ltd., Chichester.
Schwartz, J., 1983, “A Taxonomic Table of Parallel Computers, based on 55 Designs”, Ultra Computer Note No. 69, Courant Institute, New York University.
Shore, J.E., 1973, Second thoughts on parallel processing,Comp. Elect. Eng1: 95 –109.
Stone, H.S., 1973, An efficient parallel algorithm for the solution of a tridiagonal linear system of equations,JACM20: 27 –38.
Stone, H.S., 1973, Problems of parallel computation,in:“Complexity of Sequential and Parallel Numerical Algo-rithms”, J.F. Traub, ed., Academic Press, p. 1 –16.
Swartztrauber, 1984, FFT algorithms for vector computers,Parallel Computing1: 45 –63.
Sweet, R.A., 1977, A cyclic reduction algorithm for solving block-tridiagonal systems of arbitrary dimension,SIAM J. Numer. Anal14: 706 –719.
te Riele, H.J.J., Winter, D.T., and van de Lune, J., 1985, Numerical verification of the Riemann hypothesis on the CYBER 205,in:“Supercomputer Applications”, A.H.L. Emmen, ed., North-Holland, Amsterdam, p. 33 –38.
Traub, J.F., ed., 1973, “Complexity of Sequential and Parallel Numerical Algorithms”, Academic Press.
van de Lune, J., te Riele, H.J.J., and Winter, D.T.,1986, On the zeros of the Riemann zeta function in the critical strip. IV.,Math. Comp. 46:667–681.
van der Vorst, H.A., and van Kats, J.M., 1984, “The Performance of Some Linear Algebra Algorithms in Fortran on CRAY-1 and CYBER 205 Supercomputers”, Techn. Rep. TR-17, ACCU, Utrecht.
van Leeuwen, J., 1983, “Parallel Computers and Algorithms”,Rept. RUU-CS-83-13, RU Utrecht, September 1983.
Wang, H.H., 1980, On vectorizing the Fast Fourier Transform,BIT20: 233 –243.
Winter, D.T., and te Riele, H.J.J., 1985, Optimization of a program for the verification of the Riemann hypothesis,Supercomputer5: 29 –32.
Zakharov, V., 1984, Parallelism and array processing, IEEE Trans. Comp. C-33: 45 –78.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Plenum Press, New York
About this chapter
Cite this chapter
te Riele, H.J.J. (1989). Applications of Supercomputers in Mathematics. In: Devreese, J.T., Van Camp, P.E. (eds) Scientific Computing on Supercomputers. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0819-5_9
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0819-5_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8098-9
Online ISBN: 978-1-4613-0819-5
eBook Packages: Springer Book Archive