Hypre Hypre's goal of the Scalable Linear Solvers project is to develop scalable algorithms.
Download

Hypre Ranking & Summary

Hypre Tags

Scalable algorithms equations solver scalable algorithms solving sparse system Hypre

Hypre Description

Hypre's goal of the Scalable Linear Solvers project is to develop scalable algorithms. Hypre's goal of the Scalable Linear Solvers project is to develop scalable algorithms and software for solving large, sparse linear systems of equations on parallel computers.The primary software product is hypre, a library of high performance preconditioners that features parallel multigrid methods for both structured and unstructured grid problems.The problems of interest arise in the simulation codes being developed at LLNL and elsewhere to study physical phenomena in the defense, environmental, energy, and biological sciences.Although parallel processing is necessary for the numerical solution of these problems, alone it is not sufficient. Scalable numerical algorithms are also required. By "scalable" we generally mean the ability to use additional computational resources effectively to solve increasingly larger problems. Many factors contribute to scalability, including the architecture of the parallel computer and the parallel implementation of the algorithm. However, one important issue is often overlooked: the scalability of the algorithm itself. Here, scalability is a description of how the total computational work requirements grow with problem size, which can be discussed independent of the computing platform.Many of the algorithms used in today's simulation codes are based on yesterday's unscalable technology. This means that the work required to solve increasingly larger problems grows much faster than linearly (the optimal rate). The use of scalable algorithms can decrease simulation times by several orders of magnitude, thus reducing a two-day run on an MPP to 30 minutes. Furthermore, the codes that use this technology are limited only by the size of the machine's memory because they are able to effectively exploit additional computer resources to solve huge problems.Scalable algorithms enable the application scientist to both pose and answer new questions. For example, if a given simulation (with a particular resolution) takes several days to run, and a refined (i.e., more accurate) model would take much longer, the application scientist may forgo the larger, higher fidelity simulation. He or she also may be forced to narrow the scope of a parameter study because each run takes too long. By decreasing the execution time, a scalable algorithm allows the scientist to do more simulations at higher resolutions.What's New in 2.0.0 Stable Release:· Fixes and updates to documentation to bring it up to date.· Minor cleanups.What's New in 2.2.0 Beta Development Release:· The FEI block preconditioner was renovated.· The CGC and CGC-E coarsening algorithms were added.· Several new solver types were added to AMS and the AMS/FEI integration was improved.· Handling of the relative change test in GMRES was improved.· The weights for Struct and SStruct weighted Jacobi were improved.· A "make check" target that does a simple code verification test was added.· Truncation for interpolation according to the number of elements was added to the ParCSR Hybrid AMG Solver.· The hypre fei implementation was renovated for use in ARES.

Hypre Related Software