[fpc-pascal] sparse matrix storage method
Mehmet Erol Sanliturk
sanliturk at ttmail.com
Tue Jun 9 10:25:16 CEST 2009
Alain Michaud wrote:
> Hi,
>
> would someone know of a procedure for solving a system of linear
> equations using a SPARSE MATRIX storage model.
>
> if one uses the usual: array [1..10000;1..10000] of "mostly_zeroes" then
> this is a really big waist of memory.
>
> I am thinking of using: Tlist instead, but I would not like to reinvent
> the wheel! I would apreciate if someone could give me a tip.
>
> Thank you
>
> Alain
>
>
In the web site
http://www.netlib.org/
you may find both C and Fortran programs about sparse matrices ,
( I do not know whether there exist Pascal programs for sparse matrices
, you may search . )
I think , the above site is the best source of sparse matrix computation
sources .
In < Data Structures with Pascal > books , there may exist
sparse matrix computation procedures .
You may see the following sites .
I could not find any procedure for sparse matrices here ,
but existing algorithms may be useful :
http://pagesperso-orange.fr/jean-pierre.moreau/
http://www.delphiforfun.org/Programs/Delphi_Techniques/GaussianElimination.htm
The following sites are about numerical computation languages .
They are open source projects . In their sources it may be possible to
find sparse matrix computation related sources ( They are not programmed
in Pascal ) :
http://www.gnu.org/software/octave/
http://www.r-project.org/
http://numexp.org/
http://www.scilab.org/
The following site is about mathematics subjects :
http://www.mathtools.net/
Thank you very much .
Mehmet Erol Sanliturk
More information about the fpc-pascal
mailing list