<feed xmlns='http://www.w3.org/2005/Atom'>
<title>pkgsrc/math/arpack, branch pkgsrc-2014Q2</title>
<subtitle>[no description]</subtitle>
<id>https://git.osdyson.ru/mirror/pkgsrc/atom?h=pkgsrc-2014Q2</id>
<link rel='self' href='https://git.osdyson.ru/mirror/pkgsrc/atom?h=pkgsrc-2014Q2'/>
<link rel='alternate' type='text/html' href='https://git.osdyson.ru/mirror/pkgsrc/'/>
<updated>2013-04-08T18:29:37Z</updated>
<entry>
<title>Revert pkglint-induced nonsense.</title>
<updated>2013-04-08T18:29:37Z</updated>
<author>
<name>asau</name>
<email>asau@pkgsrc.org</email>
</author>
<published>2013-04-08T18:29:37Z</published>
<link rel='alternate' type='text/html' href='https://git.osdyson.ru/mirror/pkgsrc/commit/?id=0a282957a8d1af1213b6f62d847d50b694ea2d8b'/>
<id>urn:sha1:0a282957a8d1af1213b6f62d847d50b694ea2d8b</id>
<content type='text'>
</content>
</entry>
<entry>
<title>Edited DESCR in the case of:</title>
<updated>2013-04-07T20:49:31Z</updated>
<author>
<name>rodent</name>
<email>rodent@pkgsrc.org</email>
</author>
<published>2013-04-07T20:49:31Z</published>
<link rel='alternate' type='text/html' href='https://git.osdyson.ru/mirror/pkgsrc/commit/?id=56d0e89eec7a65cd783aaecd29fefde7b20f7a96'/>
<id>urn:sha1:56d0e89eec7a65cd783aaecd29fefde7b20f7a96</id>
<content type='text'>
 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.</content>
</entry>
<entry>
<title>"This line belongs inside the .ifdef block."</title>
<updated>2013-04-06T13:46:33Z</updated>
<author>
<name>rodent</name>
<email>rodent@pkgsrc.org</email>
</author>
<published>2013-04-06T13:46:33Z</published>
<link rel='alternate' type='text/html' href='https://git.osdyson.ru/mirror/pkgsrc/commit/?id=d590887fa36cf92b7e2167e239aa0e604f3e5146'/>
<id>urn:sha1:d590887fa36cf92b7e2167e239aa0e604f3e5146</id>
<content type='text'>
</content>
</entry>
<entry>
<title>"user-destdir" is default these days</title>
<updated>2012-09-11T23:04:15Z</updated>
<author>
<name>asau</name>
<email>asau@pkgsrc.org</email>
</author>
<published>2012-09-11T23:04:15Z</published>
<link rel='alternate' type='text/html' href='https://git.osdyson.ru/mirror/pkgsrc/commit/?id=b0feb9f5b186a62a131121fe59db9ccdc0a844bd'/>
<id>urn:sha1:b0feb9f5b186a62a131121fe59db9ccdc0a844bd</id>
<content type='text'>
</content>
</entry>
<entry>
<title>Import ARPACK 96 as math/arpack.</title>
<updated>2012-05-29T16:38:01Z</updated>
<author>
<name>asau</name>
<email>asau@pkgsrc.org</email>
</author>
<published>2012-05-29T16:38:01Z</published>
<link rel='alternate' type='text/html' href='https://git.osdyson.ru/mirror/pkgsrc/commit/?id=77f06b302e766547c101b832a623d67288a70125'/>
<id>urn:sha1:77f06b302e766547c101b832a623d67288a70125</id>
<content type='text'>
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 &lt;- 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.</content>
</entry>
</feed>
