Repository of the polynomials library.
|80a5eeeb0d5d||2022-06-22 17:19:32||Harald Klimach||tip Updated treelm to latest version and turn warnings into e...|
|96fb2c53a267||2022-05-20 19:11:51||Harald Klimach||Avoid unused declarations, to reduce warnings.|
|d186d82c95d5||2020-09-21 00:32:03||Harald Klimach||Made necessary components public again in the ply_subreso...|
|2037c5ba1afd||2020-09-10 16:09:59||Harald Klimach||Avoid parsing of separator lines by FORD.|
|3c61cf6788dd||2020-09-05 07:36:46||Harald Klimach||Extended the documentation in the poly_sampled_tracking_m...|
|1e2448d3b6ea||2020-08-20 21:44:47||Harald Klimach||Added component part in Ford links.|
|958ce0b741d9||2020-07-14 00:02:14||Neda Ebrahimi Pour||removed precice module from here, which is not used|
|e7b9432785a5||2020-06-23 05:09:14||Harald Klimach||Added some documentation text on the ply_sampled_tracking.|
|6d47c6e74f16||2020-03-19 05:57:17||Harald Klimach||Fill unused dimensions with zeroes for the surface refere...|
|868461a6f211||2020-03-16 21:56:36||Harald Klimach||Adapted the lagrange test to the reversed point ordering ...|
|tip||80a5eeeb0d5d||2022-06-22 17:19:32||Harald Klimach|
|adaptive_subsampling||53bafe1a4686||2016-11-17 21:17:55||Daniel Fleischer||Closed branch adaptive_subs...|
|default||80a5eeeb0d5d||2022-06-22 17:19:32||Harald Klimach||Updated treelm to latest ve...|
|feature/fxt||9629f14e0bae||2015-08-11 04:20:23||Nikhil Anand||flow: Closed <feature> 'fxt'.|
|memoryTranspose||dc3d9728fb06||2017-05-24 22:45:36||Peter Vitt||Closing the memoryTranspose...|
This project is a supporting library for TreElM. It does not work on its own, but rather needs to be included in other projects, which also include TreElM. The library provides some functionality to deal with Legendre polynomials, especially transforming between modal and nodal representations.
This library is licensed under the terms of the ISC license reproduced below. This means that polynomials is free software and can be used, reproduced, modified, distributed and redistributed also for commercial purposes. The only requirement is that some credit to the authors is given by putting this copyright notice somewhere in your project.
Note that the FXTPACK distributed with this library in external/fxtp/fxtpack140715 is not covered by this license, see its README for details. For your convenience its conditions are reproduced below.
Please see the individual source files for the respective authors.
All rights reserved.
Permission to use, copy, modify, and distribute this software for any purpose with or without fee is hereby granted, provided that the above copyright notice and this permission notice appear in all copies.
THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHORS DISCLAIM ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
The views and conclusions contained in the software and documentation are those of the authors and should not be interpreted as representing official policies, either expressed or implied, of University of Siegen.
h2. Usage Conditions of FXTPACK from its README
Anyone can use FXTPACK in any software, and anyone can modify the source files.
When you publish your software that uses FXTPACK or its modification, please mention that FXTPACK developed by Reiji Suda is used, in the documentation.
When you publish your paper of your research that uses FXTPACK, please refer the paper [R. Suda, M. Takami, "A Fast Spherical Harmonics Transform Algorithm", Math. Comp., 71-238, Apr. 2002, pp.703--715] (and [R. SUda, "Fast Spherical Harmonic Transform Algorithm based on· Generalized Fast Multiple Method", RIMS Kokyuroku vol 1606, pp. 18-29, Jun. 2008, RIMS, Kyoto University]).
h3. FXTPACK Author:
Reiji SUDA Department of Computer Science, Graduate School of Information Science and Technology, The University of Tokyo firstname.lastname@example.org
This work is supported by "An Evolutionary Approach to Construction of a Software Development Environment for Massively-Parallel Computing Systems", CREST, JST.