Real-time Java simulations of multiple interference dielectric filters

An interactive Java applet for real-time simulation and visualization of the transmittance properties of multiple interference dielectric filters is presented. The most commonly used interference filters as well as the state-of-the-art ones are embedded in this platform-independent applet which can serve research and education purposes. The Transmittance applet can be freely downloaded from the site http://cpc.cs.qub.ac.uk.

Program summary

Program title: TransmittanceCatalogue identifier: AEBQ_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEBQ_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 5778No. of bytes in distributed program, including test data, etc.: 90 474Distribution format: tar.gzProgramming language: JavaComputer: Developed on PC-Pentium platformOperating system: Any Java-enabled OS. Applet was tested on Windows ME, XP, Sun Solaris, Mac OSRAM: VariableClassification: 18Nature of problem: Sophisticated wavelength selective multiple interference filters can include some tens or even hundreds of dielectric layers. The spectral response of such a stack is not obvious. On the other hand, there is a strong demand from application designers and students to get a quick insight into the properties of a given filter.Solution method: A Java applet was developed for the computation and the visualization of the transmittance of multilayer interference filters. It is simple to use and the embedded filter library can serve educational purposes. Also, its ability to handle complex structures will be appreciated as a useful research and development tool.Running time: Real-time simulations     

A completely open source based computing system for computer generation of Fourier holograms

Computer generated holograms are usually generated using commercial software like MATLAB, MATHCAD, Mathematica, etc. This work is an approach in doing the same using freely distributed open source packages and Operating System. A Fourier hologram is generated using this method and tested for simulated and optical reconstruction. The reconstructed images are in good agreement with the objects chosen. The significance of using such a system is also discussed.

Program summary

Program title: FHOLOCatalogue identifier: AEDS_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEDS_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 176 336No. of bytes in distributed program, including test data, etc.: 4 294 872Distribution format: tar.gzProgramming language: C++Computer: any X86 micro computerOperating system: Linux (Debian Etch)RAM: 512 MBClassification: 18Nature of problem: To generate a Fourier Hologram in micro computer only by using open source operating system and packages.Running time: Depends on the matrix size. 10 sec for a matrix of size 256×256.     

PArthENoPE: Public algorithm evaluating the nucleosynthesis of primordial elements

We describe a program for computing the abundances of light elements produced during Big Bang Nucleosynthesis which is publicly available at http://parthenope.na.infn.it/. Starting from nuclear statistical equilibrium conditions the program solves the set of coupled ordinary differential equations, follows the departure from chemical equilibrium of nuclear species, and determines their asymptotic abundances as function of several input cosmological parameters as the baryon density, the number of effective neutrino, the value of cosmological constant and the neutrino chemical potential. The program requires commercial NAG library routines.

Program summary

Program title: PArthENoPECatalogue identifier: AEAV_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEAV_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 10 033No. of bytes in distributed program, including test data, etc.: 46 002Distribution format: tar.gzProgramming language: Fortran 77Computer: PC-compatible running Fortran on Unix, MS Windows or LinuxOperating system: Windows 2000, Windows XP, LinuxClassification: 1.2, 1.9, 17.8External routines: NAG LibrariesNature of problem: Computation of yields of light elements synthesized in the primordial universe.Solution method: BDF method for the integration of the ODEs, implemented in a NAG routine.Running time: 90 sec with default parameters on a Dual Xeon Processor 2.4 GHz with 2 GB RAM.     

Algorithmic derivation of Dyson-Schwinger equations

We present an algorithm for the derivation of Dyson-Schwinger equations of general theories that is suitable for an implementation within a symbolic programming language. Moreover, we introduce the Mathematica package DoDSE¹ which provides such an implementation. It derives the Dyson-Schwinger equations graphically once the interactions of the theory are specified. A few examples for the application of both the algorithm and the DoDSE package are provided.

Program summary

Program title: DoDSECatalogue identifier: AECT_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AECT_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 105 874No. of bytes in distributed program, including test data, etc.: 262 446Distribution format: tar.gzProgramming language: Mathematica 6 and higherComputer: all on which Mathematica is availableOperating system: all on which Mathematica is availableClassification: 11.1, 11.4, 11.5, 11.6Nature of problem: Derivation of Dyson-Schwinger equations for a theory with given interactions.Solution method: Implementation of an algorithm for the derivation of Dyson-Schwinger equations.Unusual features: The results can be plotted as Feynman diagrams in Mathematica.Running time: Less than a second to minutes for Dyson-Schwinger equations of higher vertex functions.     

Visual tool for estimating the fractal dimension of images

This work presents a new Visual Basic 6.0 application for estimating the fractal dimension of images, based on an optimized version of the box-counting algorithm. Following the attempt to separate the real information from “noise”, we considered also the family of all band-pass filters with the same band-width (specified as parameter). The fractal dimension can be thus represented as a function of the pixel color code. The program was used for the study of paintings cracks, as an additional tool which can help the critic to decide if an artistic work is original or not.

Program summary

Program title: Fractal Analysis v01Catalogue identifier: AEEG_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEEG_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 29 690No. of bytes in distributed program, including test data, etc.: 4 967 319Distribution format: tar.gzProgramming language: MS Visual Basic 6.0Computer: PCOperating system: MS Windows 98 or laterRAM: 30MClassification: 14Nature of problem: Estimating the fractal dimension of images.Solution method: Optimized implementation of the box-counting algorithm. Use of a band-pass filter for separating the real information from “noise”. User friendly graphical interface.Restrictions: Although various file-types can be used, the application was mainly conceived for the 8-bit grayscale, windows bitmap file format.Running time: In a first approximation, the algorithm is linear.     

TiReX: Replica-exchange molecular dynamics using Tinker

We present a driver program for performing replica-exchange molecular dynamics simulations with the Tinker package. Parallelization is based on the Message Passing Interface, with every replica assigned to a separate process. The algorithm is not communication intensive, which makes the program suitable for running even on loosely coupled cluster systems. Particular attention is paid to the practical aspects of analyzing the program output.

Program summary

Program title: TiReXCatalogue identifier: AEEK_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEEK_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 43 385No. of bytes in distributed program, including test data, etc.: 502 262Distribution format: tar.gzProgramming language: Fortran 90/95Computer: Most UNIX machinesOperating system: LinuxHas the code been vectorized or parallelized?: parallelized with MPIClassification: 16.13External routines: TINKER version 4.2 or 5.0, built as a libraryNature of problem: Replica-exchange molecular dynamics.Solution method: Each replica is assigned to a separate process; temperatures are swapped between replicas at regular time intervals.Running time: The sample run may take up to a few minutes.     

Motion4D - A library for lightrays and timelike worldlines in the theory of relativity

The Motion4D-library solves the geodesic equation as well as the parallel- and Fermi-Walker-transport in four-dimensional Lorentzian spacetimes numerically. Initial conditions are given with respect to natural local tetrads which are adapted to the symmetries or the coordinates of the spacetime. Beside some already implemented metrics like the Schwarzschild and Kerr metric, the object oriented structure of the library permits to implement other metrics or integrators in a straight forward manner.

Program summary

Program title: Motion4D-libraryCatalogue identifier: AEEX_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEEX_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 150 425No. of bytes in distributed program, including test data, etc.: 5 139 407Distribution format: tar.gzProgramming language: C++Computer: All platforms with a C++ compilerOperating system: Linux, Unix, WindowsRAM: 39 MBytesClassification: 1.5External routines: Gnu Scientific Library (GSL) (http://www.gnu.org/software/gsl/)Nature of problem: Solve geodesic equation, parallel and Fermi-Walker transport in four-dimensional Lorentzian spacetimes.Solution method: Integration of ordinary differential equationsRunning time: The test runs provided with the distribution require only a few seconds to run.     

Solution of few-body problems with the stochastic variational method II: Two-dimensional systems

A computational approach is presented for efficient solution of two-dimensional few-body problems, such as quantum dots or excitonic complexes, using the stochastic variational method. The computer program can be used to calculate the energies and wave functions of various two-dimensional systems.

Program summary

Program title: svm-2dCatalogue identifier: AEBE_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEBE_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 5091No. of bytes in distributed program, including test data, etc.: 130 963Distribution format: tar.gzProgramming language: Fortran 90Computer: The program should work on any system with a Fortran 90 compilerOperating system: The program should work on any system with a Fortran 90 compilerClassification: 7.3Nature of problem: Variational calculation of energies and wave functions using Correlated Gaussian basis.Solution method: Two-dimensional few-electron problems are solved by the variational method. The ground state wave function is expanded into Correlated Gaussian basis functions and the parameters of the basis states are optimized by a stochastic selection procedure. Accurate results can be obtained for 2-6 electron systems.Running time: A couple of hours for a typical system.     

A cascadic monotonic time-discretized algorithm for finite-level quantum control computation

A computer package (CNMS) is presented aimed at the solution of finite-level quantum optimal control problems. This package is based on a recently developed computational strategy known as monotonic schemes.Quantum optimal control problems arise in particular in quantum optics where the optimization of a control representing laser pulses is required. The purpose of the external control field is to channel the system's wavefunction between given states in its most efficient way. Physically motivated constraints, such as limited laser resources, are accommodated through appropriately chosen cost functionals.

Program summary

Program title: CNMSCatalogue identifier: ADEB_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADEB_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 770No. of bytes in distributed program, including test data, etc.: 7098Distribution format: tar.gzProgramming language: MATLAB 6Computer: AMD Athlon 64 × 2 Dual, 2:21 GHz, 1:5 GB RAMOperating system: Microsoft Windows XPWord size: 32Classification: 4.9Nature of problem: Quantum controlSolution method: IterativeRunning time: 60-600 sec     

The Invar tensor package

The Invar package is introduced, a fast manipulator of generic scalar polynomial expressions formed from the Riemann tensor of a four-dimensional metric-compatible connection. The package can maximally simplify any polynomial containing tensor products of up to seven Riemann tensors within seconds. It has been implemented both in Mathematica and Maple algebraic systems.

Program summary

Program title:Invar Tensor PackageCatalogue identifier:ADZK_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADZK_v1_0.htmlProgram obtainable from:CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions:Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 136 240No. of bytes in distributed program, including test data, etc.:2 711 923Distribution format:tar.gzProgramming language:Mathematica and MapleComputer:Any computer running Mathematica versions 5.0 to 5.2 or Maple versions 9 and 10Operating system:Linux, Unix, Windows XPRAM:30 MbWord size:64 or 32 bitsClassification:5External routines:The Mathematica version requires the xTensor and xPerm packages. These are freely available at http://metric.iem.csic.es/Martin-Garcia/xActNature of problem:Manipulation and simplification of tensor expressions. Special attention on simplifying scalar polynomial expressions formed from the Riemann tensor on a four-dimensional metric-compatible manifold.Solution method:Algorithms of computational group theory to simplify expressions with tensors that obey permutation symmetries. Tables of syzygies of the scalar invariants of the Riemann tensor.Restrictions:The present versions do not fully address the problem of reducing differential invariants or monomials of the Riemann tensor with free indices.Running time:Less than a second to fully reduce a monomial of the Riemann tensor of degree 7 in terms of independent invariants.     

QCDMAPT: Program package for Analytic approach to QCD

A program package, which facilitates computations in the framework of Analytic approach to QCD, is developed and described in detail. The package includes both the calculated explicit expressions for relevant spectral functions up to the four-loop level and the subroutines for necessary integrals.

Program summary

Program title: QCDMAPTCatalogue identifier: AEGP_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEGP_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 2579No. of bytes in distributed program, including test data, etc.: 180 052Distribution format: tar.gzProgramming language: Maple 9 and higherComputer: Any which supports Maple 9Operating system: Any which supports Maple 9Classification: 11.1, 11.5, 11.6Nature of problem: Subroutines helping computations within Analytic approach to QCD.Solution method: A program package for Maple is provided. It includes both the explicit expressions for relevant spectral functions and the subroutines for basic integrals used in the framework of Analytic approach to QCD.Running time: Template program running time is about a minute (depends on CPU).     

A Maple package for verifying ultradiscrete soliton solutions

We present a computer algebra program for verifying soliton solutions of ultradiscrete equations in which both dependent and independent variables take discrete values. The package is applicable to equations and solutions that include the max function. The program is implemented using Maple software.

Program summary

Program title: UltdeCatalogue identifier: AEDB_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEDB_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 3171No. of bytes in distributed program, including test data, etc.: 13 633Distribution format: tar.gzProgramming language: Maple 10Computer: PC/AT compatible machineOperating system: Windows 2000, Windows XPRAM: Depends on the problem; minimum about 1 GBWord size: 32 bitsClassification: 5Nature of problem: The existence of multi-soliton solutions strongly suggest the integrability of nonlinear evolution equations. However enormous calculation is required to verify multi-soliton solutions of ultradiscrete equations. The use of computer algebra can be helpful in such calculations.Solution method: Simplification by using the properties of max-plus algebra.Restrictions: The program can only handle single ultradiscrete equations.Running time: Depends on the complexity of the equation and solution. For the examples included in the distribution the run times are as follows. (Core 2 Duo 3 GHz, Windows XP)

•

Example 1: 2725 sec.

•

Example 2: 33 sec.

•

Example 3: 1 sec.

     

QUBIT4MATLAB V3.0: A program package for quantum information science and quantum optics for MATLAB

A program package for MATLAB is introduced that helps calculations in quantum information science and quantum optics. It has commands for the following operations: (i) Reordering the qudits of a quantum register, computing the reduced state of a quantum register. (ii) Defining important quantum states easily. (iii) Formatted input and output for quantum states and operators. (iv) Constructing operators acting on given qudits of a quantum register and constructing spin chain Hamiltonians. (v) Partial transposition, matrix realignment and other operations related to the detection of quantum entanglement. (vi) Generating random state vectors, random density matrices and random unitaries.

Program summary

Program title:QUBIT4MATLAB V3.0Catalogue identifier:AEAZ_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEAZ_v1_0.htmlProgram obtainable from:CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions:Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.:5683No. of bytes in distributed program, including test data, etc.: 37 061Distribution format:tar.gzProgramming language:MATLAB 6.5; runs also on OctaveComputer:Any which supports MATLAB 6.5Operating system:Any which supports MATLAB 6.5; e.g., Microsoft Windows XP, LinuxClassification:4.15Nature of problem: Subroutines helping calculations in quantum information science and quantum optics.Solution method: A program package, that is, a set of commands is provided for MATLAB. One can use these commands interactively or they can also be used within a program.Running time:10 seconds-1 minute     

xPerm: fast index canonicalization for tensor computer algebra

We present a very fast implementation of the Butler-Portugal algorithm for index canonicalization with respect to permutation symmetries. It is called xPerm, and has been written as a combination of a Mathematica package and a C subroutine. The latter performs the most demanding parts of the computations and can be linked from any other program or computer algebra system. We demonstrate with tests and timings the effectively polynomial performance of the Butler-Portugal algorithm with respect to the number of indices, though we also show a case in which it is exponential. Our implementation handles generic tensorial expressions with several dozen indices in hundredths of a second, or one hundred indices in a few seconds, clearly outperforming all other current canonicalizers. The code has been already under intensive testing for several years and has been essential in recent investigations in large-scale tensor computer algebra.

Program summary

Program title: xPermCatalogue identifier: AEBH_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEBH_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 93 582No. of bytes in distributed program, including test data, etc.: 1 537 832Distribution format: tar.gzProgramming language: C and Mathematica (version 5.0 or higher)Computer: Any computer running C and Mathematica (version 5.0 or higher)Operating system: Linux, Unix, Windows XP, MacOSRAM:: 20 MbyteWord size: 64 or 32 bitsClassification: 1.5, 5Nature of problem: Canonicalization of indexed expressions with respect to permutation symmetries.Solution method: The Butler-Portugal algorithm.Restrictions: Multiterm symmetries are not considered.Running time: A few seconds with generic expressions of up to 100 indices. The xPermDoc.nb notebook supplied with the distribution takes approximately one and a half hours to execute in full.     

SUSY Les Houches Accord 2 I/O made easy

A library for reading and writing data in the SUSY Les Houches Accord 2 format is presented. The implementation is in native Fortran 77. The data are contained in a single array conveniently indexed by preprocessor statements.

Program summary

Program title: SLHA2LibCatalogue identifier: AEDY_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEDY_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 7550No. of bytes in distributed program, including test data, etc.: 160 123Distribution format: tar.gzProgramming language: FortranComputer: For the build process, a Fortran 77 compiler in a Unixish environment (make, shell) are requiredOperating system: Linux, Mac OS, Windows (Cygwin), Tru64 UnixRAM: The SLHA Record is currently 88 944 bytes longClassification: 4.14, 11.6Nature of problem: Exchange of SUSY parameters and decay information in an ASCII file format.Solution method: The SLHA2Lib provides routines for reading and writing files in the SUSY Les Houches Accord 2 format, a common interchange format for SUSY parameters and decay data.Restrictions: The fixed-sized array that holds the SLHA2 data necessarily limits the amount of decay data that can be stored. This limit can be enlarged by editing and re-running the SLHA2.m program.Unusual features: Data are transported in a single “double complex” array in Fortran, indexed through preprocessor macros. This is about the simplest conceivable container and needs neither dynamic memory allocation nor Fortran extension like structures.Running time: Both reading and writing a SLHA file are typically in the range of a few milliseconds.     

A web-deployed interface for performing ab initio molecular dynamics, optimization, and electronic structure in Fireball

Fireball is an ab initio technique for fast local orbital simulations of nanotechnological, solid state, and biological systems. We have implemented a convenient interface for new users and software architects in the platform-independent Java language to access Fireball's unique and powerful capabilities. The graphical user interface can be run directly from a web server or from within a larger framework such as the Computational Science and Engineering Online (CSE-Online) environment or the Distributed Analysis of Neutron Scattering Experiments (DANSE) framework. We demonstrate its use for high-throughput electronic structure calculations and a multi-100 atom quantum molecular dynamics (MD) simulation.

Program summary

Program title: FireballUICatalogue identifier: AECF_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AECF_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 279 784No. of bytes in distributed program, including test data, etc.: 12 836 145Distribution format: tar.gzProgramming language: JavaComputer: PC and workstationOperating system: The GUI will run under Windows, Mac and Linux. Executables for Mac and Linux are included in the package.RAM: 512 MBWord size: 32 or 64 bitsClassification: 4.14Nature of problem: The set up and running of many simulations (all of the same type), from the command line, is a slow process. But most research quality codes, including the ab initio tight-binding code FIREBALL, are designed to run from the command line. The desire is to have a method for quickly and efficiently setting up and running a host of simulations.Solution method: We have created a graphical user interface for use with the FIREBALL code. Once the user has created the files containing the atomic coordinates for each system that they are going to run a simulation on, the user can set up and start the computations of up to hundreds of simulations.Running time: 3 to 5 minutes on a 2 GHz Pentium IV processor.     

HypExp 2, Expanding hypergeometric functions about half-integer parameters

In this article, we describe a new algorithm for the expansion of hypergeometric functions about half-integer parameters. The implementation of this algorithm for certain classes of hypergeometric functions in the already existing Mathematica package HypExp is described. Examples of applications in Feynman diagrams with up to four loops are given.

New version program summary

Program title:HypExp 2Catalogue identifier:ADXF_v2_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADXF_v2_0.htmlProgram obtainable from:CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions:Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.:106 401No. of bytes in distributed program, including test data, etc.:2 668 729Distribution format:tar.gzProgramming language:MathematicaComputer:Computers running MathematicaOperating system:Linux, Windows, MacRAM:Depending on the complexity of the problemSupplementary material:Library files which contain the expansion of certain hypergeometric functions around their parameters are availableClassification:4.7, 5Does the new version supersede the previous version?:YesNature of problem:Expansion of hypergeometric functions about parameters that are integer and/or half-integer valued.Solution method:New algorithm implemented in Mathematica.Reasons for new version:Expansion about half-integer parameters.Summary of revisions:Ability to expand about half-integer valued parameters added.Restrictions:The classes of hypergeometric functions with half-integer parameters that can be expanded are listed below.Additional comments:The package uses the package HPL included in the distribution.Running time:Depending on the expansion.     

Gauss-Legendre and Chebyshev quadratures for singular integrals

Exact expressions are presented for efficient computation of the weights in Gauss-Legendre and Chebyshev quadratures for selected singular integrands. The singularities may be of Cauchy type, logarithmic type or algebraic-logarithmic end-point branching points. We provide Fortran 90 routines for computing the weights for both the Gauss-Legendre and the Chebyshev (Fejér-1) meshes whose size can be set by the user.

New program summary

Program title: SINGQUADCatalogue identifier: AEBR_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEBR_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 4128No. of bytes in distributed program, including test data, etc.: 25 815Distribution format: tar.gzProgramming language: Fortran 90Computer: Any with a Fortran 90 compilerOperating system: Linux, Windows, MacRAM: Depending on the complexity of the problemClassification: 4.11Nature of problem: Program provides Gauss-Legendre and Chebyshev (Fejér-1) weights for various singular integrands.Solution method: The weights are obtained from the condition that the quadrature of order N must be exact for a polynomial of degree?(N−1). The weights are expressed as moments of the singular kernels associated with Legendre or Chebyshev polynomials. These moments are obtained in analytic form amenable for computation.Additional comments: If the NAGWare f95 compiler is used, the option, “-kind = byte”, must be included in the compile command lines of the Makefile.Running time: The test run supplied with the distribution takes a couple of seconds to execute.     

Program package for multicanonical simulations of U(1) lattice gauge theory

We document our Fortran 77 code for multicanonical simulations of 4D U(1) lattice gauge theory in the neighborhood of its phase transition. This includes programs and routines for canonical simulations using biased Metropolis heatbath updating and overrelaxation, determination of multicanonical weights via a Wang-Landau recursion, and multicanonical simulations with fixed weights supplemented by overrelaxation sweeps. Measurements are performed for the action, Polyakov loops and some of their structure factors. Many features of the code transcend the particular application and are expected to be useful for other lattice gauge theory models as well as for systems in statistical physics.

Program summary

Program title: STMC_U1MUCACatalogue identifier: AEET_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEET_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 18 376No. of bytes in distributed program, including test data, etc.: 205 183Distribution format: tar.gzProgramming language: Fortran 77Computer: Any capable of compiling and executing Fortran codeOperating system: Any capable of compiling and executing Fortran codeClassification: 11.5Nature of problem: Efficient Markov chain Monte Carlo simulation of U(1) lattice gauge theory close to its phase transition. Measurements and analysis of the action per plaquette, the specific heat, Polyakov loops and their structure factors.Solution method: Multicanonical simulations with an initial Wang-Landau recursion to determine suitable weight factors. Reweighting to physical values using logarithmic coding and calculating jackknife error bars.Running time: The prepared tests runs took up to 74 minutes to execute on a 2 GHz PC.