- May 11, 2018
-
-
Sander, Oliver authored
In theory this is dangerous, because a pure Newton method will only converge locally. However, the trust-region part had been partially disabled anyway, and I have not noticed any problems. Also, I think that from my well-posedness result for higher-order GeoFEs follows that a Newton method will always converge if the problem is well-posed (that is how the proof works, after all). On the plus side, this patch brings roughly 5% speed increas.
-
- Dec 12, 2013
-
-
Oliver Sander authored
Assuming that the AverageDistanceAssembler can provide it. This is for the Gram-Schmidt solver only. The old Gauss-Seidel code will still use a full matrix. [[Imported from SVN: r9585]]
-
Oliver Sander authored
CG seems to converge to quickly. If too few iterations are performed, then ADOL-C has trouble determining the correct second derivatives. Since the Gram-Schmidt solver is a direct solver, OTOH, the derivatives should be perfect. It is also faster than the Gauss-Seidel solver I was previously using. [[Imported from SVN: r9581]]
-
- Dec 10, 2013
-
-
Oliver Sander authored
I hoped that this would be faster. However, it seems to deterioate the convergence of the outer trust region algorithm. Apparently, the steps taken by a CG make it difficult for ADOL-C to compute the correct derivatives. [[Imported from SVN: r9576]]
-
- Sep 06, 2013
-
-
Oliver Sander authored
[[Imported from SVN: r9476]]
-
- Sep 03, 2013
-
-
Oliver Sander authored
[[Imported from SVN: r9450]]
-
- Jul 12, 2013
-
-
Oliver Sander authored
[[Imported from SVN: r9304]]
-
Oliver Sander authored
[[Imported from SVN: r9303]]
-
- Sep 22, 2011
-
-
Oliver Sander authored
[[Imported from SVN: r7838]]
-
- Aug 19, 2011
-
-
Oliver Sander authored
[[Imported from SVN: r7611]]
-
- Aug 11, 2011
-
-
Oliver Sander authored
[[Imported from SVN: r7576]]
-
- Jul 11, 2011
-
-
Oliver Sander authored
and barycentric coordinates. This is easy because we know the number of element corners at compile time (I currently don't see support for non-simplex elements at all). This saves time, but not much: about 1%. [[Imported from SVN: r7550]]
-
Oliver Sander authored
[[Imported from SVN: r7549]]
-
- May 01, 2011
-
-
Oliver Sander authored
[[Imported from SVN: r7229]]
-
- Mar 29, 2011
-
-
Oliver Sander authored
... instead of coordinates in the embedding space. The usual problem is that when working in the embedding space, a projection onto the trust-region makes the iterate leave the tangent space. [[Imported from SVN: r7035]]
-
- Jan 05, 2011
-
-
Oliver Sander authored
[[Imported from SVN: r6673]]
-
- Apr 27, 2010
-
-
Oliver Sander authored
For this now the TangentVector class of S^n has only n components, while the EmbeddedTangentVector class still has n+1. The code around it needs to be fixed accordingly. [[Imported from SVN: r5963]]
-
- Apr 22, 2010
-
-
Oliver Sander authored
[[Imported from SVN: r5931]]
-
- Feb 11, 2010
-
-
Oliver Sander authored
[[Imported from SVN: r5548]]
-
- Feb 10, 2010
-
-
Oliver Sander authored
[[Imported from SVN: r5534]]
-
Oliver Sander authored
[[Imported from SVN: r5528]]
-
- Jan 19, 2010
-
-
Oliver Sander authored
[[Imported from SVN: r5347]]
-
- Apr 30, 2009
-
-
Oliver Sander authored
[[Imported from SVN: r4138]]
-