)
sparsity_pattern.block(0,0).add(row_i,col_j); //these kind of operations
for the other blocks too.
sparsity_pattern.compress();
system_matrix.reinit(sparsity_pattern);
On Sat, Dec 15, 2018 at 6:27 PM Wolfgang Bangerth
wrote:
> On 12/15/18 12:48 AM, Mustafa Aggul wrote:
> >
> > As their sp
gt;
> Would it be possible for you to post a more complete code fragment that
> shows the problem? I cannot figure out where the problem is with what you
> posted.
>
> Thanks,
> David Wells
>
> On Friday, December 14, 2018 at 8:41:10 AM UTC-5, Mustafa Aggul wrote:
>>
&
Hello,
I have created my own block sparsity pattern by adding non-zero entries
manually, and then compressed it. Upon some testings on this sparsity
pattern, I have realized that it is indeed created correctly, in terms of
dimension and number of elements it has. However, the system matrix that I
i
Thanks for your response. I did some sort of combination of the both
arguments. It works fine now.
Best,
Mustafa.
--
The deal.II project is located at http://www.dealii.org/
For mailing list/forum options, see
https://groups.google.com/d/forum/dealii?hl=en
---
You received this message because
words,
suppose I assemble a system and solve it. Say my solution is U. In the next
step, I want to solve a different problem for V. My desire is to make V
exactly same as U on the boundaries.
Is there any way I can do this?
Thanks,
--
*Mustafa Aggul*
*Department of Mathematics*
*Michigan
> On Sunday, December 10, 2017 at 4:06:21 PM UTC-5, Mustafa Aggul wrote:
>>
>> Here, run_FS(n_time_steps) is independent from CS, so I can run it a
>> little bit earlier but parallel to run_CS(n_time_steps). I think I can take
>> care of running it earlier part with
Hello,
I have a two-step method to be run in parallel. It gives an approximation
in the first step (FS), and solves for a correction step (CS). I have read
a lot about shared memory parallelization, but I couldn't figure out how to
do it.
The corresponding part in my current code looks as follows
On Sun, Nov 26, 2017 at 7:32 PM, Wolfgang Bangerth
wrote:
> On 11/26/2017 04:51 PM, Mustafa Aggul wrote:
>
>> ExactSolutionGradient exact_solution_gradient;
>> exact_solution_gradient.set_time(tnplus1);
>>
>> VectorT
CMakeFiles/Makefile2:138: recipe for target 'CMakeFiles/run.dir/rule' failed
make[1]: Leaving directory
'/home/mustafa/ddeal.II/dealii_install_location/my_code/ADM_SDC_with_AV'
Makefile:144: recipe for target 'run' failed
make[3]: *** [CMakeFiles/ADM_SDC_with_AV.dir/ADM_SDC_with_AV.cc.o
_errors,
VectorTools::L2_norm);
std::cout << "Errors: ||e_u||_L2 = " << current_velocity_error_h1
<< ", at time = " << tnplus1
<< std::endl;
std::cout << std::endl;
--
*Mustafa Aggul*
*Department of Mathematics*
*Mic
lists how deal.II is
> configured?
>
> Thanks,
> Jean-Paul
>
> On 20 Nov 2017, at 02:12, Mustafa Aggul wrote:
>
> Someone is tinkering with a vacant arena slot
>
>
> --
> The deal.II project is located at http://www.dealii.org/
> For mailing list/forum options, see htt
I have a code for a turbulence model with which I am trying to check the
convergence rate, so I refine mesh several times. It works fine up until
3rd refinement, but in the 4th refinement, it quits at the last time step
giving me the error message "Someone is tinkering with a vacant arena
slot"
element sets
in the same project. Projection on 2 of them looks perfect except this one.
I also attach the corresponding code. You will see the error results
immediately after running.
Thanks,
On Sun, Nov 5, 2017 at 5:55 PM, Wolfgang Bangerth
wrote:
> On 11/04/2017 02:53 PM, Mustafa Aggul wr
Hello All,
I am trying to project the initial conditions on the following FE space:
lsfe(FE_Q(2), dim). It is quite a straightforward job, but the error
and plot of the projected vector (especially upon choosing constant initial
condition to make the error basically 0) doesn't look as it suppos
14 matches
Mail list logo