Re: heap size exceeded for large matrices

[John Raymond Dore <johnrdore@gmail.com>]

On Aug 29, 11:42 am, Simon Wright <si...@pushface.org> wrote:
> "Yannick Duchêne (Hibou57)" <yannick_duch...@yahoo.fr> writes:
>
> > Le Sun, 29 Aug 2010 10:50:39 +0200, John Raymond Dore
> > <johnrd...@gmail.com> a écrit:
> >> I have no difficulty in increasing the storage size of a task.
> >> I cannot do the same for matrices within a procedure
> > Forgive my question is this ever happens to looks stupid: is your
> > matrix allocated as a local object of that procedure ?
> > If so, the stack may have a maximum limit which cannot be exceeded,
> > and dynamic allocation may solve the case.
> > If not, an excerpt from the source could help to see.
>
> > Do you use Ada.Numerics.Generic_Real_Arrays.Real_Matrix ? (that is
> > what I supposed, may need to be confirmed).
>
I just need a large matrix (1..10000, 1..10000) of long_float would
suffice accessible from a procedure.
It does not have to be declared within a procedure.
My computer is running 64bit Ubuntu
> The implementation of the Ada.Numerics.Generic*Arrays in GNAT (and inhttps://sourceforge.net/projects/gnat-math-extn/) allocates temporary
> arrays on the stack, which will be of similar sizes to the original.
>
> Can you call the matrix operations from a task with a large stack?
>
> I'm not sure that generalized algorithms are going to meet your needs
> (you're going to be perilously close to your 8GB of real memory, when
> you consider temporary space, which is going to risk much swapping; and
> won't you need a 64-bit OS?) Are there any sparse matrix algorithms?