- Jan 23, 2011
-
-
Oliver Sander authored
SteklovPoincareStep class. That way it can access all its data. I don't know if that is better design-wise, but for the time being it make things simpler. [[Imported from SVN: r6845]]
-
Oliver Sander authored
The entire primal (i.e., Dirichlet-to-Neumann) should now run for arbitrary numbers of rods and continua. [[Imported from SVN: r6844]]
-
Oliver Sander authored
[[Imported from SVN: r6843]]
-
Oliver Sander authored
[[Imported from SVN: r6842]]
-
Oliver Sander authored
[[Imported from SVN: r6841]]
-
Oliver Sander authored
Because that is what happens. The previous solution of returning to FieldVectors, one as the return value and the other one using call-by-reference, was extremely ugly. This is an API change. [[Imported from SVN: r6840]]
-
Oliver Sander authored
[[Imported from SVN: r6838]]
-
Oliver Sander authored
[[Imported from SVN: r6837]]
-
Oliver Sander authored
[[Imported from SVN: r6835]]
-
Oliver Sander authored
Create rod by interpolating between two endpoints, which are expected to be already in the result container [[Imported from SVN: r6834]]
-
Oliver Sander authored
[[Imported from SVN: r6833]]
-
Oliver Sander authored
[[Imported from SVN: r6832]]
-
Oliver Sander authored
[[Imported from SVN: r6831]]
-
Oliver Sander authored
[[Imported from SVN: r6830]]
-
- Jan 22, 2011
-
-
Oliver Sander authored
It can (almost) handle couplings to an arbitrary number of rods now. [[Imported from SVN: r6829]]
-
Oliver Sander authored
[[Imported from SVN: r6828]]
-
Oliver Sander authored
[[Imported from SVN: r6827]]
-
Oliver Sander authored
[[Imported from SVN: r6826]]
-
Oliver Sander authored
... to n continua and 1 rod. [[Imported from SVN: r6825]]
-
Oliver Sander authored
In a first step, the data structures are generalized. All stuff is again kept in std::maps index by strings. This initial patch contains a few map lookups in very undesirable places. This will be fixed in the very near future. [[Imported from SVN: r6824]]
-
Oliver Sander authored
[[Imported from SVN: r6823]]
-
Oliver Sander authored
[[Imported from SVN: r6822]]
-
Oliver Sander authored
[[Imported from SVN: r6821]]
-
Oliver Sander authored
[[Imported from SVN: r6819]]
-
Oliver Sander authored
[[Imported from SVN: r6817]]
-
Oliver Sander authored
[[Imported from SVN: r6816]]
-
- Jan 21, 2011
-
-
Oliver Sander authored
[[Imported from SVN: r6815]]
-
Oliver Sander authored
[[Imported from SVN: r6814]]
-
Oliver Sander authored
[[Imported from SVN: r6810]]
-
Oliver Sander authored
[[Imported from SVN: r6809]]
-
Oliver Sander authored
[[Imported from SVN: r6808]]
-
Oliver Sander authored
[[Imported from SVN: r6807]]
-
- Jan 19, 2011
-
-
Oliver Sander authored
bugfix: use operator[] instead of find() if you want to force creation of a non-existant entry in a std::map [[Imported from SVN: r6802]]
-
Oliver Sander authored
[[Imported from SVN: r6801]]
-
Oliver Sander authored
[[Imported from SVN: r6800]]
-
Oliver Sander authored
[[Imported from SVN: r6799]]
-
Oliver Sander authored
[[Imported from SVN: r6798]]
-
Oliver Sander authored
don't store the continuum interface boundary in the Steklov-Poincare step -- use the one from the complex instead [[Imported from SVN: r6797]]
-
Oliver Sander authored
[[Imported from SVN: r6795]]
-
Oliver Sander authored
[[Imported from SVN: r6794]]
-