QR_MUMPS
|
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | This file contains the routines for activation and cleaning of a front |
![]() ![]() | This file contains the module that holds the main data type for the analysis phase |
![]() ![]() | This file contains the qrm_amalg_tree routine which performs the amalgamation of the elimination tree |
![]() ![]() | This file contains the main analysis driver |
![]() ![]() | This file contains a subroutine for computing the least-squares solution of a problem |
![]() ![]() | |
![]() ![]() | This file contains a routine that applies Q to a vector/matrix |
![]() ![]() | This file contains a routine that applies Q' to a vector/matrix |
![]() ![]() | This file contains the routine that computes the graph of A^T * A |
![]() ![]() | This file contains a routine that merges the results of the singletons detection into the results of the analysis phase |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | This file contains the routine that check whether a provided permutation is good |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | This module contains generic interfaces for all the untyped routines |
![]() ![]() | This file contains the subroutine that compresses the result of several operations done during the analysis to a size that is proportional to the number of nodes in the elimination tree. These data are of size ~n in input |
![]() ![]() | This file contains the routine that computes the graph of a matrix |
![]() ![]() | |
![]() ![]() | This file contains the routine that performs the detection of singletons |
![]() ![]() | This file contains the routine that computes a COLAMD permutation of the input matrix |
![]() ![]() | This file contains the routine that computes a METIS permutation of the input matrix |
![]() ![]() | This file contains the routine computes (through different methods) a column permutation of the input matrix in order to reduce fill-in |
![]() ![]() | This file contains the routine that computes a SCOTCH permutation of the input matrix |
![]() ![]() | This file contains the routines that take care of factorizing sequentially an entire subtree |
![]() ![]() | This file contains the routine that computes the eliimation tree |
![]() ![]() | This file contains the module that implements the error management |
![]() ![]() | This file holds the core of the QR numerical factorization |
![]() ![]() | This file contains a subroutine that initializes the factorization |
![]() ![]() | This file contains the dqrm_factorization_mod with the generic interfaces for all the factorization related routines |
![]() ![]() | This file contains the main factorization driver |
![]() ![]() | This file contains the module which holds the data types used during the factorization |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | This file contains a routine which performs the initialization of a front |
![]() ![]() | |
![]() ![]() | This file contains a routine that does the sparse matrix - dense matrix product |
![]() ![]() | This file contains a routine that computes the norm of a sparse matrix |
![]() ![]() | This file contains the module that implements all the memory management |
![]() ![]() | This file contains a module with all the generic interfaces for the typed methods routines |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | This file contains the module which groups all the qr_mumps useful modules |
![]() ![]() | |
![]() ![]() | This file contains the routine that computes a postorder traversal of a tree |
![]() ![]() | This file contains various routine for printing trees |
![]() ![]() | FIXME: add comments |
![]() ![]() | This file contains the module that handles the front queues |
![]() ![]() | Contains a routine which can read a matrix from a Matrix-Market file |
![]() ![]() | This file contains a routine that does a dirty trick to convert a 1d array into a 2d array |
![]() ![]() | This file contains the routine that computes a reordering of the tree to reduce the search space for task scheduling |
![]() ![]() | This file contains a subroutine for computing the scaled norm of the residual |
![]() ![]() | This file contains a subroutine for computing the scaled norm of the product A'*r (orthogonality or residual to the image of A) |
![]() ![]() | This file contains a module that implements operations on RFPF matrices |
![]() ![]() | This file contains the routine that computes the rowcount for the R factor |
![]() ![]() | This file contains the routine which computes a row permutation that puts the input matrix into a staircase format |
![]() ![]() | This file contains a module that defines the data type for storing the results of the solve phase (not used at the moment) |
![]() ![]() | |
![]() ![]() | This file contains a module with generic interfaces for all the solve typed routines |
![]() ![]() | This file contains a routine that solves for R against multiple vectors |
![]() ![]() | This file contains a routine that solves for R' against multiple vectors |
![]() ![]() | This file contains a routine that handles the singletons front during the solve |
![]() ![]() | This file contains a module with sorting facilities |
![]() ![]() | This file contains the module that implements the main qr_mumps data structure |
![]() ![]() | This file contains a module that implements string handling tools |
![]() ![]() | This files contains the routine that does the symbolic factorization |
![]() ![]() | This file contains a module that implements all the task handling facilities |
![]() ![]() | This file contains a module for visualizing the execution profile of a parallel code |
![]() ![]() | This file contains a module with generic interfaces for a number of auxiliary tools |
![]() ![]() | This file contains a routine that computes the norm of a vector |
![]() ![]() |