superlu 3.0+20070106-3 source package in Ubuntu

Changelog

superlu (3.0+20070106-3) unstable; urgency=low

  * debian/control: changed XS-Vcs-*  to Vcs-*
  * Bug fix: "superlu: Please depend on libblas instead of refblas3",
    thanks to Colin Tuckley (Closes: #462290).

superlu (3.0+20070106-2) unstable; urgency=low

  [Christophe Prud'homme]
  * debian/control: update Standards-Version, no change
  * Bug fix: "superlu: Please depend on libblas instead of refblas3",
    thanks to Colin Tuckley (Closes: #462290).

 -- William Grant <email address hidden>   Fri,  14 Mar 2008 09:56:40 +0000

Upload details

Uploaded by:
William Grant
Uploaded to:
Hardy
Original maintainer:
Debian Scientific Computing Team
Architectures:
any
Section:
devel
Urgency:
Low Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Trusty release universe devel
Precise release universe devel

Downloads

File Size SHA-256 Checksum
superlu_3.0+20070106.orig.tar.gz 1.1 MiB d7425f8b66eed0ae0c126c4af162a88066c39a152e938d74ebbd351ec676d11c
superlu_3.0+20070106-3.diff.gz 4.7 KiB 0a21a9138dff21f718fe6268856cdd58cfe97e3165bbc7a7a57e7e2818795232
superlu_3.0+20070106-3.dsc 845 bytes 137d062ebab822b3c374586f3bcb232722f8f957dbcacc2b815bb31c930139bd

View changes file

Binary packages built by this source

libsuperlu3: No summary available for libsuperlu3 in ubuntu utopic.

No description available for libsuperlu3 in ubuntu utopic.

libsuperlu3-dev: Direct solution of large, sparse systems of linear equations

 SuperLU is a general purpose library for the direct solution of
 large, sparse, nonsymmetric systems of linear equations on high
 performance machines. The library is written in C and is callable from
 either C or Fortran. The library routines will perform an LU
 decomposition with partial pivoting and triangular system solves
 through forward and back substitution. The LU factorization routines
 can handle non-square matrices but the triangular solves are performed
 only for square matrices. The matrix columns may be preordered (before
 factorization) either through library or user supplied routines. This
 preordering for sparsity is completely separate from the
 factorization. Working precision iterative refinement subroutines are
 provided for improved backward stability. Routines are also provided
 to equilibrate the system, estimate the condition number, calculate
 the relative backward error, and estimate error bounds for the refined
 solutions.