SuperLU_DIST
4.0
superlu_dist on CPU and GPU clusters
|
![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() | |
![]() ![]() ![]() | Read the matrix from data file |
![]() ![]() ![]() | Read a DOUBLE PRECISION matrix stored in Harwell-Boeing format |
![]() ![]() ![]() | |
![]() ![]() ![]() | Driver program for PDGSSVX example |
![]() ![]() ![]() | Driver program for PDGSSVX example |
![]() ![]() ![]() | Driver program for pdgssvx_ABglobal example |
![]() ![]() ![]() | Driver program for PDGSSVX example |
![]() ![]() ![]() | Driver program for pdgssvx_ABglobal example |
![]() ![]() ![]() | Driver program for PDGSSVX example |
![]() ![]() ![]() | Driver program for pdgssvx_ABglobal example |
![]() ![]() ![]() | This example illustrates how to divide up the processes into subgroups |
![]() ![]() ![]() | This example illustrates how to divide up the processes into subgroups |
![]() ![]() ![]() | Driver program for pdgssvx_ABglobal example |
![]() ![]() ![]() | Performs LU factorization in parallel |
![]() ![]() ![]() | Perform LU factorization in parallel |
![]() ![]() ![]() | Performs block modifications |
![]() ![]() ![]() | Driver program for PZGSSVX example |
![]() ![]() ![]() | Driver program for PZGSSVX example |
![]() ![]() ![]() | Driver program for pzgssvx_ABglobal example |
![]() ![]() ![]() | Driver program for PZGSSVX example |
![]() ![]() ![]() | Driver program for pzgssvx_ABglobal example |
![]() ![]() ![]() | Driver program for PZGSSVX example |
![]() ![]() ![]() | Driver program for pzgssvx_ABglobal example |
![]() ![]() ![]() | This example illustrates how to divide up the processes into subgroups |
![]() ![]() ![]() | This example illustrates how to divide up the processes into subgroups |
![]() ![]() ![]() | Driver program for pzgssvx_ABglobal example |
![]() ![]() ![]() | |
![]() ![]() ![]() | Solves a system of linear equations A*X=B |
![]() ![]() ![]() | Performs the LU factorization in parallel |
![]() ![]() ![]() | Solves a system of distributed linear equations |
![]() ![]() ![]() | Performs block modifications |
![]() ![]() ![]() | Chooses machine-dependent parameters for the local environment |
![]() ![]() ![]() | Read the matrix from data file |
![]() ![]() ![]() | Read a DOUBLE COMPLEX PRECISION matrix stored in Harwell-Boeing format |
![]() ![]() ![]() | |
![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | Distribute the input matrix in a distributed compressed row format |
![]() ![]() ![]() | Fortran code for reading a sparse matrix in Harwell-Boeing format |
![]() ![]() ![]() | |
![]() ![]() ![]() | The driver program to solve a linear system with default options |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | The driver program to solve a linear system with default options |
![]() ![]() ![]() | Chooses machine-dependent parameters for the local environment |
![]() ![]() ![]() | C interface functions for the Fortran90 wrapper |
![]() ![]() ![]() | C interface functions for the Fortran90 wrapper |
![]() ![]() ![]() | This module contains Fortran-side wrappers for the SuperLU get/set functions |
![]() ![]() ![]() | This module contains some parameter used in SuperLU for Fortran90 user |
![]() ![]() ![]() | Fortran code for reading a sparse matrix in Harwell-Boeing format |
![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() | |
![]() ![]() ![]() | Macro definitions |
![]() ![]() ![]() | Broadcast an array of dtype numbers |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | Defines common arithmetic operations for complex type |
![]() ![]() ![]() | Header for dcomplex.c |
![]() ![]() ![]() | Distribute the matrix onto the 2D process mesh |
![]() ![]() ![]() | Computes row and column scalings |
![]() ![]() ![]() | Determines double precision machine parameters |
![]() ![]() ![]() | Returns the value of the one norm, the infinity norm, or the element of largest value |
![]() ![]() ![]() | Equilibrates a general sparse M by N matrix A |
![]() ![]() ![]() | Finds a row permutation so that the matrix has large entries on the diagonal |
![]() ![]() ![]() | Finds a row permutation so that the matrix has large entries on the diagonal |
![]() ![]() ![]() | Look-ahead update of the Schur complement |
![]() ![]() ![]() | Memory utilities |
![]() ![]() ![]() | Level 2 BLAS operations: solves and matvec, written in C |
![]() ![]() ![]() | Read a DOUBLE PRECISION matrix stored in Harwell-Boeing format |
![]() ![]() ![]() | Contributed by Francois-Henry Rouet |
![]() ![]() ![]() | Read a matrix stored in Rutherford-Boeing format |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | Scatter the computed blocks into LU destination |
![]() ![]() ![]() | THis file contains the main loop of pdgstrf which involves rank k update of the Schur complement. Uses 2D partitioning for the scatter phase |
![]() ![]() ![]() | This file contains the main loop of pdgstrf which involves rank k update of the Schur complement. Uses CUDA GPU |
![]() ![]() ![]() | Sparse BLAS 2, using some dense BLAS 2 operations |
![]() ![]() ![]() | Sparse BLAS3, using some dense BLAS3 operations |
![]() ![]() ![]() | Several matrix utilities |
![]() ![]() ![]() | Elimination tree computation and layout routines |
![]() ![]() ![]() | Gets matrix permutation |
![]() ![]() ![]() | Gets matrix permutation |
![]() ![]() ![]() | Extracts the main diagonal of matrix U |
![]() ![]() ![]() | |
![]() ![]() ![]() | Check if CA is the same letter as CB regardless of case |
![]() ![]() ![]() | These macros define which machine will be used |
![]() ![]() ![]() | Permute large entries to the main diagonal |
![]() ![]() ![]() | Memory utilities |
![]() ![]() ![]() | Implements the minimum degree algorithm |
![]() ![]() ![]() | An approximate minimum degree column ordering algorithm |
![]() ![]() ![]() | Colamd include file |
![]() ![]() ![]() | Re-distribute A on the 2D process mesh |
![]() ![]() ![]() | Computes row and column scalings |
![]() ![]() ![]() | Parallel sparse matrix-vector multiplication |
![]() ![]() ![]() | Performs sparse matrix-vector multiplication |
![]() ![]() ![]() | Improves the computed solution to a system of linear equations and provides error bounds and backward error estimates |
![]() ![]() ![]() | Improves the computed solution and provies error bounds |
![]() ![]() ![]() | Solves a system of linear equations A*X=B |
![]() ![]() ![]() | Solves a system of linear equations A*X=B, |
![]() ![]() ![]() | Performs LU factorization in parallel |
![]() ![]() ![]() | Performs panel LU factorization |
![]() ![]() ![]() | Performs LU factorization in parallel |
![]() ![]() ![]() | |
![]() ![]() ![]() | Performs the LU factorization in parallel |
![]() ![]() ![]() | Solves a system of distributed linear equations A*X = B with a general N-by-N matrix A using the LU factors computed previously |
![]() ![]() ![]() | Solves a system of distributed linear equations |
![]() ![]() ![]() | Solves a system of distributed linear equations A*X = B with a general N-by-N matrix A using the LU factorization |
![]() ![]() ![]() | Solves a system of distributed linear equations |
![]() ![]() ![]() | Perform local block modifications: lsum[i] -= L_i,k * X[k] |
![]() ![]() ![]() | Solves a lower triangular system L*X = B, with L being the lower triangular factor computed previously by PDGSTRF |
![]() ![]() ![]() | Returns the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest value |
![]() ![]() ![]() | Equilibrates a general sparse M by N matrix |
![]() ![]() ![]() | Redistribute the symbolic structure of L and U from the distribution |
![]() ![]() ![]() | Several matrix utilities |
![]() ![]() ![]() | Implements parallel symbolic factorization |
![]() ![]() ![]() | Definitions for parallel symbolic factorization routine |
![]() ![]() ![]() | Utilities for parallel symbolic factorization routine |
![]() ![]() ![]() | |
![]() ![]() ![]() | Re-distribute A on the 2D process mesh |
![]() ![]() ![]() | Computes row and column scalings |
![]() ![]() ![]() | Parallel sparse matrix-vector multiplication |
![]() ![]() ![]() | Performs sparse matrix-vector multiplication |
![]() ![]() ![]() | Improves the computed solution to a system of linear equations and provides error bounds and backward error estimates |
![]() ![]() ![]() | Improves the computed solution and provies error bounds |
![]() ![]() ![]() | Solves a system of linear equations A*X=B |
![]() ![]() ![]() | Solves a system of linear equations A*X=B, |
![]() ![]() ![]() | Performs LU factorization in parallel |
![]() ![]() ![]() | Performs panel LU factorization |
![]() ![]() ![]() | Performs LU factorization in parallel |
![]() ![]() ![]() | Solves a system of distributed linear equations A*X = B with a general N-by-N matrix A using the LU factors computed previously |
![]() ![]() ![]() | Solves a system of distributed linear equations |
![]() ![]() ![]() | Solves a system of distributed linear equations A*X = B with a general N-by-N matrix A using the LU factorization |
![]() ![]() ![]() | Perform local block modifications: lsum[i] -= L_i,k * X[k] |
![]() ![]() ![]() | Returns the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest value |
![]() ![]() ![]() | Equilibrates a general sparse M by N matrix |
![]() ![]() ![]() | Redistribute the symbolic structure of L and U from the distribution |
![]() ![]() ![]() | Several matrix utilities |
![]() ![]() ![]() | Determines single precision machine parameters |
![]() ![]() ![]() | Permutes the columns of the original matrix |
![]() ![]() ![]() | Chooses machine-dependent parameters for the local environment |
![]() ![]() ![]() | Performs static scheduling for the look-ahead factorization algorithm |
![]() ![]() ![]() | Distributed SuperLU data types and function prototypes |
![]() ![]() ![]() | Definitions which are precision-neutral |
![]() ![]() ![]() | Enum constants header file |
![]() ![]() ![]() | SuperLU grid utilities |
![]() ![]() ![]() | Returns the time in seconds used by the process |
![]() ![]() ![]() | Distributed SuperLU data types and function prototypes |
![]() ![]() ![]() | Matrix type definitions |
![]() ![]() ![]() | Performs a symbolic factorization |
![]() ![]() ![]() | Utilities functions |
![]() ![]() ![]() | Header for utilities |
![]() ![]() ![]() | |
![]() ![]() ![]() | Distribute the matrix onto the 2D process mesh |
![]() ![]() ![]() | Distribute the matrix onto the 2D process mesh |
![]() ![]() ![]() | Computes row and column scalings |
![]() ![]() ![]() | Returns the one norm, or the Frobenius norm, or the infinity norm, or the element of largest value |
![]() ![]() ![]() | Equilibrates a general sparse M by N matrix A |
![]() ![]() ![]() | Finds a row permutation so that the matrix has large entries on the diagonal |
![]() ![]() ![]() | Finds a row permutation so that the matrix has large entries on the diagonal |
![]() ![]() ![]() | Look-ahead update of the Schur complement |
![]() ![]() ![]() | Memory utilities |
![]() ![]() ![]() | Level 2 BLAS operations: solves and matvec, written in C |
![]() ![]() ![]() | Read a DOUBLE COMPLEX PRECISION matrix stored in Harwell-Boeing format |
![]() ![]() ![]() | Contributed by Francois-Henry Rouet |
![]() ![]() ![]() | Read a matrix stored in Rutherford-Boeing format |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | Scatter the computed blocks into LU destination |
![]() ![]() ![]() | THis file contains the main loop of pdgstrf which involves rank k update of the Schur complement. Uses 2D partitioning for the scatter phase |
![]() ![]() ![]() | This file contains the main loop of pzgstrf which involves rank k update of the Schur complement. Uses CUDA GPU |
![]() ![]() ![]() | Solves one of the systems of equations A*x = b, or A'*x = b |
![]() ![]() ![]() | Sparse BLAS3, using some dense BLAS3 operations |
![]() ![]() ![]() | Several matrix utilities |