On 23 July 2010 12:40, Florian Rathgeber
wrote:
> -BEGIN PGP SIGNED MESSAGE-
> Hash: SHA1
>
> Hi,
>
> Profiling DOLFIN assembly shows that for forms with many coefficients or
> computationally expensive expressions assigned to coefficients, a great
> deal of the whole assembly is spent in
I think you would need a conditional indeed.
> I was not talking about constants, but about expressions that are not
> uniform over the whole domain, should have made that more clear.
>
> Florian
>
> On 23.07.2010 13:51, Kristian Ølgaard wrote:
>> On 23 July 2010 12:40, Flor
On 23 July 2010 13:30, Florian Rathgeber
wrote:
> -BEGIN PGP SIGNED MESSAGE-
> Hash: SHA1
>
> On 23.07.2010 14:22, Kristian Ølgaard wrote:
>> On 23 July 2010 13:02, Florian Rathgeber
>> wrote:
>> I guess I haven't made my point very clear. The demo you
On 2 August 2010 15:45, Florian Rathgeber
wrote:
> -BEGIN PGP SIGNED MESSAGE-
> Hash: SHA1
>
> Hi,
>
> I modified FFC to accept an additional option for the -l parameter to
> output tensor tabulation code suitable for execution in a CUDA kernel on
> the GPU. For that the indexing for coord
On 20 January 2011 14:32, Marie E. Rognes wrote:
>
> Repeated runs of the dolfin generate-form-files scripts seems to generate
> different code. For instance for the forms defined in
>
> /demo/undocumented/dg-advection-diffusion/cpp/AdvectionDiffusion.ufl
>
> I get differences of the type
>
>
On 20 January 2011 14:59, Marie E. Rognes wrote:
> On 01/20/2011 02:55 PM, Kristian Ølgaard wrote:
>
> On 20 January 2011 14:32, Marie E. Rognes wrote:
>
> Repeated runs of the dolfin generate-form-files scripts seems to generate
> different code. For instance for th
On 20 January 2011 15:23, Marie E. Rognes wrote:
> On 01/20/2011 03:20 PM, Kristian Ølgaard wrote:
>
> On 20 January 2011 14:59, Marie E. Rognes wrote:
>
> On 01/20/2011 02:55 PM, Kristian Ølgaard wrote:
>
> On 20 January 2011 14:32, Marie E. Rognes wrote:
>
>
On 21 January 2011 01:14, Marie E. Rognes wrote:
> On 01/20/2011 03:47 PM, Kristian Ølgaard wrote:
>
> On 20 January 2011 15:23, Marie E. Rognes wrote:
>
> On 01/20/2011 03:20 PM, Kristian Ølgaard wrote:
>
> On 20 January 2011 14:59, Marie E. Rognes wrote:
>
> On 01
On 21 January 2011 10:59, Marie E. Rognes wrote:
> On 01/21/2011 10:34 AM, Kristian Ølgaard wrote:
>
> On 21 January 2011 01:14, Marie E. Rognes wrote:
>
> On 01/20/2011 03:47 PM, Kristian Ølgaard wrote:
>
> On 20 January 2011 15:23, Marie E. Rognes wrote:
>
> On 01
On 9 March 2011 08:36, Anders Logg wrote:
> On Wed, Mar 09, 2011 at 08:31:08AM +0100, Marie E. Rognes wrote:
>>
>>
>> On 03/09/2011 08:29 AM, Anders Logg wrote:
>> >Buildbot looks green now for FFC.
>>
>> I regenerated the references.
>>
>> The mac-bot complains because of differences between 0.55
Garth implemented quadrature schemes for simplices so now one can do:
ffc -q canonical Foo.ufl
and
ffc -q default Foo.ufl
'canonical' is what we had before and 'default' (the current default)
is the new rule Garth hard coded.
Now for the question.
The QuadratureElement obviously needs this extra
On 28 April 2011 23:17, Anders Logg wrote:
> On Thu, Apr 28, 2011 at 12:55:02PM +0200, Martin Sandve Alnæs wrote:
>> On 28 April 2011 11:45, Garth N. Wells wrote:
>> >
>> >
>> > On 27/04/11 20:50, Johan Hake wrote:
>> >> On Wednesday April 27 2011 12:45:46 Martin Sandve Alnæs wrote:
>> >>> On 27
On 5 May 2011 20:46, Marie E. Rognes wrote:
> On 05/05/2011 08:43 PM, Johan Hake wrote:
>>
>> On Thursday May 5 2011 11:40:12 Marie E. Rognes wrote:
>>>
>>> On 05/05/2011 08:31 PM, Johan Hake wrote:
On Thursday May 5 2011 11:22:23 Marie E. Rognes wrote:
>
> On 05/05/2011 06:39 PM
On 16 May 2011 13:49, Marie E. Rognes wrote:
>
>
> On 16. mai 2011, at 12:13, "Garth N. Wells" wrote:
>
>> I suggest now would be a good point to make new releases of UFL, FFC and
>> DOLFIN. There have been a number of improvements to UFL, FFC caching,
>> and there have been a good number of DOLF
On 16 May 2011 14:33, Marie E. Rognes wrote:
>
> On 16. mai 2011, at 14:17, Kristian Ølgaard wrote:
>
>> On 16 May 2011 13:49, Marie E. Rognes wrote:
>>>
>>>
>>> On 16. mai 2011, at 12:13, "Garth N. Wells" wrote:
>>>
>>>>
On 6 July 2011 13:17, Garth N. Wells wrote:
> FFC can generated *very* large files with the tensor contraction
> approach, especially when auxiliary problems like error estimation are
> used. This makes compilation slow, and possibly fail.
>
> The array A in the generated code often has a lot of z
Don't we only need one set of *.out files? That way we can check the
different representations against each other, which will increase
confidence before updating the *.h files after e.g., formatting
changes.
Kristian
On 8 July 2011 19:02, wrote:
> ---
On 8 July 2011 21:31, Marie E. Rognes wrote:
> On 07/08/11 21:06, Kristian Ølgaard wrote:
>>
>> Don't we only need one set of *.out files?
>
> In theory, yes. This just seemed like the simpler way.
Sure.
>
>> That way we can check the
>> different repre
On 4 August 2011 14:56, Chaffra wrote:
> New question #166940 on DOLFIN:
> https://answers.launchpad.net/dolfin/+question/166940
>
> Dear all,
>
> I want to be able to solve poisson's equation with some abs(absolute value)
> functions in it, but ffc breaks with
>
> Exception: False value of Condt
s of solving the issue as you point
out.
It's difficult to predict so let's wait and see if some one hits a
corner case we can investigate.
Kristian
> Martin
>
> On 6 August 2011 17:00, Kristian Ølgaard wrote:
>> On 4 August 2011 14:56, Chaffra wrote:
>>&g
On 12 September 2011 21:36, Marie E. Rognes wrote:
> On 09/12/11 20:00, Marie E. Rognes wrote:
>>
>> On 09/12/11 19:54, Garth N. Wells wrote:
>>>
>>> On 12 September 2011 18:49, Marie E. Rognes wrote:
On 09/12/11 19:40, Garth N. Wells wrote:
>
> Which compiler options did you us
On 12 September 2011 22:38, Garth N. Wells wrote:
> On 12 September 2011 20:56, Kristian Ølgaard wrote:
>> On 12 September 2011 21:36, Marie E. Rognes wrote:
>>> On 09/12/11 20:00, Marie E. Rognes wrote:
>>>>
>>>> On 09/12/11 19:54, Garth N. Wells wro
On 12 September 2011 23:24, Marie E. Rognes wrote:
> On 09/12/11 21:56, Kristian Ølgaard wrote:
>>
>> On 12 September 2011 21:36, Marie E. Rognes wrote:
>>>
>>> On 09/12/11 20:00, Marie E. Rognes wrote:
>>>>
>>>> On 09/12/11 19:54, Gar
On 13 September 2011 00:30, Marie E. Rognes wrote:
> On 09/12/11 23:42, Kristian Ølgaard wrote:
>>
>> And of course we still need to consider mixed elements etc.
>
> Ah, the mixed elements. How could I forget. Will think a little more about
> those.
For VectorElements we
On 14 October 2011 10:51, Anders Logg wrote:
> The FFC tests are failing on my laptop. I might have screwed something
> up locally but it might also be related to updating to Ubuntu 11.10
> last night which has GCC 4.6.1-9ubuntu3.
>
> Here's the error I get:
>
> Verifying element 2 of 143: >
> GCC
On 31 October 2011 11:15, Martin Sandve Alnæs wrote:
> I think we can avoid making the release branches for
> non-dolfin projects until someone wants to add new features.
> But before new features are added, we need to make release
> branches just like for dolfin. Ok?
Yes, it sounds like a sensib
On 22 November 2011 03:13, Marie E. Rognes wrote:
>
> I think that there is some arbitraryness in the generated optimized
> quadrature code cf. current buildbot fail: the output matches for
> all three code generation strategies, but the generated
> code is different for -r quadrature -O on one of
On 22 November 2011 11:29, Marie E. Rognes wrote:
>
> On 22. nov. 2011, at 11:14, Kristian Ølgaard wrote:
>
>> On 22 November 2011 03:13, Marie E. Rognes wrote:
>>>
>>> I think that there is some arbitraryness in the generated optimized
>>> quadrature
On 29 November 2011 14:00, Anders Logg wrote:
> On Tue, Nov 29, 2011 at 01:49:15PM +0100, Johannes Ring wrote:
>> On Tue, Nov 29, 2011 at 1:37 PM, Anders Logg wrote:
>> > On Tue, Nov 29, 2011 at 12:15:31PM +0100, Johannes Ring wrote:
>> >> On Tue, Nov 29, 2011 at 7:15 AM, Anders Logg wrote:
>> >
On 29 November 2011 21:26, Anders Logg wrote:
> On Tue, Nov 29, 2011 at 09:11:58PM +0100, Kristian Ølgaard wrote:
>> On 29 November 2011 14:00, Anders Logg wrote:
>> > On Tue, Nov 29, 2011 at 01:49:15PM +0100, Johannes Ring wrote:
>> >> On Tue, Nov 29, 2011
On 30 November 2011 00:56, Marie E. Rognes wrote:
>
>
> On 29. nov. 2011, at 21:11, Kristian Ølgaard wrote:
>
>> On 29 November 2011 14:00, Anders Logg wrote:
>>> On Tue, Nov 29, 2011 at 01:49:15PM +0100, Johannes Ring wrote:
>>>> On Tue, Nov 29, 2011 a
On 8 December 2011 10:58, Harish Narayanan wrote:
> On 12/8/11 10:53 AM, Anders Logg wrote:
>> On Thu, Dec 08, 2011 at 10:46:20AM +0100, Harish Narayanan wrote:
>>> Dear all,
>>>
>>> I am trying to run some problems which involve somewhat complex
>>> variational forms which FFC takes ages (O(1 day
On 19 February 2013 21:55, Anders Logg wrote:
> Very nice. This is the proper way to do it.
Agree, is it switched on as default in the tests already? If not, just go ahead.
Kristian
> --
> Anders
>
>
> On Tue, Feb 19, 2013 at 09:54:10PM +0100, Martin Sandve Alnæs wrote:
>> I've implemented a
On 25 February 2013 17:07, Florian Rathgeber
wrote:
> -BEGIN PGP SIGNED MESSAGE-
> Hash: SHA1
>
> FFC generates C++ code, which makes sense given that the UFC interface
> is specified in C++. It is however a limitation when you want to use
> FFC to generate code for another interface/backe
On 26 February 2013 15:26, Florian Rathgeber
wrote:
> -BEGIN PGP SIGNED MESSAGE-
> Hash: SHA1
>
> On 26/02/13 09:33, Martin Sandve Aln￦s wrote:
>> Just want to chip in here. FYI I'm currently adding a new
>> representation to ffc based on lp:uflacs, where I reuse some of the
>> quadrature
On 27 February 2013 23:48, Anders Logg wrote:
> I'm trying to get DOLFIN to build against the new UFC branch (the
> foo-ufc-geometry branches) and it works mostly ok now, but for a few
> demos, something strange happens in the optimized quadrature code.
>
> One example that fails is AdaptivePoisso
36 matches
Mail list logo
