Zoltan2
Zoltan2_AlgSpectral.hpp
Go to the documentation of this file.
1 // @HEADER
2 //
3 // ***********************************************************************
4 //
5 // Zoltan2: A package of combinatorial algorithms for scientific computing
6 // Copyright 2012 Sandia Corporation
7 //
8 // Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
9 // the U.S. Government retains certain rights in this software.
10 //
11 // Redistribution and use in source and binary forms, with or without
12 // modification, are permitted provided that the following conditions are
13 // met:
14 //
15 // 1. Redistributions of source code must retain the above copyright
16 // notice, this list of conditions and the following disclaimer.
17 //
18 // 2. Redistributions in binary form must reproduce the above copyright
19 // notice, this list of conditions and the following disclaimer in the
20 // documentation and/or other materials provided with the distribution.
21 //
22 // 3. Neither the name of the Corporation nor the names of the
23 // contributors may be used to endorse or promote products derived from
24 // this software without specific prior written permission.
25 //
26 // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
27 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
29 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
30 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
31 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
32 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
33 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
34 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
35 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
36 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
37 //
38 // Questions? Contact Karen Devine (kddevin@sandia.gov)
39 // Erik Boman (egboman@sandia.gov)
40 // Siva Rajamanickam (srajama@sandia.gov)
41 //
42 // ***********************************************************************
43 //
44 // @HEADER
45 #ifndef _ZOLTAN2_ALGSPECTRAL_HPP_
46 #define _ZOLTAN2_ALGSPECTRAL_HPP_
47 
48 #include <Zoltan2_Algorithm.hpp>
49 #include <Zoltan2_GraphModel.hpp>
51 
52 
57 
58 
59 namespace Zoltan2{
60 
61 template <typename Adapter>
63  const RCP<GraphModel<Adapter> > &model,
64  //const RCP<Adapter> &matrixadapter, // Hack: Use matrix adapter directly
65  const RCP<OrderingSolution<typename Adapter::lno_t,
66  typename Adapter::gno_t> > &solution,
67  const RCP<Teuchos::ParameterList> &pl,
68  const RCP<const Teuchos::Comm<int> > &comm
69 )
70 {
71 #ifndef INCLUDE_ZOLTAN2_EXPERIMENTAL
72 
73  Z2_THROW_EXPERIMENTAL("Zoltan2 Spectral ordering is strictly "
74  "experimental software "
75  "while it is being developed and tested.")
76 
77 #else //INCLUDE_ZOLTAN2_EXPERIMENTAL
78 
79  typedef typename Adapter::lno_t lno_t;
80  typedef typename Adapter::gno_t gno_t;
81  typedef typename Adapter::scalar_t scalar_t;
82 
83  int ierr= 0;
84 
85  HELLO;
86 
87 // TODO: Check params to do local or global ordering.
88  bool localOrder = true;
89 
90  const size_t nVtx = model->getLocalNumVertices();
91  lno_t *perm;
92  perm = (lno_t *) (solution->getPermutationRCP().getRawPtr());
93  for (lno_t i=0; i<nVtx; i++){
94  perm[i] = -1;
95  }
96 
97  // Get local graph.
98  ArrayView<const gno_t> edgeIds;
99  ArrayView<const lno_t> offsets;
100  ArrayView<StridedData<lno_t, scalar_t> > wgts;
101 
102  model->getEdgeList(edgeIds, offsets, wgts);
103 
104  //cout << "Debug: Local graph from getLocalEdgeList" << endl;
105  //cout << "edgeIds: " << edgeIds << endl;
106  //cout << "offsets: " << offsets << endl;
107 
108  // Form the graph Laplacian: L = D-A
109  // Create a new Tpetra matrix, but use views of existing data when possible.
110  // TODO
111 
112  // TODO: Find smallest eigenvalues using Anasazi
113 
114  // TODO: Sort Fiedler vector.
115 
116  solution->setHavePerm(true);
117  return ierr;
118 #endif // INCLUDE_ZOLTAN2_EXPERIMENTAL
119 }
120 
121 }
122 #endif
#define HELLO
Defines the OrderingSolution class.
#define Z2_THROW_EXPERIMENTAL(mystr)
Throw an error when experimental code is requested but not compiled.
GraphModel defines the interface required for graph models.
int AlgSpectral(const RCP< GraphModel< Adapter > > &model, const RCP< OrderingSolution< typename Adapter::lno_t, typename Adapter::gno_t > > &solution, const RCP< Teuchos::ParameterList > &pl, const RCP< const Teuchos::Comm< int > > &comm)
Defines the GraphModel interface.
The class containing ordering solutions.