summaryrefslogtreecommitdiff
path: root/math/arpack
AgeCommit message (Collapse)AuthorFilesLines
2016-03-25Libtoolize to provide shared libraries. Fixes parallel build as sidejoerg3-8/+67
effect. Bump revision.
2015-11-03Add SHA512 digests for distfiles for math categoryagc1-1/+3
Problems found locating distfiles: Package dfftpack: missing distfile dfftpack-20001209.tar.gz Package eispack: missing distfile eispack-20001130.tar.gz Package fftpack: missing distfile fftpack-20001130.tar.gz Package linpack: missing distfile linpack-20010510.tar.gz Package minpack: missing distfile minpack-20001130.tar.gz Package odepack: missing distfile odepack-20001130.tar.gz Package py-networkx: missing distfile networkx-1.10.tar.gz Package py-sympy: missing distfile sympy-0.7.6.1.tar.gz Package quadpack: missing distfile quadpack-20001130.tar.gz Otherwise, existing SHA1 digests verified and found to be the same on the machine holding the existing distfiles (morden). All existing SHA1 digests retained for now as an audit trail.
2014-10-15Racy build.joerg1-1/+4
2013-04-08Revert pkglint-induced nonsense.asau1-23/+35
2013-04-07Edited DESCR in the case of:rodent1-35/+23
File too long (should be no more than 24 lines). Line too long (should be no more than 80 characters). Trailing empty lines. Trailing white-space. Trucated the long files as best as possible while preserving the most info contained in them.
2013-04-06"This line belongs inside the .ifdef block."rodent1-3/+3
2012-09-11"user-destdir" is default these daysasau1-3/+1
2012-05-29Import ARPACK 96 as math/arpack.asau7-0/+157
Contributed to pkgsrc-wip by Jason Bacon. ARPACK is a collection of Fortran77 subroutines designed to solve large scale eigenvalue problems. The package is designed to compute a few eigenvalues and corresponding eigenvectors of a general n by n matrix A. It is most appropriate for large sparse or structured matrices A where structured means that a matrix-vector product w <- Av requires order n rather than the usual order n**2 floating point operations. This software is based upon an algorithmic variant of the Arnoldi process called the Implicitly Restarted Arnoldi Method (IRAM). When the matrix A is symmetric it reduces to a variant of the Lanczos process called the Implicitly Restarted Lanczos Method (IRLM). These variants may be viewed as a synthesis of the Arnoldi/Lanczos process with the Implicitly Shifted QR technique that is suitable for large scale problems. For many standard problems, a matrix factorization is not required. Only the action of the matrix on a vector is needed. ARPACK software is capable of solving large scale symmetric, nonsymmetric, and generalized eigenproblems from significant application areas. The software is designed to compute a few (k) eigenvalues with user specified features such as those of largest real part or largest magnitude. Storage requirements are on the order of n*k locations. No auxiliary storage is required. A set of Schur basis vectors for the desired k-dimensional eigen-space is computed which is numerically orthogonal to working precision. Numerically accurate eigenvectors are available on request. Important Features: o Reverse Communication Interface. o Single and Double Precision Real Arithmetic Versions for Symmetric, Non-symmetric, Standard or Generalized Problems. o Single and Double Precision Complex Arithmetic Versions for Standard or Generalized Problems. o Routines for Banded Matrices - Standard or Generalized Problems. o Routines for The Singular Value Decomposition. o Example driver routines that may be used as templates to implement numerous Shift-Invert strategies for all problem types, data types and precision.