Anyone know why?  I'm curious.
---
J.

http://download.approximatrix.com/sfort … -3.5.0.prj

If you download and use the new project, it should fix the missing files.

Upon the first use of LAPACK, it appeared that file "dlamch.f" was missing - the same problem Carols had.

First, I created fresh folder with LAPACK source, copied "dlamch.f" from INSTALL to SRC folder and build the entire thing again.  Upon successful build, I've checked the "Makefile" and "dlamch.f" was not mentioned there. I tried to compile and run my program and got the same error message.

Second, I copied "dlamch.f" to my current project folder and added (right click "Add File(s)") it to my currently opened SF project tree. After that the compilation and launching went through without reported errors.

Jeff, is there a way to add "dlamch.f"  like the other LAPACK files, so it's there "forever" and I don't have to do this for each new program/project?
Thanks.

* Complete *
====================================
So happy! :-)

@ John

..I have to find eigenvalues/eigenvectors of large Hermitian matrices (size of about 20k) and have to do it for a large number of those matrices.

We are not the same.  Your effort appears to be directed more to advanced mathematics, in which you are content to throw computer resources at your work without any great regard for or distraction by clever ways of optimising the way those resources are used.

In my view, this is far more laudable, and cerebral, than what I do.  I take pleasure from solving a problem that israther elementary compared with yours, but is handled with computer resources so minimal that it's hard to imagine it being possible.  Or rather, that was how I started (with an Apple ][) and 8-bit M$Fortran.  On such a system, with 48k of available memory, 128k of disk storage, no swapfile and an overlay linker, my finest hour was probably when I built a plane strain/[laine stress finite element plate-bending analysis program using 8-noded isoparametric rectangles with parabolic sides and shape functions, and 9 gauss points, which could analyse, solve and then post-process and print graphics output, for a problem with more than 80 elements.  A run like the above would take 2 hours. 

My contribution was a certain amount of skill and imagination in efficient coding, not the maths behind it - for which program authors Hinton and Owen were responsible, at Swansea.

The above is what I used once to do.  Now that system resources are no longer in short supply, it makes no sense to try spend time compacting my code and storage, but I still do it!

What you do is far more worthwhile, albeit not necessarily quite as satisfying, and its why you need LAPACK and I ought to need it, but don't!

OVER AND OUT.
---
John

The revised project can be downloaded from the same location:

http://download.approximatrix.com/sfort … -3.5.0.prj

And it seems to be building fine now.

Generating liblapack.a
The parameter is incorrect.

Error(E42): Last command making (liblapack.a) returned a bad status
Error(E02): Make execution terminated

Could you please email me your Makefile to support@approximatrix.com?  It will have been created in the lapack-3.5.0 directory.  It would appear that something might be wrong with the final step in generating the library.

In my case, I have to find eigenvalues/eigenvectors of large Hermitian matrices (size of about 20k) and have to do it for a large number of those matrices. I was recommended to use Fortran+LAPACK+MPI on a supercomputer.

======================================
Generating Makefile... Okay
======================================
Compiling .\BLAS\SRC\caxpy.f
Compiling .\SRC\cbbcsd.f
...
... (total 1789 files compiled)
...
Compiling .\SRC\zupgtr.f
Compiling .\SRC\zupmtr.f
Generating liblapack.a
The parameter is incorrect.

Error(E42): Last command making (liblapack.a) returned a bad status
Error(E02): Make execution terminated

* Failed *

Could you please advise, what might be wrong?
Thanks!

That said, LAPACK forms the basis for an enormous amount of numerical software.   It is easily the most downloaded package on the SF Package Manager (along with its BLAS dependency).

I must say, I did not realise that LAPACK was as valuable as that!

I write programs which do a lot of linear algebra, particularly with banded symmetrical arrays for my equation coefficients.
Naturally, I don't waste memory by storing large numbers of off-diagonal zeros, outside the non-zero symmetrical band.

I use two storage strategies:

(1) storing only the half-bandwidth, either in a rectangular array, of size NEQ x HBW, where these integers are the number of equations and the half bandwidth, respectively, or in a 1-D vector.  I write a simple function to retrieve element (i,j) for the full-size matrix from this compacted array of the half bandwidth. 

(2) for problems in which the half bandwidth also contains a lot of zeros, I use 'Skyline' array storage, with a 1-D vector of pointers to  retrieve element (i,j) for the full-size uncompacted matrix.

I can see from the LAPACK website that it will solve Ax + B = C, where A is a full-size square matrix, but can you point me to where in LAPACK docs I can find how to use it to solve these same equations when A is a banded symmetrical matrix stored in the above two compacted forms, without the off-diagonal zeros?

I had thought it was not so good that it could do all this, and was only useful for use coding without a care in the world about efficient storage.   

That is, I thought,

I'd love you to prove me wrong.
---
John