|
 Application Catalog |
SuperLU
|
SuperLU is a general-purpose library for the direct solution of large, sparse, nonsymmetrical 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.
|
Category: Computational Mathematics
Sub Category: Quantum Mechanics
Publisher: Xiaoye S. Li and James W. Demmel, Computer Science Division, University of California at Berkeley
Date Published: January 2, 2006
Version: SuperLU_DIST 2.0
Pricing:
License: Free
Runtime:
$1/CPU-hr.
What is a CPU-hr.?
A CPU-hr. is the aggregate CPU time spent across all machines, rounded up to the nearest hour (e.g., a task running on 1,000 CPUs for one minute = 1,000 CPU minutes or approximately 17 CPU hours, costing you only $17).
|
Key Features
 |
- Supports both real and complex data types, in double precision.
- SuperLU_DIST includes a GESP algorithm designed for large-scale parallel machines. GESP stands for Gaussian Elimination with "Static Pivoting." Static pivoting is a technique that combines the numerical stability of partial pivoting with the scalability of no pivoting, to run accurately and efficiently on large numbers of processors.
- SuperLU_DIST is used to solve complex sparse linear systems up to order 2 million.
|
Description |
SuperLU is a general-purpose library for the direct solution of large, sparse, nonsymmetrical 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.
|
Technical Information |
Developer Web Page |
Publisher Information |
Xiaoye S. Li and James W. Demmel
Computer Science Division
University of California at Berkeley
Berkeley CA 94720-1776
SuperLU
|
Pricing and Payment Information |
License: Free
Order Information: N/A
|
Support: |
Mailing List Support: N/A
Email Support
Phone Support: N/A |
 See All Applications
|
JOIN NOW*
Get 20 CPU-hours for free!
Limited time only
*International Access - now available in 25 countries.
25 Countries
United States, Australia, Austria, Belgium, Canada, China, Czech Republic, Denmark, Finland, France, Germany, Greece, Hungary, India, Ireland, Italy, Japan, Netherlands, New Zealand, Poland, Portugal, Singapore, Spain, Sweden, and the United Kingdom.
Please fill out our form to be informed when service is available in your region.
|
