Applications/Hypre

From HPC
Revision as of 08:17, 24 April 2017 by Pysdlb (talk | contribs) (Created page with "__TOC__ ==Application Details== *Description: a software library of high performance preconditioners and solvers for the solution of large, sparse linear systems of equations...")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation , search

Application Details

  • Description: a software library of high performance preconditioners and solvers for the solution of large, sparse linear systems of equations on massively parallel computers
  • Version: 2.11.0 (compiled with intel)
  • Module: hypre/intel/2.11.0 and hypre/intel/2.11.0b
  • Licence: GNU

Usage Examples

hypre, a software library of high performance pre conditioners and solvers for the solution of large, sparse linear systems of equations on massively parallel computers. The hypre library was created with the primary goal of providing users with advanced parallel pre conditioners. The library features parallel multi-grid solvers for both structured and unstructured grid problems. For ease of use, these solvers are accessed from the application code via hypre’s conceptual linear system interfaces, which allow a variety of natural problem descriptions.

Module

[username@login01 ~]$ module add hypre/intel/2.11.0

Compilation

hypre is a library s it, or it could be required at compilation time also.

A typical C++ code snippet requiring hypre (source Github) is shown below:


  Description:    This code solves a system corresponding to a discretization
                   of the Laplace equation -Delta u = 1 with zero boundary
                   conditions on the unit square.  The domain is split into
                   a n x n grid of quadrilateral elements and each processors
                   owns a horizontal strip of size m x n, where m = n/nprocs. We
                   use bilinear finite element discretization, so there are
                   nodes (vertices) that are shared between neighbouring
                   processors. The Finite Element Interface is used to assemble
                   the matrix and solve the problem. Nine different solvers are
                   available.
*/

#include <math.h>
#include <iostream>
#include <fstream>
#include "_hypre_utilities.h"
#include "LLNL_FEI_Impl.h"

using namespace std;

#include "vis.c"

int main(int argc, char *argv[])
{
   int i, j, k;

   int nprocs, mypid;

   int n, m, offset;
   double h;

   int solverID;
   int vis;

   // Initialize MPI
   MPI_Init(&argc, &argv);
   MPI_Comm_size(MPI_COMM_WORLD, &nprocs);
   MPI_Comm_rank(MPI_COMM_WORLD, &mypid);

...


Further Information

Icon home.png