journal published by Baltzer
was only at netlib.bell-labs.com
This initiative is a step toward sharing information electronically, and it will allow scientists to: - provide complete and updated information on their own work, - have an efficient pointer to publications and ongoing research, and - simplify the work of preparing publications.
Not all C software is in this "miscellaneous" library. If it clearly fits into domain specific library, it is assigned there. The principal contents at present is the c/meschach subdirectory by David Stewart covering linear algebra and utilities. See c/index for details.
Comp Sci, K. U. Leuven, Celestijnenlaan 200A, B-3001 Heverlee, Belgium also called fitpack, but no connection with Alan Cline's library
removed; Diffpack is now a commercial package
Version: 5.3 Maintained-hy: fdlibm-comments@sun.com Platforms: Require ANSI C compiler with IEEE 754 style arithmetic Copying-Policy: Freely Redistributable Keywords: libm,exp,log,sin,cos,floating-point,IEEE754
This package consists of programs which perform Fast Fourier Transforms for both complex and real periodic sequences and certain other symmetric sequences.
CRAYFISHPAK is an expanded version of FISHPAK that has been totally rewritten for vector computers, on which order of magnitude speedups have been commonly observed. For more information, see http://www.greenmtn.com/software
For a current copy and for other routines, contact: Pleasant Valley Software, 8603 Altus Cove, Austin TX 78759, USA
Nominations welcome!
only available from Tennessee, until either they agree to use shorter filenames or Plan9 agrees to allow long filenames
fixed point, zero finding, and general homotopy curve tracking problems, utilizing both dense and sparse Jacobian matrices; ODE-based, normal flow, and augmented Jacobian.
Department of Computer Science, VPI & SU, Blacksburg, VA 24061
sqred, Van Loan's "square reduced" algorithm. Systems and Control Analysis and Design Environment by J. D. Birdwell.
Jacobi method, SOR, SSOR with conjugate gradient acceleration or with Chebyshev (semi-iteration - SI) acceleration.
kincaid@cs.utexas.edu oppe@scri1.scri.fsu.edu joubert@cs.utexas.edu Center for Numerical Analysis; (512) 471-1242 RLM Bldg. 13.150; University of Texas at Austin; Austin TX 78713-8510
real symmetric and Hermitian matrices singular values and vectors of real, rectangular matrices
Additional codes, for factored inverses, real symmetric generalized
Given an interpolation or approximation scheme, it allows the following questions, among others, to be answered: Does the scheme interpolate? How often is it differentiable? What functions does it reproduce exactly? If the scheme is polynomial, what is its polynomial degree? Where is the smoothness of a function reduced? Where are the bugs in a FORTRAN implementation?
801-581-6842 or 801-581-6851
A collection of Fortran subroutines to solve linear systems, to estimate the condition number or the norm of a matrix, to compute determinants, to multiply a matrix by a vector, to invert a matrix, to solve least squares problems, to perform unconstrained minimization, to compute eigenvalues, eigenvectors, the singular value decomposition, or the QR decomposition. The package has special routines for general, band, symmetric, indefinite, tridiagonal, upper Hessenberg, and circulant matrices.
Mathematics, Univ. Florida, Gainesville, FL 32611, hager@math.ufl.edu
colsys, dverk, rksuite, ode
A portable collection of Fortran subprograms for fitting a model to data. It is designed primarily for instances when the independent as well as the dependent variables have significant errors, implementing a highly efficient algorithm for solving the weighted orthogonal distance regression problem, i.e., for minimizing the sum of the squares of the weighted orthogonal distances between each data point and the curve described by the model equation.
subroutines and macors for writing portable parallel programs in Frtran or C for execution on a wide variety of parallel machines and workstation networks.
At present, codes from J.C. Nash, Compact Numerical Methods for Computers: Linear Algebra and Function Minimisation, Second Edition Adam Hilger: Bristol & American Institute of Physics: New York, 1990
It features adaptive local mesh refinement, multigrid iteration, and a pseudo-arclength continuation option for parameter dependencies. The package includes an initial mesh generator and several graphics packages.
Includes the latest version of Gay's NL2SOL nonlinear least squares. The rest of the PORT3 library is available by license from Lucent Technologies.
to make available draft documents, meeting notices, and minutes for its POSIX standardization activities. Initially, only a very limited subset of working groups and documents is provided.
Some calling sequences differ slightly from those in the book.
(slatec version)
lapack routines
implementation of parallel algorithms in a Fortran setting.
see /netlib/odepack
withdrawn by authors' request
This is a library of code, test data and harnesses for various kinds of string matching, includeing Boyer-Moore.
The TLS problem assumes an overdetermined set of linear equations AX = B, where both the data matrix A as well as the observation matrix B are inaccurate. The subroutine PTLS solves the Total Least Squares (TLS) problem by using a Partial Singular Value Decomposition (PSVD), hereby improving considerably the computational efficiency with respect to the classi- cal TLS algorithm.
Eric and Jack
Privacy and Security. Website maintained by David M. Gay. Last modified: 20 April 2009.
