R-psych provides a number of routines for personality, psychometrics and
experimental psychology. Functions are primarily for scale construction using
factor analysis, cluster analysis and reliability analysis, although others
provide basic descriptive statistics. Functions for simulating particular item
and test structures are included. Several functions serve as a useful front end
for structural equation modeling. Graphical displays of path diagrams, factor
analysis and structural equation models are created using basic graphics. Some
of the functions are written to support a book on psychometrics as well as
publications in personality research.
ARPACK-NG is a collection of Fortran77 subroutines designed to solve
large-scale eigenvalue problems. It is a fork of the Rice University
ARPACK, and is jointly-maintained by Debian, Octave, and Scilab.
A glm-like formula language to define dynamic generalized
linear models (state space models).
Includes functions for Kalman filtering and smoothing.
Estimation of variance matrices can be performed using
the EM algorithm in case of Gaussian models.
Provide for uniform handling of R's different time-based data classes
by extending zoo, maximizing native format information preservation
and allowing for user level customization and extension, while
simplifying cross-class interoperability.
Algotutor is an interactive program for observing the intermediate
steps of algorithms. The target audience is computer science students
and/or anyone who studies algorithms and/or data structures.
Before a calculation can be performed on a parallel computer, it must
first be decomposed into tasks which are assigned to different processors.
Efficient use of the machine requires that each processor have about the
same amount of work to do and that the quantity of interprocessor
communication is kept small. Finding an optimal decomposition is provably
hard, but due to its practical importance, a great deal of effort has been
devoted to developing heuristics for this problem. The decomposition
problem can be addressed in terms of graph partitioning.
Chaco implements a variety of algorithms for graph partitioning and is
used at most of the major parallel computing centers around the world to
simplify the development of parallel applications, and to ensure that high
performance is obtained. Chaco has contributed to a wide variety of
computational studies including investigation of the molecular structure
of liquid crystals, evaluating the design of a chemical vapor deposition
reactor and modeling automobile collisions.
Note: this port includes a patch provided by Walter Landry for use within
MBDyn.
A collection of non-proprietary, easily transportable Fortran
subprogram packages solving a variety of mathematical and statistical
problems.
This is the port of e, a tiny expression evaluator.
This is a port of Clp (Coin-or linear programming), which is an open-source
linear programming solver written in C++. It is primarily meant to be used as
a callable library, but a basic, stand-alone executable version is also
included.
At the suggestion of Linas Vepstas on the Gnu Scientific Library (GSL) list,
this GPL'd suite of random number tests will be named "Dieharder". Using a
movie sequel pun for the name is a double tribute to George Marsaglia, whose
"Diehard battery of tests" of random number generators has enjoyed years of
enduring usefulness as a test suite.
The dieharder suite is more than just the diehard tests cleaned up and given a
pretty GPL'd source face in native C: tests from the Statistical Test Suite
(STS) developed by the National Institute for Standards and Technology (NIST)
are being incorporated, as are new tests developed by rgb. Where possible,
tests are parametrized and controllable so that failure, at least, is
unambiguous.
A further design goal is to provide some indication of *why* a generator fails
a test, where such information can be extracted during the test process and
placed in usable form. For example, the bit-distribution tests should
(eventually) be able to display the actual histogram for the different bit
n-tuplets.
Dieharder is by design extensible. It is intended to be the "Swiss army knife
of random number test suites", or if you prefer, "the last suite you'll ever
ware" for testing random numbers.