Skip to content

GitLab

Commit 24f3aaa1 authored by Kirill Terekhov's avatar Kirill Terekhov
Browse files

Fixes 

Replaced russian comments in doxygen.
Examples with OpenGL would not lead to error in cmake if no library is
found.
parent 2624e8d8
Hide whitespace changes
Inline Side-by-side
CMakeLists.txt
View file @ 24f3aaa1
......@@ -64,9 +64,9 @@ option(USE_PARTITIONER_PARMETIS "Use ParMetis partitioner" OFF)
option(USE_PARTITIONER_ZOLTAN "Use Zoltan partitioner" OFF)
option(USE_SOLVER_PETSC "Use PETSc solvers" OFF)
option(USE_SOLVER_TRILINOS "Use Trilinos solvers" OFF)
option(USE_AUTODIFF_OPENCL "Use OpenCL for automatic differentiation (under work)" OFF)
option(USE_AUTODIFF_ASMJIT "Use AsmJit for automatic differentiation" OFF)
option(USE_AUTODIFF_EXPRESSION_TEMPLATES "Use c++ expression templates for automatic differentiation" OFF)
#option(USE_AUTODIFF_OPENCL "Use OpenCL for automatic differentiation (under work)" OFF)
#option(USE_AUTODIFF_ASMJIT "Use AsmJit for automatic differentiation" OFF)
#option(USE_AUTODIFF_EXPRESSION_TEMPLATES "Use c++ expression templates for automatic differentiation" OFF)
set(CMAKE_MODULE_PATH ${CMAKE_MODULE_PATH} "${CMAKE_SOURCE_DIR}/cmake_find/")
......
LICENSE
View file @ 24f3aaa1
Copyright (c) 2014, INM-RAS
Copyright (c) 2014-2015, INMOST-DEV
All rights reserved.
Redistribution and use in source and binary forms, with or without
......@@ -24,4 +24,4 @@ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
\ No newline at end of file
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
examples/DrawGrid/CMakeLists.txt
View file @ 24f3aaa1
......@@ -13,11 +13,12 @@ if(OPENGL_FOUND)
add_executable(DrawGrid ${SOURCE})
target_link_libraries(DrawGrid inmost ${OPENGL_LIBRARIES} ${GLUT_LIBRARIES})
if(USE_MPI)
target_link_libraries(DrawGrid ${MPI_LIBRARIES})
if(MPI_LINK_FLAGS)
set_target_properties(DrawGrid PROPERTIES LINK_FLAGS "${MPI_LINK_FLAGS}")
endif()
target_link_libraries(DrawGrid ${MPI_LIBRARIES})
if(MPI_LINK_FLAGS)
set_target_properties(DrawGrid PROPERTIES LINK_FLAGS "${MPI_LINK_FLAGS}")
endif()
endif(USE_MPI)
install(TARGETS DrawGrid EXPORT inmost-targets RUNTIME DESTINATION bin)
else(GLUT_FOUND)
message("GLUT not found")
endif(GLUT_FOUND)
......@@ -25,4 +26,3 @@ else(OPENGL_FOUND)
message("OpenGL not found")
endif(OPENGL_FOUND)
install(TARGETS DrawGrid EXPORT inmost-targets RUNTIME DESTINATION bin)
\ No newline at end of file
examples/DrawMatrix/CMakeLists.txt
View file @ 24f3aaa1
......@@ -31,12 +31,10 @@ if(OPENGL_FOUND)
target_link_libraries(DrawMatrix ${Trilinos_LIBRARIES} ${Trilinos_TPL_LIBRARIES})
endif()
endif()
install(TARGETS DrawMatrix EXPORT inmost-targets RUNTIME DESTINATION bin)
else(GLUT_FOUND)
message("GLUT not found, not building DrawMatrix")
endif(GLUT_FOUND)
else(OPENGL_FOUND)
message("OpenGL not found, not building DrawMatrix")
endif(OPENGL_FOUND)
install(TARGETS DrawMatrix EXPORT inmost-targets RUNTIME DESTINATION bin)
\ No newline at end of file
examples/MatSolve/main.cpp
View file @ 24f3aaa1
......@@ -23,12 +23,12 @@ int main(int argc, char ** argv)
{
case 0: type = Solver::INNER_ILU2; break;
case 1: type = Solver::INNER_MLILUC; break;
case 2: type = Solver::ANI; break;
case 3: type = Solver::PETSc; break;
case 4: type = Solver::Trilinos_Aztec; break;
case 5: type = Solver::Trilinos_Belos; break;
case 6: type = Solver::Trilinos_Ifpack; break;
case 7: type = Solver::Trilinos_ML; break;
case 2: type = Solver::PETSc; break;
case 3: type = Solver::Trilinos_Aztec; break;
case 4: type = Solver::Trilinos_Belos; break;
case 5: type = Solver::Trilinos_Ifpack; break;
case 6: type = Solver::Trilinos_ML; break;
case 7: type = Solver::ANI; break;
}
Solver::Initialize(&argc,&argv,argc > 4 ? argv[4] : NULL); // Initialize the linear solver in accordance with args
{
......@@ -67,9 +67,21 @@ int main(int argc, char ** argv)
bool success = false;
int iters;
double resid, realresid = 0;
std::string reason;
{
Solver s(type); // Declare the linear solver by specified type
s.SetParameterEnum("gmres_substeps",3);
s.SetParameterEnum("reorder_nonzeros",0);
s.SetParameterEnum("rescale_iterations",8);
s.SetParameterEnum("adapt_ddpq_tolerance",0);
s.SetParameterReal("drop_tolerance",0.001);
s.SetParameterReal("reuse_tolerance",0.00001);
s.SetParameterReal("ddpq_tolerance",0.7);
t = Timer();
s.SetMatrix(mat); // Compute the preconditioner for the original matrix
BARRIER
......@@ -80,6 +92,7 @@ int main(int argc, char ** argv)
if( !rank ) std::cout << "solver: " << Timer() - t << std::endl;
iters = s.Iterations(); // Get the number of iterations performed
resid = s.Residual(); // Get the final residual achieved
reason = s.GetReason();
//x.Save("output.rhs");
}
tt = Timer() - tt;
......@@ -130,6 +143,7 @@ int main(int argc, char ** argv)
if( argc > 3 ) std::cout << " vector \"" << argv[3] << "\"";
std::cout << " true residual ||Ax-b||/||b|| " << realresid;
std::cout << std::endl;
std::cout << "reason: " << reason << std::endl;
}
}
}
......@@ -137,3 +151,4 @@ int main(int argc, char ** argv)
Solver::Finalize(); // Finalize solver and close MPI activity
return 0;
}
examples/OldDrawGrid/CMakeLists.txt
View file @ 24f3aaa1
......@@ -19,12 +19,10 @@ if(OPENGL_FOUND)
set_target_properties(OldDrawGrid PROPERTIES LINK_FLAGS "${MPI_LINK_FLAGS}")
endif()
endif(USE_MPI)
install(TARGETS OldDrawGrid EXPORT inmost-targets RUNTIME DESTINATION bin)
else(GLUT_FOUND)
message("GLUT not found, not building OldDrawGrid")
endif(GLUT_FOUND)
else(OPENGL_FOUND)
message("OpenGL not found, not building OldDrawGrid")
endif(OPENGL_FOUND)
install(TARGETS OldDrawGrid EXPORT inmost-targets RUNTIME DESTINATION bin)
\ No newline at end of file
inmost_autodiff.h
View file @ 24f3aaa1
......@@ -605,7 +605,7 @@ namespace INMOST
__INLINE expr ad_sqrt(const expr & v) {return expr(AD_SQRT, v);}
__INLINE expr ad_val(const expr & v, const expr & multiplyer = expr(0.0)) {return expr(v, multiplyer);}
__INLINE expr measure() { return expr(AD_MES,ENUMUNDEF); }
__INLINE expr condition(const expr & cond, const expr & if_gt, const expr & if_le) { return expr(cond, if_gt, if_le); }
__INLINE expr condition(const expr & cond, const expr & if_gt_zero, const expr & if_le_zero) { return expr(cond, if_gt_zero, if_le_zero); }
__INLINE expr condition_etype(ElementType etypes, const expr & if_true, const expr & if_false) { return expr(expr(AD_COND_TYPE, etypes), if_true, if_false); }
__INLINE expr condition_marker(MarkerType marker, const expr & if_true, const expr & if_false) { return expr(expr(AD_COND_MARK, marker), if_true, if_false); }
__INLINE expr stencil(INMOST_DATA_ENUM_TYPE stncl, const expr & v) { assert(stncl >= AD_STNCL && stncl < AD_TABLE); return expr(stncl, &v); }
......@@ -694,7 +694,7 @@ namespace INMOST
__INLINE expr measure() { return expr(AD_MES, NULL, NULL); }
__INLINE expr condition_etype(ElementType etype, const expr & if_true, const expr & if_false) { return expr(AD_COND, new expr(AD_COND_TYPE,etype), new expr(AD_ALTR, new expr(if_true), new expr(if_false))); }
__INLINE expr condition_marker(MarkerType marker, const expr & if_true, const expr & if_false) { return expr(AD_COND, new expr(AD_COND_MARK,marker), new expr(AD_ALTR, new expr(if_true), new expr(if_false))); }
__INLINE expr condition(const expr & cond, const expr & if_true, const expr & if_false) { return expr(AD_COND, new expr(cond), new expr(AD_ALTR, new expr(if_true), new expr(if_false))); }
__INLINE expr condition(const expr & cond, const expr & if_gt_zero, const expr & if_le_zero) { return expr(AD_COND, new expr(cond), new expr(AD_ALTR, new expr(if_gt_zero), new expr(if_le_zero))); }
__INLINE expr stencil(INMOST_DATA_ENUM_TYPE stncl, const expr & v) { assert(stncl >= AD_STNCL && stncl < AD_TABLE); return expr(stncl, new expr(v), NULL); }
__INLINE expr tabval(INMOST_DATA_ENUM_TYPE tabl, const expr & v) { assert(tabl >= AD_TABLE && tabl < AD_FUNC); return expr(tabl, new expr(v), NULL); }
__INLINE expr tagval(INMOST_DATA_ENUM_TYPE reg_tag, INMOST_DATA_ENUM_TYPE comp = 0) { assert(reg_tag >= AD_TAG && reg_tag < AD_STNCL); return expr(reg_tag, comp); }
......
inmost_mesh.h
View file @ 24f3aaa1
......@@ -633,8 +633,8 @@ namespace INMOST
virtual ~Element() {}
public:
/// Retrive number of adjacent elements.
/// As etype you can either pass one type as CELL,
/// or several types as bitwise mask: NODE | CELL
/// For etype you can either pass one type as CELL,
/// or several types as bitwise mask: NODE | CELL.
/// @param etype bitwise mask of element types
/// @return number of adjacent elements.
virtual enumerator nbAdjElements (ElementType etype) const;
......@@ -664,31 +664,42 @@ namespace INMOST
ElementArray<Edge> BridgeAdjacencies2Edge (ElementType Bridge, MarkerType mask = 0, bool invert_mask = false) const;
ElementArray<Face> BridgeAdjacencies2Face (ElementType Bridge, MarkerType mask = 0, bool invert_mask = false) const;
ElementArray<Cell> BridgeAdjacencies2Cell (ElementType Bridge, MarkerType mask = 0, bool invert_mask = false) const;
/// Получить все узлы данного элемента,
/// Для узла вернет сам узел
/// Для ребра вернет упорядоченную пару вершин
/// Для грани вернет упорядоченный массив вершин
/// Для ячейки известного типа вернет упорядоченный массив вершин
/// Retrive all the nodes of the element.
/// For a node returns itself.
/// For an edge returns ordered pair of nodes. The order of nodes in the edge is preserved from the first creation.
/// For a face returns ordered set of nodes. In the case Face::CheckNormalOrientation returns true the
/// order of nodes will follow right hand side rule with respect to normal vector, otherwise it follows
/// left hand side rule with respect to normal vector.
/// For a cell returns the same order that was provided through suggest_nodes_oreder in Mesh::CreateCell.
/// In the case suggest_nodes_order was not provided, the order of nodes follows VTK format for known types
/// of elements such as Element::Tet, Element::Prism, Element::Hex, Element::Pyramid. For a general polyhedron
/// the order is unspecified.
/// @return array of elements
/// @see Face::CheckNormalOrientation
/// @see Face::FaceOrientedOutside
virtual ElementArray<Node> getNodes () const; //unordered
/// Получить все ребра данного элемента
/// Для узла вернет неупорядоченный массив ребер
/// Для ребра вернет само ребро
/// Для грани вернет упорядоченный массив ребер
/// Для ячейки вернет неупорядоченный массив ребер
/// Retrive all the edges of the element.
/// For a node returns unordered set of edges.
/// For an edge returns itself.
/// For a face returns ordered set of edges.
/// For a cell returns unordered set of edges.
/// @return array of elements
virtual ElementArray<Edge> getEdges () const; //unordered
/// Получить все грани данного элемента
/// Для узла вернет неупорядоченный массив граней
/// Для ребра вернет неупорядоченный массив граней
/// Для грани вернет саму грань
/// Для ячейки вернет массив граней в том порядке, в котором она была создана
/// Retrive all the faces of the element.
/// For a node returns unordered set of faces.
/// For an edge returns unordered set of faces.
/// For a face returns itself.
/// For a cell return ordered set of faces. The order of faces in the cell is preserved from the first creation.
/// @return array of elements
virtual ElementArray<Face> getFaces () const; //unordered
/// Получить все ячейки данного элемента
/// Для узла вернет неупорядоченный массив ячеек
/// Для ребра вернет неупорядоченный массив ячеек
/// Для грани вернет массив из двух ячеек, причем
/// нормаль к грани направлена из первой ячейки во вторую,
/// если порядок ребер грани задан по правому буравчику
/// Для ячейки вернет саму ячейку
/// Return all the cells of the element.
/// For a node returns unordered set of cells.
/// For an edge returns unordered set of cells.
/// For a face returns a pair of cells. In the case Face::CheckNormalOrientation returns true
/// then the normal points from the first cell to the second and in oppisite direction otherwise.
/// For a cell returns itself.
/// @return array of elements
/// @see Face::FaceOrientedOutside
virtual ElementArray<Cell> getCells () const; //unordered
virtual ElementArray<Node> getNodes (MarkerType mask,bool invert_mask = false) const; //unordered
virtual ElementArray<Edge> getEdges (MarkerType mask,bool invert_mask = false) const; //unordered
......@@ -722,16 +733,16 @@ namespace INMOST
bool Hidden () const;
bool New () const;
void Disconnect (bool delete_upper_adjacent) const; //disconnect all elements, delete upper dependent
/// Disconnects nodes from this edge, edges from this face, faces from this cell, cannot disconnect cells from this node;
/// Disconnects edges from this node, faces from this edge, cells from this face, cannot disconnect nodes from this cell;
/// Disconnects nodes from this edge, edges from this face, faces from this cell, cannot disconnect cells from this node; \n
/// Disconnects edges from this node, faces from this edge, cells from this face, cannot disconnect nodes from this cell; \n
/// Updates geometric data and cell nodes automatically.
void Disconnect (const HandleType * adjacent, INMOST_DATA_ENUM_TYPE num) const;
/// Connects lower adjacencies to current element,
/// geometric data and cell nodes are updated automatically.
/// geometric data and cell nodes are updated automatically. \n
/// TODO:
/// 1. asserts in this function should be replaced by Topography checks;
/// 2. this function should be used for creation of elements instead of current implementation.
/// 3. should correctly account for order of edges (may be implemented through CheckEdgeOrder, FixEdgeOrder)
/// 1. asserts in this function should be replaced by Topography checks; \n
/// 2. this function should be used for creation of elements instead of current implementation. \n
/// 3. should correctly account for order of edges (may be implemented through CheckEdgeOrder, FixEdgeOrder)
void Connect (const HandleType * adjacent, INMOST_DATA_ENUM_TYPE num) const;
/// Update geometric data for element, calls RecomputeGeometricData from Mesh.
void UpdateGeometricData () const;
......@@ -825,11 +836,17 @@ namespace INMOST
//this is for 2d case when the face is represented by segment
Node getBeg () const;
Node getEnd () const;
/// Получить ячейку за нормалью к грани
/// направление нормали зависит от последовательности создания сетки
/// Retrive the cell for which the normal points outwards.
/// Depending on the grid construction the normal may incorrectly point inwards.
/// You can resolve this situation by Face::FixNormalOrientation.
/// @return the cell for which normal points outwards.
/// @see Face::FixNormalOrientation
Cell BackCell () const;
/// Получить ячейку перед нормалью к грани
/// направление нормали зависит от последовательности создания сетки
/// Retrive the cell for which the normal points inwards.
/// Depending on the grid construction the normal may incorrectly point outwards.
/// You can resolve this situation by Face::FixNormalOrientation.
/// @return the cell for which normal points inwards.
/// @see Face::FixNormalOrientation
Cell FrontCell () const;
bool FaceOrientedOutside (Cell c) const;
void ReorderEdges () const;
......@@ -903,12 +920,12 @@ namespace INMOST
class ElementSet : public Element //implemented in eset.cpp
{
public:
static const enumerator high_conn_reserved = 4; ///< number of reserved positions in HighConn array
///< first position is handle to parent set
///< second position is handle to sibling set
///< third position is handle to child set
///< fourth position is number of sorted elements in the set
///< all the rest are positions of deleted elements
static const enumerator high_conn_reserved = 4; ///< number of reserved positions in HighConn array.
///< The first position is the handle to parent set.
///< The second position is handle to sibling set.
///< The third position is handle to child set.
///< The fourth position is number of sorted elements in the set.
///< All the rest are positions of deleted elements.
typedef INMOST_DATA_BULK_TYPE ComparatorType;
static const ComparatorType UNSORTED_COMPARATOR = 0;
static const ComparatorType GLOBALID_COMPARATOR = 1;
......@@ -957,7 +974,7 @@ namespace INMOST
/// Direct raw access to stored elements, no copy involved.
/// The actual pointer may change when you add new elements due to reallocation of memory.
/// Modify at your own risk
/// Modify at your own risk.
HandleType * getHandles() const;
/// Retrive number of stored handles, including invalid
/// if you want to get number of valid elements use ElementSet::Size
......@@ -1021,48 +1038,48 @@ namespace INMOST
template<typename EType>
void RemoveElements(const ElementArray<EType> & elems) const {RemoveElements(elems.data(),static_cast<enumerator>(elems.size()));}
/// Compute and return union with other set
/// Compute and return union with other set.
/// Result is unordered.
/// all elements will be unique
/// All elements will be unique.
ElementArray<Element> Union(const ElementSet & other) const;
/// Compute and return union with raw handles,
/// Compute and return union with raw handles.
/// Result is unordered.
/// all elements will be unique
/// All elements will be unique.
ElementArray<Element> Union(const HandleType * handles, enumerator num) const;
/// Compute and return union with elements
template<typename EType>
ElementArray<Element> Union(const ElementArray<EType> & elems) const {return Union(elems.data(),static_cast<enumerator>(elems.size()));}
ElementArray<Element> Difference(const ElementSet & other) const;
/// Compute and return difference with raw handles
/// If initial set was order, result will preserve the order.
/// all elements will be unique
/// Compute and return difference with raw handles.
/// If initial set was ordered, result will preserve the order.
/// All elements will be unique.
ElementArray<Element> Difference(const HandleType * handles, enumerator num) const;
/// Compute and return difference with elements
template<typename EType>
ElementArray<Element> Difference(const ElementArray<EType> & elems) const {return Difference(elems.data(),static_cast<enumerator>(elems.size()));}
ElementArray<Element> Intersection(const ElementSet & other) const;
/// Compute and return intersection with raw handles
/// If initial set was order, result will preserve the order.
/// all elements will be unique
/// Compute and return intersection with raw handles.
/// If initial set was ordered, result will preserve the order.
/// All elements will be unique.
ElementArray<Element> Intersection(const HandleType * handles, enumerator num) const;
/// Compute and return intersection with elements
/// Compute and return intersection with elements.
template<typename EType>
ElementArray<Element> Intersection(const ElementArray<EType> & elems) const {return Intersection(elems.data(),static_cast<enumerator>(elems.size()));}
/// Compute and store union with raw handles
/// Compute and store union with raw handles.
void Unite(const ElementSet & other) const;
/// Compute and store union with raw handles
/// Compute and store union with raw handles.
void Unite(const HandleType * handles, enumerator num) const;
/// Compute and store union with elements
/// Compute and store union with elements.
template<typename EType>
void Unite(const ElementArray<EType> & elems) const {Unite(elems.data(),static_cast<enumerator>(elems.size()));}
/// TODO
/// if other and current sets are sorted in same way, may perform narrowing traversal by retriving
/// If other and current sets are sorted in same way, may perform narrowing traversal by retriving
/// mutual lower_bound/higher_bound O(log(n)) operations for detecting common subsets in sorted sets.
/// may work good when deleting handles by small chunks, ApplyModification may greatly benefit
/// May work good when deleting handles by small chunks, ApplyModification may greatly benefit.
void Subtract(const ElementSet & other) const;
/// Compute and store difference with raw handles
void Subtract(const HandleType * handles, enumerator num) const;
......
solver_bcgsl.hpp
View file @ 24f3aaa1
......@@ -167,7 +167,7 @@ namespace INMOST
info->GetVectorRegion(vbeg,vend);
//rhs_norm = info->ScalarProd(RHS,RHS,vlocbeg,vlocend);
rhs_norm = 1;
rhs_norm = 1;
//r[0] = b
std::copy(RHS.Begin(),RHS.End(),r[0].Begin());
{
......@@ -202,7 +202,7 @@ namespace INMOST
goto exit;
}
long double tt, ts, tp, ttt;
long double tt, ts, tp;
while( true )
{
ts = tp = 0;
......
solver_ddpqiluc2.hpp
View file @ 24f3aaa1
......@@ -309,7 +309,7 @@ public:
INMOST_DATA_ENUM_TYPE k, i, j, Li, Ui, curr, next, mi, mj;
INMOST_DATA_REAL_TYPE l,u,udiag, max_diag, min_diag, mean_diag, tol_schur;
INMOST_DATA_ENUM_TYPE nzA, nzLU = 0, nzEF = 0, nzL, nzS;
INMOST_DATA_ENUM_TYPE nzA, nzLU = 0, nzEF = 0, nzS;
Solver::Vector DL, DR;
info->GetOverlapRegion(info->GetRank(), mobeg, moend);
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment