Thanks a lot!
2016-03-03 5:37 GMT+01:00 Roland Haas :
> Hello Alfred,
>
> > I am using the TwoPunctures thorn for solving the constraints. In
> > order to speed up tests of grid structures, I would like to just solve
> > on the spectral grid once, store the data in a file, and reread them
> > for
Hello Alfred,
> I am using the TwoPunctures thorn for solving the constraints. In
> order to speed up tests of grid structures, I would like to just solve
> on the spectral grid once, store the data in a file, and reread them
> for different evolutions (e.g. with different finite difference
> grid
On 2 Mar 2016, at 16:46, Erik Schnetter wrote:
> Sascha
>
> Yes, a similar method (interpolation instead of evaluation, possibly
> after adding more spectral coefficients) was implemented by Marcus
> Ansorg in the TwoPunctures thorn as well.
To emphasise for others who might not realise: this
On 2 Mar 2016, at 18:19, Geraint Pratten wrote:
> Hi,
>
> So I've tried to change a few things to see if there was an obvious solution
> and there does not seem to be any improvement at all. I've added a
> Carpet::poison_value of 100 to the .par file. I have also tried using various
> differ
Hi,
So I've tried to change a few things to see if there was an obvious
solution and there does not seem to be any improvement at all. I've added a
Carpet::poison_value of 100 to the .par file. I have also tried using
various different grid structures (including the
​example
structure used in the
On Wed, Mar 2, 2016 at 4:23 PM, Erik Schnetter wrote:
> Alfred
>
> Solving the equations is fast, the slow part is evaluating the
> solution on the finite differencing grid. If you want to use the same
> grid multiple times you can checkpoint the initial conditions. If you
> want to use different
Sascha
Yes, a similar method (interpolation instead of evaluation, possibly
after adding more spectral coefficients) was implemented by Marcus
Ansorg in the TwoPunctures thorn as well.
-erik
On Wed, Mar 2, 2016 at 10:42 AM, Sascha Husa wrote:
> On Wed, Mar 2, 2016 at 4:23 PM, Erik Schnetter wr
Hello all,
> Solving the equations is fast, the slow part is evaluating the
> solution on the finite differencing grid. If you want to use the same
> grid multiple times you can checkpoint the initial conditions. If you
> want to use different grids, then you'll have to repeat the slow part
> anyw
On Wed, Mar 02, 2016 at 10:23:57AM -0500, Erik Schnetter wrote:
> Solving the equations is fast, the slow part is evaluating the
> solution on the finite differencing grid.
That is true, most of the time. In some cases it is the other way
around, like in the mentioned NS cases. There, solving take
Alfred
Solving the equations is fast, the slow part is evaluating the
solution on the finite differencing grid. If you want to use the same
grid multiple times you can checkpoint the initial conditions. If you
want to use different grids, then you'll have to repeat the slow part
anyway.
There are
Hello Alfred,
> I am a master student at UIB, and starting to use the Einstein Toolkit
> for binary black hole evolutions.
>
> I am using the TwoPunctures thorn for solving the constraints. In
> order to speed up tests of grid structures, I would like to just solve
> on the spectral grid once, st
Hi,
I am a master student at UIB, and starting to use the Einstein Toolkit
for binary black hole evolutions.
I am using the TwoPunctures thorn for solving the constraints. In
order to speed up tests of grid structures, I would like to just solve
on the spectral grid once, store the data in a file
12 matches
Mail list logo
