PlotlyJS.jl is a great tool, we use it to plot the boundary meshes of 3D
finite element models as well as result data. Seems to handle large
datasets well. The API is well-documented and everything works as expected.
On Sunday, June 12, 2016 at 11:31:06 PM UTC+3, CrocoDuck O'Ducks wrote:
>
> Hi
Hi,
my colleague and I actually do a lot of FEM with Julia, basically all of my
thesis work is now written in Julia. We implemented some fairly general
algorithms for finite strain structural mechanics, contact mechanics,
dissipative materials, high-dimensional adaptive stochastics,
Yeah, I see the point. I guess it'll be left to the developer to care for,
then.
On Wednesday, April 20, 2016 at 9:12:27 PM UTC+2, Michael Borregaard wrote:
>
>
> There are many cases where it is convenient to be able to give 0 kwargs.
> Is it not better to test for
> isempty(a)
> when the
probably be:
>
> f(firstval::T, rest::T...) = <...>
>
>
> though it certainly doesn't look as pretty.
>
> On Wed, Apr 20, 2016 at 10:54 AM, Robert Gates <robert...@gmail.com
> > wrote:
>
>> Okay, perfect, that answered my question! I thought that
(like the one above).
On Wednesday, April 20, 2016 at 4:30:49 PM UTC+2, Robert Gates wrote:
>
> I was wondering how this can happen:
>
> *julia> **type T1; end*
>
>
> *julia> **type T2; end*
>
>
> *julia> **f(a::T1...) = ()*
>
> *f (generic fun
I was wondering how this can happen:
*julia> **type T1; end*
*julia> **type T2; end*
*julia> **f(a::T1...) = ()*
*f (generic function with 1 method)*
*julia> **f(a::T2...) = ()*
WARNING: New definition
f(Main.T2...) at none:1
is ambiguous with:
f(Main.T1...) at none:1.
To
what were your timings?
i get:
size(particles) = (30,)
size(particles) = (30,)
0.060457 seconds (300.58 k allocations: 48.089 MB)
(30,)
(30,)
0.57 seconds (27 allocations: 912 bytes)
On Thursday, November 19, 2015 at 10:11:47 PM UTC+1, Andre Bieler wrote:
>
> I have
Dear Julia users:
I'm trying to define a parametric composite type with fields whose types
depend on both the type parameter as well as the parameter of the type
parameter. This is what I tried:
type Foo{T}
a::T
end
type Bar{F : Foo}
a::F
b::F.parameters[1]
end
ERROR: type TypeVar has
Okay, thank you!
On Wednesday, April 29, 2015 at 1:33:06 PM UTC+2, ele...@gmail.com wrote:
On Wednesday, April 29, 2015 at 9:00:00 PM UTC+10, Robert Gates wrote:
Dear Julia users:
I'm trying to define a parametric composite type with fields whose types
depend on both the type parameter
Dear Julia users,
while overloading ./ and / for some arrays of custom types and encountering
type instability, I've noticed that the standard ./ functions behave
similarly:
*julia **Base.return_types((./), (Array{Array{Float64,1},1}, Float64))*
*1-element Array{Any,1}:*
*Array{Any,1}*
Dear Julia users,
while overloading ./ and / for some arrays of custom types and encountering
type instability, I've noticed that the standard ./ functions behave
similarly:
*julia **Base.return_types((./), (Array{Array{Float64,1},1},
Array{Array{Float64,1},1}))*
*1-element Array{Any,1}:*
*
Dear Julia Users,
does anyone know of a package capable of computing whether a point lies
inside or outside of a (3D) convex hull?
I know that the solution to this problem is rather trivial, however, before
I reinvent the wheel, I figured some code might already be out there. I
checked the
I second the need for PetSc :) I think GLPlot's pretty good at 3D plotting
btw.
On Friday, January 23, 2015 at 8:21:27 AM UTC+1, anonymousnoobie wrote:
ability to rotate and manipulate 3D plots would be nice
On Tuesday, January 20, 2015 at 8:38:42 AM UTC-8, cormu...@mac.com wrote:
Dear Julia Users,
I would like to silence the output of packages, but am having trouble doing so.
This applies to package-generated info() messages occuring due to using calls
as well as to the output of external programs, e.g. a solver. Basically I'd
like to redirect everything except my own
by comparison to an algorithm specifically tuned to exploit
sparseness.
--Tim
On Saturday, December 20, 2014 08:25:24 PM Robert Gates wrote:
Hi Julians,
When trying this, I get (Julia 0.3.3):
*julia **b = sub(a,1:2,1:2)*
*2x2
SubArray{Float64,2,SparseMatrixCSC
Time's kind of scarce atm, but I'll check it out when I'm done with my
master's thesis :)
On Monday, December 22, 2014 12:19:07 PM UTC+1, Tim Holy wrote:
On Monday, December 22, 2014 01:52:55 AM Robert Gates wrote:
Shouldn't such a fallback method be on the books for 0.4?
If someone
Hi Julians,
When trying this, I get (Julia 0.3.3):
*julia **b = sub(a,1:2,1:2)*
*2x2
SubArray{Float64,2,SparseMatrixCSC{Float64,Int64},(UnitRange{Int64},UnitRange{Int64})}:*
* 1.0 0.0*
* 0.0 1.0*
*julia **b*ones(2)*
*ERROR: `A_mul_B!` has no method matching A_mul_B!(::Array{Float64,1},
In any case, this does make me wonder what is going on under the hood... I
would not call the vectorized code vectorized. IMHO, this should just
pass to BLAS without overhead. Something appears to be creating a bunch of
temporaries.
On Thursday, December 11, 2014 5:47:01 PM UTC+1, Petr Krysl
Yeah, I think I figured it out on my own, hence the message deletion.
Nonetheless, I don't see your comment.
On Thursday, December 11, 2014 11:29:15 PM UTC+1, Andreas Noack wrote:
I wrote a comment in the gist.
2014-12-11 17:08 GMT-05:00 Robert Gates robert...@gmail.com javascript
Hi Ivar,
yeah, I know, I thought Andreas was replying to my deleted post. I think
Petr already solved the problem with the globals (his gist was apparently
not the right context). However, he still reported:
On Thursday, December 11, 2014 6:47:33 PM UTC+1, Petr Krysl wrote:
One more note: I
Hi Petr,
just on a side-note: are you planning on implementing a complete FE package
in Julia? In that case we could pool our efforts.
Best regards,
Robert
On Monday, December 8, 2014 9:09:19 PM UTC+1, Petr Krysl wrote:
I posted a message yesterday about a simple port of fragments a finite
Hi Petr,
I wrote you an email.
Although I haven't seen your Julia implementation, I believe you could cut
down on GC time by running the GC at regular intervals only. For example,
when I loop over something, I usually choose to purge memory every 20Mb,
e.g. every 1000 iterations. That way, I
setindex!(::Type{Array{MyType,1}}, ::MyType, ::Int64)
Seems a bit weird to me, since
my_type_collection = [MyType(a,b,c); MyType(d,e,f)]
my_type_collection[1] = my_type_collection[2]
works just fine.
On Tuesday, November 25, 2014 10:00:59 PM UTC+1, Robert Gates wrote:
Hi Julians:
I'm still new
Hi Julians:
I'm still new to Julia and am having a little trouble correctly
understanding composite types. I would like to create a composite type with
a mixture of constant attributes, i.e. class attributes, and mutable
attributes. In practice, the problem is that I need to instantiate many,
, att3) = constantAttribute(typeof(instance))
Right? BTW, a little OT, I know, but is there an overhead if I pass the
instance itself, instead of only its type, i.e.
constantAttributes{T:MyAbstractType}(instance::T)?
On Tuesday, November 25, 2014 10:00:59 PM UTC+1, Robert Gates wrote:
Hi Julians
25 matches
Mail list logo
