Download Grace User's Guide (for Grace

Transcript
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
For certain libraries required to build Grace (which are therefore even included in a suitable version)
there may be different Copyright/License statements. Though their License may by chance match the
one used for Grace, the Grace Copyright holders can not influence or change them.
Package
cephes library
T1lib
Xbae
Tab Widget
License
Free
LGPL
BSD-like
BSD-like
Licenses
2. Installation guide
2.1 Installing from sources
1. Configuration
Requirements. Grace usually compiles out of the box in a regular Unix-like
environment. You need an ANSI C compiler (gcc is just fine), the X11R5 or above
libraries and headers, and an implementaion of the M*tif API, version 1.2 or above. If
you want to compile your own changes to certain parts of Grace, you will need a parser
generator (yacc or, better, bison).
Extra libraries. Some features will be available only if additional libraries are installed.
Those are:
The JPEG backend needs the IJG's ( JPEG library), version 6.x.
The PNG backend needs the ( libpng) library (version 0.96 or above).
The PDF driver requires the PDFlib library of Thomas Merz to be installed,
which is available here, version 4.0.3 or above.
If your computer has the FFTW library installed when Grace is compiled, Grace
will link itself to this, and drop all conventional FFT's and DFT's. All transforms
will be routed through this package. Note that there is then no difference between
pushing the "FFT" button and the "DFT" button, except that FFT will complain if
the length isn't a power of 2, and DFT will not. For more information on this
package, see the FFTW Home page. In short, this package allows one to do
non-power-of-2 length FFT's along with the normal ones. It seems to work very
efficiently for any set length which factors into 2^a 3^b 5^c 7^d for integer a, b,
c, d. The great feature here is that set lengths which are powers of 10 (e.g. 1000,
10000) and integer multiples of these (500, 2000, 2500, 5000, etc.) can be
computed with no significant penalty (maybe 20%) over power-of-2 transforms.
Very often, real datasets come in these sizes, and not in powers of 2.
In order to read/write sets in the NetCDF data format, you will also need the
NetCDF libraries.
3