About the Project

coding theory

AdvancedHelp

(0.002 seconds)

11—20 of 22 matching pages

11: Philip J. Davis
An interesting anecdote told by Davis reveals that he and mathematician Philip Rabinowitz were dubbed “Heroes of the SEAC” when their Gaussian integration code executed correctly on its first run. … At CalTech, John Todd dedicated himself to the training of new researchers in numerical analysis, and Olga Taussky, who had been a full-time NBS consultant influential in establishing the field of matrix theory, became the first woman at CalTech to attain the academic rank of full professor. …
12: Bibliography K
  • E. Kanzieper (2002) Replica field theories, Painlevé transcendents, and exact correlation functions. Phys. Rev. Lett. 89 (25), pp. (250201–1)–(250201–4).
  • N. P. Kirk, J. N. L. Connor, and C. A. Hobbs (2000) An adaptive contour code for the numerical evaluation of the oscillatory cuspoid canonical integrals and their derivatives. Computer Physics Comm. 132 (1-2), pp. 142–165.
  • A. Kneser (1927) Neue Untersuchungen einer Reihe aus der Theorie der elliptischen Funktionen. Journal für die Reine und Angenwandte Mathematik 158, pp. 209–218 (German).
  • K. Knopp (1964) Theorie und Anwendung der unendlichen Reihen. 4th edition, Die Grundlehren der mathematischen Wissenschaften, Band 2, Springer-Verlag, Berlin-Heidelberg (German).
  • M. Koecher (1954) Zur Theorie der Modulformen n -ten Grades. I. Math. Z. 59, pp. 399–416 (German).
  • 13: Bibliography F
  • B. R. Fabijonas, D. W. Lozier, and J. M. Rappoport (2003) Algorithms and codes for the Macdonald function: Recent progress and comparisons. J. Comput. Appl. Math. 161 (1), pp. 179–192.
  • B. R. Fabijonas (2004) Algorithm 838: Airy functions. ACM Trans. Math. Software 30 (4), pp. 491–501.
  • D. F. Fang and J. F. Shriner (1992) A computer program for the calculation of angular-momentum coupling coefficients. Comput. Phys. Comm. 70 (1), pp. 147–153.
  • R. C. Forrey (1997) Computing the hypergeometric function. J. Comput. Phys. 137 (1), pp. 79–100.
  • Y. V. Fyodorov (2005) Introduction to the Random Matrix Theory: Gaussian Unitary Ensemble and Beyond. In Recent Perspectives in Random Matrix Theory and Number Theory, London Math. Soc. Lecture Note Ser., Vol. 322, pp. 31–78.
  • 14: Bibliography P
  • K. A. Paciorek (1970) Algorithm 385: Exponential integral Ei ( x ) . Comm. ACM 13 (7), pp. 446–447.
  • G. Parisi (1988) Statistical Field Theory. Addison-Wesley, Reading, MA.
  • R. Piessens (1982) Automatic computation of Bessel function integrals. Comput. Phys. Comm. 25 (3), pp. 289–295.
  • S. Pokorski (1987) Gauge Field Theories. Cambridge Monographs on Mathematical Physics, Cambridge University Press, Cambridge.
  • T. Poston and I. Stewart (1978) Catastrophe Theory and its Applications. Pitman, London.
  • 15: Bibliography H
  • B. C. Hall (2013) Quantum theory for mathematicians. Graduate Texts in Mathematics, Vol. 267, Springer, New York.
  • T. Helgaker, P. Jørgensen, and J. Olsen (2012) Molecular Electronic-Structure Theory. John Wiley & Sons, New York.
  • I. D. Hill (1973) Algorithm AS66: The normal integral. Appl. Statist. 22 (3), pp. 424–427.
  • M. Hiyama and H. Nakamura (1997) Two-center Coulomb functions. Comput. Phys. Comm. 103 (2-3), pp. 209–216.
  • Y. P. Hsu (1993) Development of a Gaussian hypergeometric function code in complex domains. Internat. J. Modern Phys. C 4 (4), pp. 805–840.
  • 16: Bibliography M
  • I. D. Macdonald (1968) The Theory of Groups. Clarendon Press, Oxford.
  • A. J. MacLeod (1989) Algorithm AS 245. A robust and reliable algorithm for the logarithm of the gamma function. Appl. Statist. 38 (2), pp. 397–402.
  • W. Magnus (1941) Zur Theorie des zylindrisch-parabolischen Spiegels. Z. Physik 118, pp. 343–356 (German).
  • N. W. McLachlan (1934) Loud Speakers: Theory, Performance, Testing and Design. Oxford University Press, New York.
  • N. Michel (2007) Precise Coulomb wave functions for a wide range of complex , η and z . Computer Physics Communications 176 (3), pp. 232–249.
  • 17: Bibliography D
  • H. Davenport (2000) Multiplicative Number Theory. 3rd edition, Graduate Texts in Mathematics, Vol. 74, Springer-Verlag, New York.
  • N. G. de Bruijn (1981) Pólya’s Theory of Counting. In Applied Combinatorial Mathematics, E. F. Beckenbach (Ed.), pp. 144–184.
  • B. Deconinck, M. Heil, A. Bobenko, M. van Hoeij, and M. Schmies (2004) Computing Riemann theta functions. Math. Comp. 73 (247), pp. 1417–1442.
  • J. B. Dence and T. P. Dence (1999) Elements of the Theory of Numbers. Harcourt/Academic Press, San Diego, CA.
  • J. Dexter and E. Agol (2009) A fast new public code for computing photon orbits in a Kerr spacetime. The Astrophysical Journal 696, pp. 1616–1629.
  • 18: Bibliography L
  • S. Lai and Y. Chiu (1992) Exact computation of the 9 - j symbols. Comput. Phys. Comm. 70 (3), pp. 544–556.
  • A. M. Legendre (1808) Essai sur la Théorie des Nombres. 2nd edition, Courcier, Paris.
  • D. Lemoine (1997) Optimal cylindrical and spherical Bessel transforms satisfying bound state boundary conditions. Comput. Phys. Comm. 99 (2-3), pp. 297–306.
  • M. Lerch (1903) Zur Theorie der Gaußschen Summen. Math. Ann. 57 (4), pp. 554–567 (German).
  • R. L. Liboff (2003) Kinetic Theory: Classical, Quantum, and Relativistic Descriptions. third edition, Springer, New York.
  • 19: Software Index
    Open Source With Book Commercial
    27 Functions of Number Theory
  • Research Software.

    This is software of narrow scope developed as a byproduct of a research project and subsequently made available at no cost to the public. The software is often meant to demonstrate new numerical methods or software engineering strategies which were the subject of a research project. When developed, the software typically contains capabilities unavailable elsewhere. While the software may be quite capable, it is typically not professionally packaged and its use may require some expertise. The software is typically provided as source code or via a web-based service, and no support is provided.

  • Open Source Collections and Systems.

    These are collections of software (e.g. libraries) or interactive systems of a somewhat broad scope. Contents may be adapted from research software or may be contributed by project participants who donate their services to the project. The software is made freely available to the public, typically in source code form. While formal support of the collection may not be provided by its developers, within active projects there is often a core group who donate time to consider bug reports and make updates to the collection.

  • 20: Bibliography R
  • H. Rademacher (1973) Topics in Analytic Number Theory. Springer-Verlag, New York.
  • Yu. L. Ratis and P. Fernández de Córdoba (1993) A code to calculate (high order) Bessel functions based on the continued fractions method. Comput. Phys. Comm. 76 (3), pp. 381–388.
  • B. Riemann (1851) Grundlagen für eine allgemeine Theorie der Functionen einer veränderlichen complexen Grösse. Inauguraldissertation, Göttingen.
  • K. H. Rosen (2004) Elementary Number Theory and its Applications. 5th edition, Addison-Wesley, Reading, MA.
  • G. Rota (1964) On the foundations of combinatorial theory. I. Theory of Möbius functions. Z. Wahrscheinlichkeitstheorie und Verw. Gebiete 2, pp. 340–368.