No coin nor oath required. For personal study only.
Computational methods
, S.C. and JP. Draayer BBTREE (Fortran, 659 cards). Balanced binary tree code for scientific applications ABJR 55 (1989) 189 Surguladze, L.R. and F.V. Tkachov LOOPS (Reduce, 663 cards). LOOPS: procedures for mulitloop calculations in quantum field theory for the REDUCE system ABJO 55 (1989) 205 Grotendorst, J. LEVIN (Maple, 879 cards). MAPLE programs for converting series expansions to rational functions using the Levin transformation. Automatic generation of FORTRAN functions for numerical applications ABLG 55 (1989) 325 Chen, Y.-M., A.E. Koniges and D.V. Anderson 0001 ILUBCG2-11 (Fortan, 872 cards). ILUBCG2-11: Solution of 11-banded nonsymmetric linear equation systems by a preconditioned biconjugate gradient routine AALX 55 (1989) 359 Gorishny, S.G., S.A. Larin, L.R. Surguladze and F.V. Tkachov MINCER (SCHOONSCHIP, 3707 cards). MINCER: program for multiloop calculations in quantum field theory for the SCHOONSCHIP system ABJQ 55 (1989) 381 Computer algebra Kaneko, T. and S. Kawabata SPROC (Fortran, 6626 cards). A preprocessor for FORTRAN source code produced by REDUCE ABLB 55 (1989) 141 Grotendorst, J.
๐ SIMILAR VOLUMES