About the Project

Artez Institute of Arts Computer Science Degree Certificate��������� ���aptao168���0wvV1

AdvancedHelp

(0.003 seconds)

31—40 of 323 matching pages

31: Barry I. Schneider
… …  1940 in Brooklyn, New York) is a staff member of the NIST Applied and Computational Mathematics Division. … Schneider’s current research interests span a broad number of areas of theoretical chemistry, atomic and molecular physics, numerical methods and high performance computing. …He is an Editor in Chief for Computers in Science and Engineering and a Specialist Editor for Computer Physics Communications. Recently he has served as Co-Chair of the US government Fast Track Action Committee to update the US strategic computing plan.
32: Bibliography T
  • A. Takemura (1984) Zonal Polynomials. Institute of Mathematical Statistics Lecture Notes—Monograph Series, 4, Institute of Mathematical Statistics, Hayward, CA.
  • N. M. Temme (1979a) An algorithm with ALGOL 60 program for the computation of the zeros of ordinary Bessel functions and those of their derivatives. J. Comput. Phys. 32 (2), pp. 270–279.
  • N. M. Temme (1987) On the computation of the incomplete gamma functions for large values of the parameters. In Algorithms for approximation (Shrivenham, 1985), Inst. Math. Appl. Conf. Ser. New Ser., Vol. 10, pp. 479–489.
  • N. M. Temme (1994b) Computational aspects of incomplete gamma functions with large complex parameters. In Approximation and Computation. A Festschrift in Honor of Walter Gautschi, R. V. M. Zahar (Ed.), International Series of Numerical Mathematics, Vol. 119, pp. 551–562.
  • I. Thompson (2013) Algorithm 926: incomplete gamma functions with negative arguments. ACM Trans. Math. Software 39 (2), pp. Art. 14, 9.
  • 33: Publications
  • D. W. Lozier (1997) Toward a Revised NBS Handbook of Mathematical Functions, Technical Report NISTIR 6072 (September 1997), National Institute of Standards and Technology. PDF
  • B. V. Saunders and Q. Wang (1999) Using Numerical Grid Generation to Facilitate 3D Visualization of Complicated Mathematical Functions, Technical Report NISTIR 6413 (November 1999), National Institute of Standards and Technology. PDF
  • Q. Wang and B. V. Saunders (1999) Interactive 3D Visualization of Mathematical Functions Using VRML, Technical Report NISTIR 6289 (February 1999), National Institute of Standards and Technology. PDF
  • A. Youssef (2006) Roles of Math Search in Mathematics, in Mathematical Knowledge Management, Proceedings of the 5th International Conference on Mathematical Knowledge Management, Lecture Notes in Computer Science, Vol. 4108, Springer-Verlag, 2006. PDF
  • B. Saunders and Q. Wang (2010) Tensor Product B-Spline Mesh Generation for Accurate Surface Visualizations in the NIST Digital Library of Mathematical Functions, in Mathematical Methods for Curves and Surfaces, Proceedings of the 2008 International Conference on Mathematical Methods for Curves and Surfaces (MMCS 2008), Lecture Notes in Computer Science, Vol. 5862, (M. Dæhlen, M. Floater., T. Lyche, J. L. Merrien, K. Mørken, L. L. Schumaker, eds), Springer, Berlin, Heidelberg (2010) pp. 385–393. PDF
  • 34: Bibliography C
  • C. Cerjan (Ed.) (1993) Numerical Grid Methods and Their Application to Schrödinger’s Equation. NATO Advanced Science Institutes Series C: Mathematical and Physical Sciences, Vol. 412, Kluwer Academic Publishers, Dordrecht.
  • M. Colman, A. Cuyt, and J. Van Deun (2011) Validated computation of certain hypergeometric functions. ACM Trans. Math. Software 38 (2), pp. Art. 11, 20.
  • Combinatorial Object Server (website) Department of Computer Science, University of Victoria, Canada.
  • L. Comtet (1974) Advanced Combinatorics: The Art of Finite and Infinite Expansions. enlarged edition, D. Reidel Publishing Co., Dordrecht.
  • E. D. Constantinides and R. J. Marhefka (1993) Efficient and accurate computation of the incomplete Airy functions. Radio Science 28 (4), pp. 441–457.
  • 35: 26.22 Software
    Also included are websites operated by university departments and consortia, research institutions, and peer-reviewed journals. … A more complete list of available software for computing these functions is found in the Software Index. …
  • GAP (website). A system for computational discrete algebra.

  • Magma (website). A computational algebra system.

  • 36: Bibliography H
  • P. I. Hadži (1968) Computation of certain integrals that contain a probability function. Bul. Akad. Štiince RSS Moldoven 1968 (2), pp. 81–104. (errata insert) (Russian).
  • R. L. Hall, N. Saad, and K. D. Sen (2010) Soft-core Coulomb potentials and Heun’s differential equation. J. Math. Phys. 51 (2), pp. Art. ID 022107, 19 pages.
  • C. Hastings (1955) Approximations for Digital Computers. Princeton University Press, Princeton, N.J..
  • H. J. Haubold, A. M. Mathai, and R. K. Saxena (2011) Mittag-Leffler functions and their applications. J. Appl. Math. 2011, pp. Art. ID 298628, 51 pages.
  • R. S. Heller (1976) 25D Table of the First One Hundred Values of j 0 , s , J 1 ( j 0 , s ) , j 1 , s , J 0 ( j 1 , s ) = J 0 ( j 0 , s + 1 ) , j 1 , s , J 1 ( j 1 , s ) . Technical report Department of Physics, Worcester Polytechnic Institute, Worcester, MA.
  • 37: Ingram Olkin
    Olkin’s degrees are B. … Olkin’s research covered a broad range of areas, including multivariate analysis, reliability theory, matrix theory, statistical models in the social and behavioral sciences, life distributions, and meta-analysis. … Olkin was elected a Fellow of the Institute of Mathematical Statistics in 1959, and President in 1984. …He also was a Guggenheim, Fulbright, Humboldt, and Lady Davis Fellow, had an honorary degree from De Montfort University, and was awarded the Townsend Harris Medal by the City University of New York. …
    38: Bibliography L
  • G. Labahn and M. Mutrie (1997) Reduction of Elliptic Integrals to Legendre Normal Form. Technical report Technical Report 97-21, Department of Computer Science, University of Waterloo, Waterloo, Ontario.
  • S. Lai and Y. Chiu (1990) Exact computation of the 3 - j and 6 - j symbols. Comput. Phys. Comm. 61 (3), pp. 350–360.
  • P. W. Lawrence, R. M. Corless, and D. J. Jeffrey (2012) Algorithm 917: complex double-precision evaluation of the Wright ω function. ACM Trans. Math. Software 38 (3), pp. Art. 20, 17.
  • D. N. Lehmer (1914) List of Prime Numbers from 1 to 10,006,721. Publ. No. 165, Carnegie Institution of Washington, Washington, D.C..
  • Y. L. Luke (1977b) Algorithms for the Computation of Mathematical Functions. Academic Press, New York.
  • 39: Bibliography S
  • M. R. Schroeder (2006) Number Theory in Science and Communication: With Applications in Cryptography, Physics, Digital Information, Computing, and Self-Similarity. 4th edition, Springer-Verlag, Berlin.
  • D. M. Smith (2011) Algorithm 911: multiple-precision exponential integral and related functions. ACM Trans. Math. Software 37 (4), pp. Art. 46, 16.
  • G. W. Spenceley and R. M. Spenceley (1947) Smithsonian Elliptic Functions Tables. Smithsonian Miscellaneous Collections, v. 109 (Publication 3863), The Smithsonian Institution, Washington, D.C..
  • K. Srinivasa Rao (1981) Computation of angular momentum coefficients using sets of generalized hypergeometric functions. Comput. Phys. Comm. 22 (2-3), pp. 297–302.
  • Stony Brook Algorithm Repository (website) Department of Computer Science, Stony Brook University, New York.
  • 40: Abdou Youssef
    … …  1960 in Lebanon) is Professor of Computer Science in, and Former Chairman of, the Department of Computer Science at The George Washington University, Washington, D. … degree in mathematics from the Lebanese University, and his M. …degrees in computer science from Princeton University. …  Scherson) of the book Interconnection Networks for High-Performance Parallel Computers, published by IEEE Computer Society Press in 1994.