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.

This software is also referenced in ORMS.

References in zbMATH (referenced in 90 articles , 1 standard article )

Showing results 61 to 80 of 90.
Sorted by year (citations)
  1. Bollhöfer, Matthias; Grote, Marcus J.; Schenk, Olaf: Algebraic multilevel preconditioner for the Helmholtz equation in heterogeneous media (2009)
  2. Duff, Iain S.: The design and use of a sparse direct solver for skew symmetric matrices (2009)
  3. Gravvanis, George A.: OpenMP based parallel normalized direct methods for sparse finite element linear systems (2009)
  4. Pingen, Georg; Evgrafov, Anton; Maute, Kurt: Adjoint parameter sensitivity analysis for the hydrodynamic lattice Boltzmann method with applications to design optimization (2009)
  5. Vdovina, Tetyana; Minkoff, Susan E.; Griffith, Sean M. L.: A two-scale solution algorithm for the elastic wave equation (2009)
  6. Zhang, Linbo: A parallel algorithm for adaptive local refinement of tetrahedral meshes using bisection (2009)
  7. Avron, Haim; Shklarski, Gil; Toledo, Sivan: Parallel unsymmetric-pattern multifrontal sparse LU with column preordering. (2008)
  8. Bahi, Jacques Mohcine; Contassot-Vivier, Sylvain; Couturier, Raphaël: Parallel iterative algorithms. From sequential to grid computing. (2008)
  9. Buttari, Alfredo; Dongarra, Jack; Kurzak, Jakub; Luszczek, Piotr; Tomov, Stanimire: Using mixed precision for sparse matrix computations to enhance the performance while achieving 64-bit accuracy. (2008)
  10. de Vicente, Javier; Valero, Eusebio; Theofilis, V.: Numerical considerations in spectral multidomain methods for biglobal instability analysis of open cavity configurations (2008)
  11. Hadri, Bilel; Garbey, Marc: A fast Navier Stokes flow simulation tool for image based CFD (2008)
  12. Pingen, Georg; Evgrafov, Anton; Maute, Kurt: A parallel Schur complement solver for the solution of the adjoint steady-state lattice Boltzmann equations: application to design optimisation (2008)
  13. Schenk, Olaf; Bollhöfer, Matthias; Römer, Rudolf A.: On large-scale diagonalization techniques for the Anderson model of localization (2008)
  14. Amestoy, Patrick R.; Li, Xiaoye S.; Ng, Esmond G.: Diagonal Markowitz scheme with local symmetrization (2007)
  15. Amestoy, Patrick R.; Li, Xiaoye S.; Pralet, Stéphane: Unsymmetric ordering using a constrained Markowitz scheme (2007)
  16. Buttari, Alfredo; D’Ambra, Pasqua; di Serafino, Daniela; Filippone, Salvatore: 2LEV-D2P4: a package of high-performance preconditioners for scientific and engineering applications (2007)
  17. Grigori, Laura; Demmel, James W.; Li, Xiaoye S.: Parallel symbolic factorization for sparse LU with static pivoting (2007)
  18. Grigori, Laura; Li, Xiaoye S.: Towards an accurate performance modeling of parallel sparse factorization (2007)
  19. Gupta, Anshul: A shared- and distributed-memory parallel general sparse direct solver (2007)
  20. Pingen, Georg; Evgrafov, Anton; Maute, Kurt: Topology optimization of flow domains using the lattice Boltzmann method (2007)