Hi Rajat,
Thanks for posting how you solved your problem! I'm glad to know that you
found the issue, and this will be helpful to know. Perhaps we can
mention/reinforce it in the documentation.
Regards,
J-P
On Sunday, July 3, 2016 at 9:22:06 PM UTC+2, RAJAT ARORA wrote:
>
> Hello,
>
> This is b
Thank you very much indeed!!
2016년 7월 6일 수요일 오후 3시 57분 51초 UTC+9, Praveen C 님의 말:
>
> Hi
>
> In value_list function, you can get (x,y) like this
>
> double x = points[i][0];
> double y = points[i][1];
>
> Best
> praveen
>
> On Wed, Jul 6, 2016 at 12:13 P
Dear all,
I have got a question about the time it takes to copy a
*BlockDynamicSparsityPattern
*into a* BlockSparsityPattern* using the *copy_from()*-function.
In my special case I have a vector-valued 3D problem with trilinear finite
elements. The system matrix is 3x3 block matrix with non-zer
Dear Dustin,
With regard to a lot of tutorial programms I would say that this is
the usual way to work with /DynamicSparsityPatterns/, isn't it?
Yes, the description you give is exactly the way I would choose for the
sparsity pattern.
So back to the question. Running the program the copy oper
Dear All,
I want to define a new geometry (a quarter of a circle) and apply symmetry
boundary condition on two sides of the quarter. It would be very kind of
you if you help me for that.
Best,
Benhour
--
The deal.II project is located at http://www.dealii.org/
For mailing list/forum options, s
