- Jun 21, 2017
-
-
Tom Fischer authored
-
- Jun 13, 2017
-
-
wenqing authored
-
- Jun 12, 2017
-
-
wenqing authored
-
- Jun 09, 2017
- Jun 07, 2017
- Jun 01, 2017
-
-
Dmitri Naumov authored
See clang-tidy docu https://clang.llvm.org/extra/clang-tidy/checks/readability-simplify-boolean-expr.html
-
- May 30, 2017
-
-
Dmitri Naumov authored
-
- May 22, 2017
-
-
Dmitri Naumov authored
-
- May 15, 2017
-
-
Lars Bilke authored
-
- May 08, 2017
-
-
- May 02, 2017
-
-
Dmitri Naumov authored
-
Dmitri Naumov authored
This potentially saves a second copy compared to using const reference. See Effective Modern C++, Item 41.
-
Dmitri Naumov authored
Especially on iterator types and 'new' allocations.
-
Dmitri Naumov authored
-
- Apr 24, 2017
-
-
Lars Bilke authored
Disabled PCH on Visual Studio 2015.
-
- Apr 21, 2017
-
-
Lars Bilke authored
Set C++ standard the right way.
-
- Apr 18, 2017
-
-
Dmitri Naumov authored
Remove includes in some cases or replacing with fwd-decl., fix their order and use full paths.
-
- Apr 03, 2017
-
-
Yonghui56 authored
-
- Feb 10, 2017
-
-
Under certain circumstances the sparsity pattern will be destroyed and adding/setting values would then result in an expensive reallocation. Assume that in the first global iteration only one half of the values is set to non-zero. Before the linear solver is called the sparse matrix is compressed thus reducing the allocated space in each row. In the subsequent iterations, which might add or set the other half of the matrix values reallocations would be necessary.
-
- Jan 10, 2017
-
-
Dmitri Naumov authored
-
- Jan 09, 2017
-
-
Dmitri Naumov authored
-
- Jan 04, 2017
-
-
Tom Fischer authored
-
Tom Fischer authored
-
Tom Fischer authored
The time for the linear solver is written already in NonLinearSolver::solver().
-
- Nov 25, 2016
- Nov 24, 2016
-
-
Dmitri Naumov authored
-