-
- Downloads
Increased speed when building the matrix hierarchy by a factor 1.4.
- Moved expensive distance function to end candidate selection algorithm. - Now using the matrix initializer without number of nonzeros saving on pass over all aggregates for calculating them. - When setting up the sparsity pattern there is now need to use a set to prevent adding a column several times to a row as the CreateIterator of BCRS Matrix uses a set itself. Saved it. [[Imported from SVN: r386]]
Showing
- istl/paamg/aggregates.hh 97 additions, 37 deletionsistl/paamg/aggregates.hh
- istl/paamg/dependency.hh 3 additions, 0 deletionsistl/paamg/dependency.hh
- istl/paamg/galerkin.hh 34 additions, 86 deletionsistl/paamg/galerkin.hh
- istl/paamg/graph.hh 7 additions, 0 deletionsistl/paamg/graph.hh
- istl/paamg/hierarchy.hh 21 additions, 1 deletionistl/paamg/hierarchy.hh
- istl/paamg/test/amgtest.cc 39 additions, 21 deletionsistl/paamg/test/amgtest.cc
- istl/paamg/test/anisotropic.hh 1 addition, 1 deletionistl/paamg/test/anisotropic.hh
- istl/paamg/test/galerkintest.cc 3 additions, 2 deletionsistl/paamg/test/galerkintest.cc
Loading
Please register or sign in to comment