/usr/include/GNUstep/Base/AdQuadratureFunctions.h is in adun.app 0.81-6+b1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 | /*
Project: Adun
Copyright (C) 2008 Michael Johnston & Jordi Villa-Freixa
Author: Michael Johnston
This application is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
License as published by the Free Software Foundation; either
version 2 of the License, or (at your option) any later version.
This application 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
Library General Public License for more details.
You should have received a copy of the GNU General Public
License along with this library; if not, write to the Free
Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111 USA.
*/
#ifndef QUADRATUREFUNCTIONS
#define QUADRATUREFUNCTIONS
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <Base/AdVector.h>
#include <Base/AdMatrix.h>
/**
Functions for generating integration points using different quadratures.
\defgroup QuadratureFunctions Quadrature
\ingroup Functions
@{
*/
/**
Returns the coeffiecents for the legendre polynomial of order (numberCoefficients - 1).
The coefficients are placed in \e coefficientsBuffer which must have storage for \e numberCoefficients.
*/
void AdGetLegendreCoefficients(unsigned int numberCoefficients, double* coefficientsBuffer);
/**
Returns the weight for \e point which was generated from a legendre polynomial of order \e order.
*/
double AdWeightForGaussLegendrePoint(double point, int order);
/**
Generates \e points coordinates and weights by gauss-legendre quadrature for evaluating an integral over the range \e start - \e end.
*/
void AdGenerateGaussLegendrePoints(double start, double end, unsigned int points, double* pointsBuffer, double* weightsBuffer);
/**
The Lebedev quadrature returns the optimal coordinates for integrating a function over a sphere using \e n points.
For example if \e n is 14 this function returns a grid containing the 14 optimally placed spherical points for integrating
the function.
However the Lebedev quadrature is limited in that it can only generate grids with defined numbers of points
- 6, 14, 26, 38, 50 etc.
Strictly each grid is optimal for a polynomial of certain order.
However at the moment I cannot make sense of the rules presented in the Fortan documentation.
The function generates a lebedev grid of size, buffer->no_rows.
At the moment only 14 point and 38 point grids are supported.
If \e size is not 14 or 38 this method returns an error code of 1.
Otherwise return 0.
*/
int AdGenerateLebedevGrid(AdMatrix* buffer);
/** \@}**/
#endif
|