# Logiciels gratuits pour le calcul scientifique

L’objectif de cette page est de mettre en valeur les interactions possibles entre les logiciels numériques gratuits disponibles sur internet. Ceci afin de les connecter entre eux dans la chaîne de développement informatique. La description de chaque logiciel est succincte (voyez les liens vers d’autres listes de logiciels pour des descriptions plus détaillées) mais une attention spéciale a été réservée aux formats de données qui peuvent servir d’interface. Un format de données est cité s’ils est décrit par la documentation du logiciel et suffisamment standard pour servir d’interface avec d’autres outils.

Cette page est produite au Laboratoire Jacques-Louis Lions de Sorbonne Université, mais beaucoup de logiciels cités ne sont ni développés ni maintenus au Laboratoire. La seule référence officielle est la documentation de chaque logiciel. Merci de prévenir Antoine Le Hyaric si vous notez une imprécision.

# Catégories

## Licences pour logiciels libres

Voici une liste de licences gratuites, parmi les plus répandues :

Et une autre liste en anglais : List of Free Licenses from the Open Source Initiative

# Liste alphabétique

## 3D-Studio

This document describes the file format of the 3ds files generated by 3d-studio by Autodesk.

### Web

http://www.dcs.ed.ac.uk/home/mxr/gfx/3d/3DS.spec

ADMesh is a program for processing triangulated solid meshes. Currently, ADMesh only reads the STL file format that is used for rapid prototyping applications, although it can write STL, VRML, OFF, and DXF (voir AutoCAD) files.

### Features

• Read and write binary and ASCII STL files
• Check STL files for flaws (i.e. unconnected facets, bad normals)
• Repair facets by connecting nearby facets that are within a given tolerance
• Fill holes in the mesh by adding facets.
• Repair normal directions (i.e. facets should be CCW)
• Repair normal values (i.e. should be perpendicular to facet with length=1)
• Remove degenerate facets (i.e. facets with 2 or more vertices equal)
• Translate in x, y, and z directions
• Rotate about the x, y, and z axes
• Mirror about the xy, yz, and xz planes
• Scale the part by a factor
• Merge 2 STL files into one
• Write an OFF file
• Write a VRML file
• Write a DXF (voir AutoCAD) file
• Calculate the volume of a part

GPL

STL file format

## ARPACK

ARPACK++ is an object-oriented version of the ARPACK package. ARPACK is a well known collection of Fortran subroutines designed to compute a few eigenvalues and eigenvectors of large scale sparse matrices and pencils. It implements a variant of the Arnoldi process for finding eigenvalues called Implicit restarted Arnoldi method (IRAM) and is capable of solving a great variety of problems from single precision positive definite symmetric problems to double precision complex non-Hermitian generalized problems.

ARPACK++ is a collection of classes that offers C++ programmers an interface to ARPACK. It preserves the full capability, performance, accuracy and low memory requirements of the Fortran package, but takes advantage of the C++ object-oriented programming environment.

ARPACK is a collection of Fortran 77 subroutines designed to solve large scale eigenvalue problems.

The package is designed to compute a few eigenvalues and corresponding eigenvectors of a general n by n matrix A. It is most appropriate for large sparse or structured matrices A where structured means that a matrix-vector product w ← Av requires order n rather than the usual order n2 floating point operations. This software is based upon an algorithmic variant of the Arnoldi process called the Implicitly Restarted Arnoldi Method (IRAM). When the matrix A is symmetric it reduces to a variant of the Lanczos process called the Implicitly Restarted Lanczos Method (IRLM). These variants may be viewed as a synthesis of the Arnoldi/Lanczos process with the Implicitly Shifted QR technique that is suitable for large scale problems. For many standard problems, a matrix factorization is not required. Only the action of the matrix on a vector is needed.

ARPACK software is capable of solving large scale symmetric, nonsymmetric, and generalized eigenproblems from significant application areas. The software is designed to compute a few (k) eigenvalues with user specified features such as those of largest real part or largest magnitude. Storage requirements are on the order of n.k locations. No auxiliary storage is required. A set of Schur basis vectors for the desired k-dimensional eigen-space is computed which is numerically orthogonal to working precision. Numerically accurate eigenvectors are available on request.

PARPACK (Parallel ARPACK) is an extension of the ARPACK software package used for solving large scale eigenvalue problems on distributed memory parallel architectures. The message passing layers currently supported are BLACS and MPI.

https://en.wikipedia.org/wiki/ARPACK

## Atlas

The ATLAS (Automatically Tuned Linear Algebra Software) project is an ongoing research effort focusing on applying empirical techniques in order to provide portable performance. At present, it provides C and Fortran 77 interfaces to a portably efficient BLAS implementation, as well as a few routines from LAPACK.

### Web

http://math-atlas.sourceforge.net/

### Documentation

(il ne s’agit pas ici du logiciel commercial AutoCAD mais du format de ses fichiers car ils sont compris par beaucoup d’autres logiciels)

Drawing Interchange Format (DXF) files enable the interchange of drawings between AutoCAD and other programs. DXF files can be either ASCII or binary formats.

## Automake

“* Automake is a tool for automatically generating ‘Makefile.in’ files compliant with the GNU Coding Standards. Automake requires the use of GNU Autoconf.*”

### Web

http://www.gnu.org/software/automake/

### Documentation

http://www.gnu.org/software/automake/manual/html_node/#indexl

## Ayam

Ayam is a free (as in free speech, BSD-licensed) 3D modelling environment for the RenderMan interface. Free means that neither the author nor any contributors make money out of this software. We need your (yes your!) feedback to keep this project alive. If you use Ayam, please submit your pictures, bug reports, or feature requests.

Ayam currently runs on Unix (Linux, IRIX, FreeBSD tested), Win32 (Win95-Win2000, XP), and Mac OS X (Aqua and X11)

Ayam features at a glance :

• RIB (RenderMan Interface Bytestream) export and import.

• Support for NURBS curves and (trimmed) NURBS surfaces, Boxes, Quadrics (Sphere, Disk, Cylinder, Cone, Hyperboloid, Paraboloid, and Torus), CSG, MetaBalls, Patch Meshes, Polygonal Meshes, and Subdivision Surfaces.

• NURBS modelling includes normal and interpolating curves as well as extrude, revolve, sweep, birail, skin and gordon objects with caps, holes, and bevels.

• Custom objects that may freely implement their representations (using OpenGL and RIB) and even small GUIs to edit their type specific parameters may be written by the user and dynamically loaded at runtime.

• Scripting interface: Tcl.

• Misc: instancing, arbitrary number of modeling views, object clipboard, independent property clipboard, console, n-level undo.

• Documentation: http://ayam.sourceforge.net/#docsl

## Bamg

Bamg est un générateur de maillages bidimensionnels isotropes ou anisotopes. Ce générateur permet, soit de construire un maillage à partir d’une géométrie, soit de construire un maillage adapté à partir d’un maillage précédent et d’une solution ou d’une métrique. Il permet aussi d’interpoler sur le maillage créé des solutions P1 définies sur le maillage précédent.

Une géométrie est définie par un maillage de contours : liste de sommets, liste d’arêtes, plus des informations de continuité G1. Cette géométrie peut être construite avec EMC2 et en traduisant le fichiers de maillage avec le petit utilitaire cvmsh2 qui est inclus.

• Auteur(s): Frédéric Hecht
• Format de données standard écrits: .am .am_fmt .amdba .nopo (Modulef, NSC2KE, xd3d), .mesh (FreeFEM++)
• Logiciels capables de lire ce format: Rheolef

## Bidirectional Reflectance Codes

This webpage provides access to two collections of FORTRAN codes.

The first one can be used to compute the (scalar) bidirectional reflectance of a semi-infinite homogeneous slab composed of arbitrarily shaped, randomly oriented particles based on a rigorous numerical solution of the radiative transfer equation.

The second one can be used to compute the Stokes reflection matrix of a rough interface separating two homogeneous half-spaces with different refractive indices (e.g., a rough ocean surface).

## BILUM

BILUM is a set of programs designed for solving general sparse linear systems by using Krylov subspace methods preconditioned by some multi-level block ILU (BILUM) preconditioning techniques. BILUM combines the benefits of generality and robustness of ILU preconditioning techniques with those of grid-independent convergence of multigrid methods. The multi-level algorithms implemented by BILUM are based on the block independent set ordering and multi-elimination techniques. At each level, a block independent set is found by some greedy algorithms such that each block is decoupled with other blocks in the independent set. There is an inherited parallelism associated with this technique. The coefficient matrix is then re-ordered according to the independent set ordering and an approximate block ILU factorization is performed with a reduced system of smaller size. The multi-level structure is constructed by recursively applying the above idea to the approximate Schur complement (the reduced system) until the last reduced system is small enough to be solved by a direct method or a preconditioned iterative method.

### Web

http://www.cs.uky.edu/~jzhang/#biluml

### Téléchargement

http://www.cs.uky.edu/~jzhang/bilum/bilum.tar.gz

### Licence

This is a preliminary examination version of BILUM. Permission is granted for using the software for the purpose of examination. Users are not permitted to distribute the software. This software package comes with no warranty. The authors are not liable for any loss/damage or inconvenience caused in the use of this software package or any modification thereof. You use it at your own risk.

### Autres indications

Written in Fortran.

## BLACS

The BLACS (Basic Linear Algebra Communication Subprograms) project is an ongoing investigation whose purpose is to create a linear algebra oriented message passing interface that may be implemented efficiently and uniformly across a large range of distributed memory platforms.

The length of time required to implement efficient distributed memory algorithms makes it impractical to rewrite programs for every new parallel machine. The BLACS exist in order to make linear algebra applications both easier to program and more portable. It is for this reason that the BLACS are used as the communication layer of ScaLAPACK.

### Web

http://www.netlib.org/blacs/

## BLAS

The BLAS (Basic Linear Algebra Subprograms) are high quality “building block” routines for performing basic vector and matrix operations. Level 1 BLAS do vector-vector operations, Level 2 BLAS do matrix-vector operations, and Level 3 BLAS do matrix-matrix operations. Because the BLAS are efficient, portable, and widely available, they’re commonly used in the development of high quality linear algebra software, LINPACK and LAPACK for example.

Fiche PLUME

### Documentation

http://www.netlib.org/blas/#faql

### Autres indications

The BLAS have to be optimized for each particular hardware architecture. If you do not know where to find such an optimized version the BLAS, see Atlas or the GNU Scientific Library.

## Blender

Blender is the open source software for 3D modeling, animation, rendering, post-production, interactive creation and playback.

### Web

http://blender.org

### Licence

Available for all major operating systems under the GNU General Public License.

## Blitz++

Blitz++ is a C++ class library for scientific computing which provides performance on par with Fortran 77/90. It uses template techniques to achieve high performance. The current versions provide dense arrays and vectors, random number generators, and small vectors and matrices. Blitz++ is distributed freely under an open source license, and contributions to the library are welcomed.

Fiche PLUME

## Boost

Boost provides free peer-reviewed portable C++ source libraries.

We emphasize libraries that work well with the C++ Standard Library. Boost libraries are intended to be widely useful, and usable across a broad spectrum of applications. The Boost license encourages both commercial and non-commercial use.

We aim to establish “existing practice” and provide reference implementations so that Boost libraries are suitable for eventual standardization. Ten Boost libraries are already included in the C++ Standards Committee’s Library Technical Report (TR1) as a step toward becoming part of a future C++ Standard. More Boost libraries are proposed for the upcoming TR2.

Getting started: Boost works on almost any modern operating system, including UNIX and Windows variants. Follow the Getting Started Guide to download and install Boost. Popular Linux and Unix distributions such as Fedora, Debian, and NetBSD include pre-built Boost packages. Boost may also already be available on your organization’s internal web server.

### Web

http://www.boost.org

### Documentation

http://www.boost.org/libs/#libraries

### Téléchargement

http://sourceforge.net/project/showfiles.php?group_id=7586

### Licence

The BRL-CAD package is a powerful Constructive Solid Geometry (CSG) solid modeling system with over 20 years development and production use by the U.S. military. BRL-CAD includes an interactive geometry editor, parallel ray-tracing support for rendering and geometric analysis, path-tracing for realistic image synthesis, network distributed framebuffer support, image-processing and signal-processing tools.

### Licence

The entire package is distributed in source code form.

## BSP

Parallel programmers looking for a simple but efficient approach to developing scalable applications software may be interested in the BSPlib programming library. BSPlib is an alternative to MPI and PVM, and is based on the BSP model of parallel computation. It is already being used by a rapidly growing community of software developers in universities and in industry.

BSPlib can be used with C, C++, or Fortran. It supports SPMD parallelism based on efficient one-sided communications. The core library (excluding collective communications) consists of just 20 primitives.

### Web

http://www.bsp-worldwide.org/implmnts/oxtool/

### Documentation

http://www.bsp-worldwide.org/implmnts/oxtool/man/

## C

C est un langage de programmation généraliste, de même que C++ et Fortran.

Référence : The GNU C Reference Manual

Questions/Réponses de programmation

### Questions/Réponses

#### La syntaxe de printf()

http://www.cplusplus.com/reference/clibrary/cstdio/printf

## C++

C++ est un langage de programmation généraliste issu d’une évolution du langage C.

Questions/Réponses de programmation

… the CADNA library … allows to estimate the round-off error propagation on every scientific code written in FORTRAN language.

## CalculiX

CalculiX is a package designed to solve field problems. The method used is the finite element method.

With CalculiX Finite Element Models can be build, calculated and post-processed. The pre- and post-processor is an interactive 3D-tool using the OpenGL API. The solver is able to do linear and non-linear calculations. Static, dynamic and thermal solutions are available. Both programs can be used independently. Because the solver makes use of the abaqus input format it is possible to use commercial pre-processors as well. In turn the pre-processor is able to write mesh related data for nastran, abaqus, ansys, code-aster and for the free-cfd codes duns, ISAAC and OpenFOAM. A vda CAD interface is available. The program is designed to run on Unix platforms like Linux and Irix computers but also on MS-Windows.

The CalculiX package was developed by a team of enthusiasts in their raw spare time. They are employees of MTU Munich, an Aero Engine manufacturer in Germany which granted the publication.

https://fr.wikipedia.org/wiki/Calculix

## Cast3M

CASTEM 2000 est un code de calcul pour l’analyse de structures par la méthode des éléments finis. Ce code a été développé par le Département Mécanique et Technologie (DMT) du Commissariat français à l’Energie Atomique (CEA).

Le développement de CASTEM 2000 entre dans le cadre d’une activité de recherche dans le domaine de la mécanique dont le but est de définir un instrument de haut niveau, pouvant servir de support pour la conception, le dimensionnement et l’analyse de structures et de composants, dans le domaine du nucléaire comme dans le secteur industriel classique.

Dans cette optique, CASTEM 2000 intègre non seulement les processus de calculs proprement dits mais également les fonctions de construction du modèle (pré-processeur) et les fonctions de traitement des résultats (post-traitement). CASTEM 2000 est un programme que l’utilisateur peut adapter à ses besoins pour résoudre ses propres problèmes.

http://www-cast3m.cea.fr

## Channelflow

Channelflow is a software system for direct spectral simulation of incompressible Navier-Stokes flow in channel geometries, witten in C++. Channelflow is not innovative as an algorithm. Rather, Channelflow uses relatively modern software design to improve the usability, flexibility, and intelligibility of a well-known algorithm. The goals of Channelflow are

• to lower the barrier to entry to computational fluid dynamics
• to make CFD research codes short, readable, and easily modifiable

### Web

http://www.cns.gatech.edu/channelflow/

### Documentation

http://www.cns.gatech.edu/channelflow/documentation/#indexl

## Cilk

Cilk is a language for multithreaded parallel programming based on ANSI C. Cilk is designed for general-purpose parallel programming, but it is especially effective for exploiting dynamic, highly asynchronous parallelism, which can be difficult to write in data-parallel or message-passing style. Using Cilk, our group has developed three world-class chess programs, StarTech, Socrates, and Cilkchess. Cilk provides an effective platform for programming dense and sparse numerical algorithms, such as matrix factorization and N-body simulations, and we are working on other types of applications. Unlike many other multithreaded programming systems, Cilk is algorithmic, in that the runtime system employs a scheduler that allows the performance of programs to be estimated accurately based on abstract complexity measures.*”

### Web

http://supertech.lcs.mit.edu/cilk/

## Code_Aster

Code_Aster propose, bien au delà des fonctionnalités standard d’un code de calcul thermo-mécanique, toute une panoplie de méthodes d’analyse et de modélisations multiphysiques : de l’analyse sismique aux milieux poreux en passant par l’acoustique, la fatigue, la dynamique stochastique… Ses modélisations, ses algorithmes et ses solveurs ont gagné en robustesse et en complétude (1000000 lignes de codes, 200 opérateurs). Résolument ouvert, il est chaîné, couplé et encapsulé de mille façons. Bref, l’utilisateur n’a que l’embarras du choix !

http://www.code-aster.org

## CMake

CMake is an open-source, cross-platform family of tools designed to build, test and package software. CMake is used to control the software compilation process using simple platform and compiler independent configuration files, and generate native makefiles and workspaces that can be used in the compiler environment of your choice. The suite of CMake tools were created by Kitware in response to the need for a powerful, cross-platform build environment for open-source projects such as ITK and VTK.

https://cmake.org

## Code_Saturne

Code_Saturne® is EDF’s general purpose computational fluid dynamics software. Developed since 1997 at EDF R&D, it is based on a co-located Finite Volume approach that accepts meshes with any type of cell (tetrahedral, hexahedral, prismatic, pyramidal, polyhedral…) and any type of grid structure (unstructured, block structured, hybrid, conforming or with hanging nodes…).

Its basic capabilities enable the handling of either incompressible or expandable flows with or without heat transfer and turbulence (mixing length, 2-equation models, v2f, Reynolds stress models, Large Eddy Simulations…).

Dedicated modules are available for specific physics such as radiative heat transfer, combustion (gas, coal…), magneto-hydro dynamics, compressible flows, two-phase flows (Euler-Lagrange approach with two-way coupling), extensions to specific applications (e.g. for atmospheric environment: code Mercure_Saturne).

Code_Saturne can be coupled to EDF’s thermal software Syrthes. It can also be used jointly with EDF’s structural analysis software Code_Aster, in particular in the Salomé platform.

Parallel code coupling capabilities are provided by the FVM library (EDF’s “Finite Volume Mesh” library, under LGPL licence).

Fiche PLUME

### Format de données standard lus

De nombreux mailleurs sont compatibles avec Code_Saturne, entre autres I-DEAS®, GMSH, Gambit®, Simail®, Salomé, Harpoon®, ICEM®, …

### Format de données standard écrits

Les sorties de posttraitement sont disponibles aux formats EnSight®, CGNS et MED_fichier, avec des fonctionnalités avancées offertes par la librairie FVM (librairie « Finite Volume Mesh » développée par EDF sous licence LGPL). La librairie FVM offre aussi des possibilités de couplage de codes en parallèle.

## Conversion des fichiers texte

Les systèmes Linux, Windows et MacOS ne traitent pas les fichiers textes de la même façon :

• sur Linux, chaque ligne se termine par le caractère 0x0d
• sur Windows : 0x0d 0x0a
• sur MacOS (et anciennement SunOS) : 0x0a

### sed

Plusieurs éditeurs (par exemple Emacs) sont capables de traduire les lignes d’un système à l’autre. Mais on peut aussi utiliser les commandes suivantes sous Linux ou MacOS :

• De Windows vers Linux :

sed 's/\x0d\x0a/\x0d/g' windows.txt > linux.txt

• De MacOS vers Linux :

sed 's/\x0a/\x0d/g' macos.txt > linux.txt

### Emacs

M-x set-buffer-file-coding-system RET undecided-unix RET C-x C-s

## CUDA

Au laboratoire, CUDA est disponible sur gpu1, gpu2 et tesla. CUDA est une technologie propriétaire développée par la société NVidia. La technologie alternative OpenCL est moins dépendante d’une société mais aussi moins mature actuellement.

Introduction à CUDA

Description de CUDA sur Wikipedia

## DDD

GNU DDD is a graphical front-end for command-line debuggers such as GDB, DBX, WDB, Ladebug, JDB, XDB, the Perl debugger, the bash debugger, or the Python debugger. Besides “usual” front-end features such as viewing source texts, DDD has become famous through its interactive graphical data display, where data structures are displayed as graphs.

## deal.II

deal.II is a C++ program library targeted at adaptive finite elements and error estimation. It uses state-of-the-art programming techniques of the C++ programming language to offer you a modern interface to the complex data structures and algorithms required for adaptivity and enables you to use a variety of finite elements in one, two, and three space dimensions, as well as time-dependent problems.

The main aim of deal.II is to enable development of modern finite element algorithms, using among other aspects sophisticated error estimators and adaptive meshes. Writing such programs is a non-trivial task, and successful programs tend to become very large and complex. We therefore believe that this is best done using a program library that frees the application programmer from aspects like grid handling and refinement, handling of degrees of freedom, input of meshes and output of results in graphics formats, and the like. Also, support for several space dimensions at once is included in a way such that programs can be written independent of the space dimension without unreasonable penalties on run-time and memory consumption.

### Web

http://www.dealii.org/

### Documentation

Full documentation

## dolfyn

The Open Source CFD code dolfyn is an initiative in Noord-Brabant, a Dutch province in the south of the Netherlands, particularly in the region around Eindhoven. The Eindhoven Region presents itself as Leading in technology and ranks in the top three most technological districts in Europe. The goal of dolfyn is to promote, introduce and teach the use of modern numerical simulation techniques in general and the use of Computational Fluid Dynamics (CFD) in particular.

### Web

http://www.dolfyn.net/#index_enl

### Documentation

http://www.dolfyn.net/dolfyn/#faq_enl

### Exemples

http://www.dolfyn.net/dolfyn/#voorbeelden_enl

### Autres indications

Part of the documentation is in dutch. There is also a graphical user interface for dolfyn, at

## Doxygen

Doxygen is a documentation system for C++, C, Java, IDL (Corba and Microsoft flavors) and to some extent Objective-C, PHP, C# and D.

It can help you in three ways:

• It can generate an on-line documentation browser (in HTML) and/or an off-line reference manual (in LaTeX) from a set of documented source files. There is also support for generating output in RTF (MS-Word), PostScript, hyperlinked PDF, compressed HTML, and Unix man pages. The documentation is extracted directly from the sources, which makes it much easier to keep the documentation consistent with the source code.

• You can configure doxygen to extract the code structure from undocumented source files. This is very useful to quickly find your way in large source distributions. You can also visualize the relations between the various elements by means of include dependency graphs, inheritance diagrams, and collaboration diagrams, which are all generated automatically.

• You can even ‘abuse’ doxygen for creating normal documentation (as I did for this manual).

Doxygen is developed under Linux, but is set-up to be highly portable. As a result, it runs on most other Unix flavors as well. Furthermore, executables for Windows 9x/NT and Mac OS X are available.

## Elmer

Elmer is an open-source computational tool for multi-physics problems. It has been developed in collaboration with Finnish universities, research laboratories and industry.

• Elmer includes physical models of fluid dynamics, structural mechanics, electromagnetics and heat transfer. These are described by partial differential equations which Elmer solves by the Finite Element Method (FEM).

• Elmer comprises of several different parts: The geometry, boundary conditions and physical models are defined in ElmerFront. The resulting problem definition is solved by ElmerSolver. Finally the results are visualized by ElmerPost. Additionally a utility ElmerGrid may be used for simple mesh manipulation.

• The different parts of Elmer software may also be used independently. The strongest of the components is ElmerSolver which includes many sophisticated features. For pre- and postprosessing the users may find also other alternatives.

## Emacs

To quote the Emacs Manual:

Emacs is the extensible, customizable, self-documenting real-time display editor.

If this seems to be a bit of a mouthful, an easier explanation is Emacs is a text editor and more. At its core is an interpreter for Emacs Lisp (‘elisp’, for short), a dialect of the Lisp programming language with extensions to support text editing. Some of the features of GNU Emacs include:

• Content sensitive major modes for a wide variety of file types, from plain text to source code to HTML files.
• Complete online documentation, including a tutorial for new users.
• Highly extensible through the Emacs Lisp language.
• Support for many languages and their scripts, including all the European “Latin” scripts, Russian, Greek, Japanese, Chinese, Korean, Thai, Vietnamese, Lao, Ethiopian, and some Indian scripts. (Sorry, Mayan hieroglyphs are not supported.)
• A large number of extensions which add other functionality. The GNU Emacs distribution includes many extensions; many others are available separately–even a web browser

Fiche PLUME

### Documentation

GNU Emacs Lisp Reference Manual : http://www.gnu.org/software/emacs/manual/#elispl

## EMAP

EMAP (ElectroMagnetic Analysis Program) is a family of three-dimensional finite element modeling codes that can be used to analyze simple 3-dimensional geometries. The EMAP codes are relatively easy to learn to use and are distributed in source code form.

The EMAP codes are not intended to compete with commercial finite element modeling codes. They do not have a sophisticated mesh generator, graphical output, or unlimited technical support. Their primary strengths are ease-of-use, modest resource requirements, and accurate modeling of simple three-dimensional configurations over a wide range of frequencies.

## FEATFLOW

The progam package FEATFLOW is both a user oriented as well as a general purpose subroutine system for the numerical solution of the incompressible Navier-Stokes equations in two and three space dimensions. It is based on the packages FEAT2D and FEAT3D.

FEATFLOW is designed for the following three classes of applications:

• Education of students
• Scientific research
• Industrial applications

## Feel++ : Finite Element Embedded Library in C++

FEEL++ est une bibliothèque C++ pour la résolution des EDP par des méthodes de Galerkin généralisées telles que les méthodes des éléments finis simples et étendues (FEM et hp-FEM) et les méthodes spectrales.

Fiche PLUME

## FElt

The current version of FElt knows how to solve linear static and dynamic structural and thermal analysis problems; it can also do modal and spectral analysis for dynamic problems. FElt’s element library currently contains fourteen elements. The FAQ contains some additional information about what what kinds of problems FElt can solve as well as some information about expandability if you think you’d like to hack on FElt for your own purposes. A user can access FElt’s capabilities through several different interfaces. The three most important are felt, the basic command-line application for solving FE problems given a standard FElt input file, burlap, our powerful, interactive, scripting environment that combines the flexibility of Matlab-like programs with FElt’s finite element know-how and velvet, the full-featured CAD like pre- and post-processor that uses the X Window System for a graphical environment. All three applications use an intuitive, ASCII based syntax for problem definition. This powerful syntax allows you to substitute analytic functions in place of numeric values (sin(60) instead of 0.866025) and even more importantly allows for time-dependent forcing and boundary conditions to be specified as analytic functions of time or in the more traditional fashion as a series of discrete time, magnitude pairs. This feature makes it quite easy to specify a wide range of functions.

### Web

http://felt.sourceforge.net/

### Documentation

http://felt.sourceforge.net/#other_docsl

### Téléchargement

http://sourceforge.net/project/showfiles.php?group_id=2883

### Exemples

http://felt.sourceforge.net/#examplesl

## FEMM

A Windows finite element solver for 2D and axisymmetric magnetic and electrostatic problems with graphical pre- and post-processors.

Fiche PLUME

## FEniCS

The vision of FEniCS is to set a new standard in Computational Mathematical Modeling (CMM), which is the Automation of CMM (ACMM), towards the goals of generality, efficiency, and simplicity, concerning mathematical methodology, implementation, and application.

The basic ingredients for the Automation of CMM are

## FFTW

FFTW is a C subroutine library for computing the discrete Fourier transform (DFT) in one or more dimensions, of arbitrary input size, and of both real and complex data (as well as of even/odd data, i.e. the discrete cosine/sine transforms or DCT/DST). We believe that FFTW, which is free software, should become the FFT library of choice for most applications.

Our benchmarks, performed on on a variety of platforms, show that FFTW’s performance is typically superior to that of other publicly available FFT software, and is even competitive with vendor-tuned codes. In contrast to vendor-tuned codes, however, FFTW’s performance is portable: the same program will perform well on most architectures without modification. Hence the name, “FFTW,” which stands for the somewhat whimsical title of “Fastest Fourier Transform in the West.”

Fiche PLUME

## FLAME

Quote from http://www.cs.utexas.edu/users/flame/overview/#node1l : “When considering the unmanageable complexity of computer systems, Dijkstra recently made the following observations 3:

• (i) When exhaustive testing is impossible -i.e., almost always- our trust can only be based on proof (be it mechanized or not).
• (ii) A program for which it is not clear why we should trust it, is of dubious value.
• (iii) A program should be structured in such a way that the argument for its correctness is feasible and not unnecessarily laborious.
• (iv) Given the proof, deriving a program justified by it, is much easier than, given the program, constructing a proof justifying it.

The core curriculum of any first-rate undergraduate Computer Science department includes at least one course that focuses on the formal derivation and verification of algorithms 4. Many of us in scientific computing may have, at some point in time, hastily dismissed this approach, arguing that this is all very nice for small, simple algorithms, but an academic exercise hardly applicable in “our world.” Since it is often the case that our work involves libraries comprised of hundreds of thousands or even millions of lines of code, the knee-jerk reaction that this approach is much too cumbersome to take seriously is understandable and the momentum of established practices and “traditional wisdom” do little if anything to dissuade one from this line of reasoning. Yet, as the result of our search for superior methods for designing and constructing high-performance parallel linear algebra libraries, we have come to the conclusion that it is only through the systematic approach offered by formal methods that we will be able to deliver reliable, maintainable, flexible, yet highly efficient matrix libraries even in the relatively well-understood area of (sequential and parallel) dense linear algebra. In this paper we attempt to make this case.

While some would immediately draw the conclusion that a change to a more modern programming language like C++ is at least highly desirable, if not a necessary precursor to writing elegant code, the fact is that most applications that call packages like LAPACK 1 and ScaLAPACK 2 are still written in Fortran and/or C. Interfacing such an application with a library written in C++ presents certain complications. However, during the mid-nineties, the Message-Passing Interface (MPI) introduced to the scientific computing community a programming model, object-based programming, that possesses many of the advantages typically associated with the intelligent use of an object-oriented language 6. Using objects (e.g. communicators in MPI) to encapsulate data structures and hide complexity, a much cleaner approach to coding can be achieved. Our own work on the Parallel Linear Algebra Package (PLAPACK) borrowed from this approach in order to hide details of data distribution and data mapping in the realm of parallel linear algebra libraries 7. The primary concept also germane to this paper is that PLAPACK raises the level of abstraction at which one programs so that indexing is essentially removed from the code, allowing the routine to reflect the algorithm as it is naturally presented in a classroom setting. Since our initial work on PLAPACK, we have experimented with similar interfaces in such seemingly disparate contexts as (parallel) out-of-core linear algebra packages and a low-level implementation of the sequential BLAS 5.

FLAME is the latest step in the evolution of these systems. It facilitates the use of a programming style that is equally applicable to everything from out-of-core, parallel systems to single-processor systems where cache-management is of paramount concern.

Over the last seven or eight years it has become apparent that what makes our task of library development more manageable is this systematic approach to deriving algorithms coupled with the abstractions we use to make our code reflect the algorithms thus produced. Further, it is from these experiences that we can confidently state that this approach to programming greatly reduces the complexity of the resultant code and does not sacrifice high performance in order to do so.

Indeed, it is exactly the formal techniques that we may have at one time dismissed as merely academic or impractical which make this possible, as FLAME illustrates.

### Web

http://www.cs.utexas.edu/users/flame

### Exemples

http://www.cs.utexas.edu/users/flame/code/#indexl

### Autres indications

FLAME has interfaces with C, Fortran, Matlab, MPI, Octave, PLAPACK

## Fortran

Fortran is a powerful general-purpose programming language. Other general-purpose programming languages include C and C++.

Documentation:

Questions/Réponses de programmation

### Questions/Réponses

#### Comment exécuter un programme Fortran?

Depuis un terminal Linux :

gfortran programme.f -o programme
./programme

#### Legacy Fortran programs

Fortran 77 programs may not run as expected with recent fortran compilers, because variables are not initialized to zero by default anymore. In the case of gfortran, the old behaviour is obtained by adding -finit-local-zero to the compiling command.

#### Tektronix-type terminals

Graphical programs that rely on Textronix terminal-type commands to draw pictures can use xterm -t to run under Linux.

#### Quel environnement de programmation intégré pour Fortran 95 sous Linux?

Eclipse et Photran ont été testés avec succès sous Linux. Attention: l’installation de Photran nécessite une configuration manuelle des téléchargements d’extensions pour eclipse.

#### Quelle est la correspondance entre la directive Fortran “selected_real_kind” les types C++ float et double?

La définition de cette directive est ici: http://gcc.gnu.org/onlinedocs/gcc-4.7.1/gfortran/SELECTED_005fREAL_005fKIND.html

La relation avec les autres langages: http://stackoverflow.com/questions/838310/fortran-90-kind-parameter

## FreeFEM++-cs

FreeFem++-cs is an integrated development environment for FreeFem++ that aims to provide a user-friendly interface which resembles other popular windowed applications. It follows a client/server design : the client deals with user interaction, the server runs FreeFem++ (hence its name : “cs” as in “Client and Server”).

FreeFem++-cs adds the following extra features to FreeFem++ :

• an integrated interface aimed at making users comfortable,
• a color-coded editor,
• FreeFem++ errors are linked back to the EDP source code,
• an integrated graphics area with a zooming tool.

Auteur : Antoine Le Hyaric (http://www.ljll.math.upmc.fr/lehyaric)

Exemples

Questions/Réponses Sur FreeFem++

### Questions/Réponses

#### Comment ouvrir un script EDP sous MacOS

FreeFem++-cs pour MacOS utilise l’interface X11 comme Linux mais dispose d’une icône supplémentaire (dans la barre des tâches) qui ouvre automatiquement dans FreeFem++-cs tout script EDP qui est glissé/déposé sur cette icône.

#### Si FreeFem++-cs ne fonctionne plus après un changement de version d’Ubuntu

Il faut télécharger la version de FreeFem++-cs qui correspond à chaque nouvelle version d’Ubuntu à http://www.ljll.math.upmc.fr/lehyaric/ffcs/#install.

## FreeFem++

FreeFem++ is an implementation of a language dedicated to the finite element method. It provides you a way to solve Partial Differential Equations (PDE) simply. Problems involving partial differential equations (pde) of several branches of physics such as fluid-structure interactions require interpolations of data on several meshes and their manipulation within one program.

Questions/Réponses Sur FreeFem++

## Free Meshes

Free pre-built meshes available from the web.

## GDB

GDB, the GNU Project debugger, allows you to see what is going on ‘inside’ another program while it executes – or what another program was doing at the moment it crashed.

GDB can do four main kinds of things (plus other things in support of these) to help you catch bugs in the act:

• Start your program, specifying anything that might affect its behavior.
• Make your program stop on specified conditions.
• Examine what has happened, when your program has stopped.
• Change things in your program, so you can experiment with correcting the effects of one bug and go on to learn about another.

The program being debugged can be written in C, C++, Pascal, Objective-C (and many other languages). Those programs might be executing on the same machine as GDB (native) or on another machine (remote). GDB can run on most popular UNIX and Microsoft Windows variants.

## Geomview

Geomview is an interactive 3D viewing program for Unix. It lets you view and manipulate 3D objects: you use the mouse to rotate, translate, zoom in and out, etc. It can be used as a standalone viewer for static objects or as a display engine for other programs which produce dynamically changing geometry. It can display objects described in a variety of file formats. It comes with a wide selection of example objects, and you can create your own objects too.

### Web

http://www.geomview.org/

### Documentation

http://www.geomview.org/docs/

OOGL tutorial : http://www.geomview.org/docs/#oogltourl

### Licence

GNU Lesser General Public License (LGPL)

OOGL, OFF

Rheolef

## Gerris Flow Solver

Gerris is an Open Source Free Software library for the solution of the partial differential equations describing fluid flow. The source code is available free of charge under the Free Software GPL license.

Gerris is supported by NIWA (National Institute of Water and Atmospheric research) and by the Marsden Fund of the Royal Society of New Zealand.

The code is written entirely in C and uses both the GLib Library and the GTS Library for geometrical functions and object-oriented programming.

A brief summary of its main (current) features:

• The same code base is compiled with 2D and 3D support.
• Quadtree-based (Octree in 3D) spatial discretisation with automatic and dynamic local refinement.
• Multigrid Poisson solver.
• Second-order Godunov type advection scheme.
• Solves the time-dependent incompressible variable-density Euler, Stokes or Navier-Stokes equations or the 2D shallow-water and 3D hydrostatic oceanic equations.
• Support for complex solid boundaries (automatic locally-refined mesh generation).
• Semi-implicit multigrid diffusion solver with support for complex boundaries and associated boundary conditions in 2D and 3D.
• Semi-implicit multigrid barotropic solver for the oceanic equations.
• Adaptive mesh refinement: the resolution is adapted dynamically to the features of the flow.
• Flexible and powerful specifications of parameters.
• Flexible object-oriented custom specification of initial and boundary conditions, source terms, outputs etc…
• Portable parallel support using the MPI library.
• Volume of Fluid advection scheme for interfacial flows.

The code is being actively worked on. Future developments include:

• Extension of the shallow-water equations model to atmospheric flows.
• Non-hydrostatic oceanic and anelastic atmospheric flows support.

### Web

http://gfs.sourceforge.net/wiki/index.php/Main_Page

Tutorial

FAQ

Gerris in action

Examples

### Licence

The source code is available free of charge under the Free Software GPL license.

## GetDP

GetDP is a general finite element solver using mixed elements to discretize de Rham-type complexes in one, two and three dimensions. The main feature of GetDP is the closeness between the input data defining discrete problems (written by the user in ASCII data files) and the symbolic mathematical expressions of these problems.

Fiche PLUME

## Getfem++

The Getfem++ project focuses on the development of a generic and efficient C++ library for finite element methods elementary computations. The goal is to provide a library allowing the computation of any elementary matrix (even for mixed finite element methods) on the largest class of methods and elements, and for arbitrary dimension (i.e. not only 2D and 3D problems).

It offers a complete separation between integration methods (exact or approximated), geometric transformations (linear or not) and finite element methods of arbitrary degrees. It can really relieve a more integrated finite element code of technical difficulties of elementary computations.

Examples of available finite element method are : Pk on simplices in arbitrary degrees and dimensions, Qk on parallelepipeds, P1, P2 with bubble functions, Hermite elements, elements with hierarchic basis (for multigrid methods for instance), discontinuous Pk or Qk, XFem, …

The addition of a new finite element method is straightforward. Its description on the reference element must be provided (in most of the cases, this is the description of the basis functions, and nothing more). Extensions are provided for Hermite elements, piecewise polynomial, non-polynomial and vectorial elements, XFem.

The library also includes the usual tools for finite elements such as assembly procedures for classical PDEs, interpolation methods, computation of norms, mesh operations, boundary conditions, post-processing tools such as extraction of slices from a mesh …

Getfem++ can be used to build very general finite elements codes, where the finite elements, integration methods, dimension of the meshes, are just some parameters that can be changed very easily, thus allowing a large spectrum of experimentations. Examples are provided (see the screenshot section).

Getfem++ has no meshing capabilities (apart regular meshes), hence it is necessary to import meshes. Imports formats currently known by getfem are GiD , Gmsh and >EMC2 mesh files.

A particular method allows to interpolate a finite element method on an arbitrary mesh allowing any assembly procedure to work with two different meshes. This is usefull for some mixed finite element methods and for mortar methods with non-matching meshes.

Fiche PLUME

• Format de données standard lus: Gmsh, EMC2
• Autres indications: Matlab interface available.

## GETM

GETM is a 3D numerical model simulating the most important hydrodynamic and thermodynamic processes in natural waters. The model is general in the sense that it can be applied to various systems, scales and specifications. The model includes for example flooding and drying of tidal flats, flexible vertical and horizontal coordinate systems, different turbulence models integrated from GOTM, and is a Public Domain model published under GNU Public Licence.

### Web

http://www.getm.eu

## Gmsh

Gmsh is an automatic 3D finite element mesh generator (primarily Delaunay) with build-in CAD and post-processing facilities. Its primal design goal is to provide a simple meshing tool for academic test cases with parametric input and up to date visualization capabilities. One of its strengths is the ability to respect a characteristic length field for the generation of adapted meshes on lines, surfaces and volumes, and to mix these meshes with simple structured grids.

Gmsh is built around four modules: geometry, mesh, solver and post-processing. The specification of any input to these modules is done either interactively using the graphical user interface or in ASCII text files using Gmsh’s own scripting language.

Fiche PLUME

## GNU Make

Make is a tool which controls the generation of executables and other non-source files of a program from the program’s source files.

Make gets its knowledge of how to build your program from a file called the makefile, which lists each of the non-source files and how to compute it from other files. When you write a program, you should write a makefile for it, so that it is possible to use Make to build and install the program.

### Questions/Réponses

#### How to give a value to a make macro when calling make from the command line?

If MACRO is used inside a makefile, one can give it a value from the command line with

make MACRO=value

## Gnuplot

gnuplot is a command-driven interactive function plotting program. It can be used to plot functions and data points in both two- and three-dimensional plots in many different formats, and will accommodate many of the needs of today’s scientists for graphic data representation. gnuplot is copyrighted, but freely distributable; you don’t have to pay for it.

### Questions/Réponses

#### Comment dessiner une courbe avec comme X et Y les deux colonnes d’un fichier

> gnuplot

G N U P L O T
Version 4.4 patchlevel 0
System: Linux 2.6.39-2-686-pae

Copyright (C) 1986-1993, 1998, 2004, 2007-2010
Thomas Williams, Colin Kelley and many others

gnuplot home:     http://www.gnuplot.info
faq, bugs, etc:   type "help seeking-assistance"
immediate help:   type "help"
plot window:      hit 'h'

Terminal type set to 'wxt'
gnuplot> plot 'resultats.dat' using 1:2 title 'Résultats' with lines
gnuplot> quit

#### Comment dessiner deux courbes sur le même graphe, la première avec les colonnes 1 et 2 du fichier, la deuxième avec les colonnes 1 et 3?

> gnuplot

G N U P L O T
Version 4.4 patchlevel 0
System: Linux 2.6.39-2-686-pae

Copyright (C) 1986-1993, 1998, 2004, 2007-2010
Thomas Williams, Colin Kelley and many others

gnuplot home:     http://www.gnuplot.info
faq, bugs, etc:   type "help seeking-assistance"
immediate help:   type "help"
plot window:      hit 'h'

Terminal type set to 'wxt'
gnuplot> plot 'resultats.dat' using 1:2 title 'Courbe 1' with lines,'resultats.dat' using 1:3 title 'Courbe 2' with lines
gnuplot> quit

#### Comment tracer une droite passant par des points expérimentaux?

f1(x)=a*x+b
a=10;b=10;
fit f1(x) 'data.dat' using 1:2 via a,b

plot "data.dat" using 1:2,a*x+b title 'fit'

pause -1

## GNU Scientific Library

The GNU Scientific Library (GSL) is a numerical library for C and C++ programmers. It is free software under the GNU General Public License.

The library provides a wide range of mathematical routines such as random number generators, special functions and least-squares fitting. There are over 1000 functions in total.

Unlike the licenses of proprietary numerical libraries the license of GSL does not restrict scientific cooperation. It allows you to share your programs freely with others.

### Web

http://www.gnu.org/software/gsl/#gsll

### Documentation

http://www.gnu.org/software/gsl/manual/html_node/

## GNU Triangulated Surface Library

GTS stands for the GNU Triangulated Surface Library. It is an Open Source Free Software Library intended to provide a set of useful functions to deal with 3D surfaces meshed with interconnected triangles. The source code is available free of charge under the Free Software LGPL license.

The code is written entirely in C with an object-oriented approach based mostly on the design of GTK+. Careful attention is paid to performance related issues as the initial goal of GTS is to provide a simple and efficient library to scientists dealing with 3D computational surface meshes.

A brief summary of its main features:

• Simple object-oriented structure giving easy access to topological properties.
• 2D dynamic Delaunay and constrained Delaunay triangulations.
• Robust geometric predicates (orientation, in circle) using fast adaptive floating point arithmetic (adapted from the fine work of Jonathan R. Shewchuk).
• Robust set operations on surfaces (union, intersection, difference).
• Surface refinement and coarsening (multiresolution models).
• Dynamic view-independent continuous level-of-detail.
• Preliminary support for view-dependent level-of-detail.
• Bounding-boxes trees and Kd-trees for efficient point location and collision/intersection detection.
• Graph operations: traversal, graph partitioning.
• Metric operations (area, volume, curvature …).
• Triangle strips generation for fast rendering.

## GOTM

GOTM is the abbreviation for ‘General Ocean Turbulence Model’. It is a one-dimensional water column model for the most important hydrodynamic and thermodynamic processes related to vertical mixing in natural waters. In addition, it has been designed such that it can easily be coupled to 3-D circulation models, and used as a module for the computation of vertical turbulent mixing. The core of the model computes solutions for the one-dimensional versions of the transport equations of momentum, salt and heat. The key component in solving these equations is the model for the turbulent fluxes of these quantities. The strength of GOTM is the vast number of well-tested turbulence models that have been implemented in the code. These models span the range from simple prescribed expressions for the turbulent diffusivities up to complex Reynolds-stress models with several differential transport equations to solve. Even though, evidently, not all turbulence models published in oceanography could be implemented, at least one member of every relevant model family can be found in GOTM: empirical models, energy models, two-equation models, Explicit Algebraic Stress Models (EASM), and K-profile parameterisations (KPP).

### Web

http://www.gotm.net/

## GRUMMP

GRUMMP — Generation and Refinement of Unstructured, Mixed-Element Meshes in Parallel

Goals of the GRUMMP Project

The goal of the GRUMMP project is to develop automatic mesh generation software for unstructured meshes with mixed element types. The software should produce high-quality meshes that meet user-defined mesh density requirements, using elements appropriate for the geometry and physics of a particular problem.

Automatic mesh generation for complex two and three dimensional domains is a topic of intensive research. It is imperative that automatic mesh generation tools be capable of generating quality finite element and finite volume meshes. There must be a balance between resolution of the boundary and surface features and complexity of the problem. In addition, for problems with isotropic physics, element aspect ratio must be small to minimize linear system condition number and interpolation error. On the other hand, problems with anisotropic physics (for example, a shear layer in viscous fluid flow) require highly anisotropic elements for efficient solution. A further level of complication is that for some physical problems and applications, quadrilateral (2D) or hexahedral (3D) elements are preferred, even though filling space with high quality elements is easier using triangular (2D) or tetrahedral (3D) elements.

A general-purpose automatic mesh generator should address all of these issues without excessive user intervention. We envision a system in which common types of physical problems have predefined mesh sizing and element aspect ratio functions, allowing easy generation of meshes for these applications areas. For flexibility and generality, the user will also be able to prescribe these functions (for totally different applications) or modify the predefined behaviors (to provide a quality mesh in the wake of an airplane wing, for example).

GRUMMP addresses these issues by implementing mesh manipulation primitives to generate or modify existing meshes so that criteria for element size and quality are met. In addition, automatic computation of local length scale is performed to provide a default in cases where solution-based adaptive length scales are not available.

### Web

http://tetra.mech.ubc.ca/GRUMMP/

## HDF

WELCOME to the Hierarchical Data Format (HDF) home page at the National Center for Supercomputing Applications.

The HDF project involves the development and support of software and file formats for scientific data management. The HDF software includes I/O libraries and tools for analyzing, visualizing, and converting scientific data. There are two HDF formats, HDF (4.x and previous releases) and HDF5. These formats are completely different and NOT compatible. ( NOTE: There are no plans to drop support for HDF 4.x )

The HDF software is developed and supported by NCSA and is freely available. It is used world-wide in many fields, including Environmental Science, Neutron Scattering, Non-Destructive Testing, and Aerospace, to name a few. Scientific projects that use HDF include NASA’s HDF-EOS project, and the DOE’s Advanced Simulation and Computing Program.

### Documentation

http://www.hdfgroup.org/HDF5/#indexl

## Hypre

The goal of the Scalable Linear Solvers project is to develop scalable algorithms and software for solving large, sparse linear systems of equations on parallel computers. The primary software product is hypre, a library of high performance preconditioners that features parallel multigrid methods for both structured and unstructured grid problems. The problems of interest arise in the simulation codes being developed at LLNL and elsewhere to study physical phenomena in the defense, environmental, energy, and biological sciences.

### Web

http://www.llnl.gov/CASC/linear_solvers/

Reference Manual

### Téléchargement

http://www.llnl.gov/CASC/hypre/#softwarel

## I-DEAS file format

File format of the I-DEAS computer-aided design software package. It can be used in Matlab and libMesh.

## IGES

Products may be designed as either a two-dimensional, three-view drawing layout, or as a full three-dimensional model with associated drawing views and dimensions using a Computer Aided Design (CAD) system. The IGES format serves as a neutral data format to transfer the design to a dissimilar system. Translators, developed to the IGES Standard, are used to export a design into an IGES file for exchange and for importing the IGES file into the destination system.

### Web

http://en.wikipedia.org/wiki/IGES

Salomé

## IML++

IML++ is a C++ templated library of modern iterative methods for solving both symmetric and nonsymmetric linear systems of equations. The algorithms are fully templated in that the same source code works for dense, sparse, and distributed matrices. Some of the numerical methods are presented in the book, Templates: Building Blocks for the Solution of Iterative Systems and include

• Richardson Iteration
• Chebyshev Iteration
• Conjugate Gradient (CG)
• Conjugate Gradient Squared (CGS)
• BiConjugate Gradient (BiCG)
• BiConjugate Gradient Stabilized (BiCGSTAB)
• Generalized Minimum Residual (GMRES)
• Quasi-Minimal Residual Without Lookahead (QMR)

The IML++ software also contains an optional test suite for sparse matrix computations, using SparseLib++.

### Web

http://math.nist.gov/iml++/

## Impact

Impact is an open source finite element program suite which can be used to predict most dynamic events such as car crashes or metal sheet punch operations. They usually involve large deformations and high velocities.

Simulations are made on a virtual three dimensional model which can be created with a pre-processor or with the built-in Fembic language. Results are viewed in a post-processor.

Impact is designed to interface with the included pre- and postprocessor by default, but there are also interfaces available for more advanced pre-and postprocessors such as GiD or Gmsh. Impact also has rudamentary support for Nastran file format.

Development is made by a team of volunteers from all over the world with the aim of creating a clean and compact program which is simple to understand and use.

Impact is licensed under the Gnu Public License which makes it free to use and modify as long as you release and publish your improvements under the same license.

Impact is written in Java which means it can be run on most hardware and operating systems.

### Web

http://impact.sourceforge.net/

## ISAAC

ISAAC (Integrated Solution Algorithm for Arbitrary Configurations) is a compressible Euler/Navier-Stokes computational fluid dynamics code. ISAAC includes the capability of calculating the Euler equations for inviscid flow or the Navier-Stokes equations for viscous flows. ISAAC uses a domain decomposition structure to accomodate complex physical configurations. ISAAC can calculate either steady-state or time dependent flow.

ISAAC was designed to test turbulence models. Various two equation turbulence models, explicit algebraic Reynolds stress models, and full differential Reynolds stress models are implemented in ISAAC. Several test cases are documented in the User’s Guide.

### Web

http://isaac-cfd.sourceforge.net/

### Documentation

http://isaac-cfd.sourceforge.net/man.pdf

## ITPACK

There are four packages in the ITPACK directory for solving large sparse linear systems by iterative methods: ITPACK 2C (single precision), ITPACK 2C (double precision), ITPACKV 2D (a vectorized version of ITPACK 2C for the Cray Y-MP and similar vector computers), and NSPCG. ITPACK 2C and ITPACKV 2D are intended for symmetric and positive-definite matrix problems. NSPCG has preconditioners and polynomial accelerators for nonsymmetric matrix problems as well. Only single precision versions are available for ITPACKV 2D and NSPCG. Machine-dependent constants and the timing function may need to be modified by the user when installing the packages for a particular computer. They are located in routines DFAULT and TIMER in all four packages.

### Web

http://www.netlib.org/itpack/

## jCAE

Features

• simple volumes modeler

• finit elements mesher

• portable on platforms which support Java and Opencascade

• inherit module architecture of Netbeans

### Web

http://jcae.sourceforge.net

### Exemples

http://jcae.sourceforge.net/#screenshotsl

## LAPACK

LAPACK is written in Fortran 77 and provides routines for solving systems of simultaneous linear equations, least-squares solutions of linear systems of equations, eigenvalue problems, and singular value problems. The associated matrix factorizations (LU, Cholesky, QR, SVD, Schur, generalized Schur) are also provided, as are related computations such as reordering of the Schur factorizations and estimating condition numbers. Dense and banded matrices are handled, but not general sparse matrices. In all areas, similar functionality is provided for real and complex matrices, in both single and double precision.

Fiche PLUME

FAQ,

User’s guide

### Autres indications

LAPACK should be used together with an optimized version of the BLAS. For instance, see Atlas.

## LaTeX

LaTeX is a high-quality typesetting system, with features designed for the production of technical and scientific documentation. LaTeX is the de facto standard for the communication and publication of scientific documents.

Fiche PLUME

### Questions/Réponses

#### Graphiques avec TikZ

PGF is a TeX macro package for generating graphics. It is platform- and format-independent and works together with the most important TeX backend drivers, including pdftex and dvips. It comes with a user-friedly syntax layer called TikZ.

https://sourceforge.net/projects/pgf/

#### Comment récupérer les images d’un ancien article dont on ne possède plus que le PDF?

Sous Linux, ouvrir le PDF avec evince, et glisser/déposer les images avec la souris sur le bureau.

Avec kile

#### Comment changer la numérotation des équations

citation de http://www.math.uiuc.edu/~hildebr/tex/#displaysl: By default, LaTeX will number equations consecutively, as (1), (2), etc., assuming you use the automatic equation numbering mechanism. If the paper is very short, or if there are only a few numbered equations, this is fine, but once the numbers get into the twenties and higher, a scheme that numbers equations by section, as in (1.1), (1.2), …, (2.1), etc., is preferable. In fact, for the vast majority of journal articles, the latter is probably the best numbering scheme. To get equations numbered by section, just put the following into the preamble: “ ”. For books, theses, or very long papers, an equation numbering scheme that is three levels deep (with numbers like (4.1.1), etc.) may be appropriate. To get this, just replace “section” above by “subsection”, or the corresponding innermost level. The same mechanism works for other counters, e.g., theorem counters, instead of “equation”.

#### Imprimer un grand poster sur plusieurs feuilles A4 sous Linux

Utiliser PosteRazor.

#### Diminuer la taille d’un PDF pour une moins bonne qualité mais un téléchargement plus facile sur le web

Avec ghostscript:

gs -q -dNOPAUSE -dBATCH -dSAFER -sDEVICE=pdfwrite -dCompatibilityLevel=1.3 -dPDFSETTINGS=/screen \
-dEmbedAllFonts=true -dSubsetFonts=true -dColorImageDownsampleType=/Bicubic -dColorImageResolution=72 \
-dGrayImageDownsampleType=/Bicubic -dGrayImageResolution=72 -dMonoImageDownsampleType=/Bicubic \
-dMonoImageResolution=72 -dNumRenderingThreads=4 -sOutputFile=smalldoc.pdf bigdoc.pdf

#### Graphics with inkscape

inkscape is able to draw vector-based graphics and output them as pdf or postscript to be included in LateX documents.

#### Including .eps graphics in .pdf documents

It is as simple as including:

\usepackage{epstopdf}

On machines where the epstopdf external command is not available to LaTeX, one can also convert eps figures to pdf with:

convert figure.eps figure.pdf

## libMesh

The libMesh library is a C++ framework for the numerical simulation of partial differential equations on serial and parallel platforms. Development began in March 2002 with the intent of providing a friendly interface to a number of high-quality software packages that are currently available. Currently the library supports 2D and 3D steady and transient finite element simulations. PETSc is currently used for the solution of linear systems on both serial and parallel platforms, and LASPack is included with the library to provide linear solver support on serial machines.

The libMesh library is actively developed at The University of Texas at Austin in the CFDLab and at Technische Universität Hamburg-Harburg, Modelling and Computation in Germany. Many thanks to SourceForge for hosting the project. You can find out what is currently happening in the development branch by checking out the CVS Logs online.

A major goal of the library is to provide support for adaptive mesh refinement (AMR) computations in parallel while allowing a research scientist to focus on the physics they are modeling.

## Libtool

GNU libtool is a generic library support script. Libtool hides the complexity of using shared libraries behind a consistent, portable interface.

To use libtool, add the new generic library building commands to your Makefile, Makefile.in, or Makefile.am. See the documentation for details.

### Web

http://www.gnu.org/software/libtool/

### Documentation

http://www.gnu.org/software/libtool/manual

### Licence

GNU Libtool 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.

## Méfisto

Ce logiciel gratuit comprend les modules exécutables à télécharger :

• Un initialisateur de fichiers numériques nécessaires pour les modules suivants: Méfisto-INITIER;
• Un générateur de maillages 2D ou 3D, structurés et/ou non-structurés: Méfisto-MAILLER;
• Un solveur du problème stationnaire ou instationnaire de l’Élasticité linéaire: Méfisto-ELASTICER;
• Un solveur du calcul des modes propres d’un objet 2d ou 3d: Méfisto-ELASTICER;
• Un solveur du problème thermique stationnaire ou instationnaire linéaire ou non linéaire: Méfisto-THERMICER.
• Un solveur du problème de l’équation des ondes planes: Méfisto-THERMICER.
• Un solveur du calcul des plus petites valeurs propres de l’opérateur -div A grad: Méfisto-THERMICER.
• Un solveur du problème de Stokes en 2d avec éléments finis de Taylor-Hood ou Brezzi-Fortin: Méfisto-FLUIDER.

L’utilisation de ces modules est rendue conviviale par l’emploi systèmatique de menus, le recours à la souris, et une représentation graphique des résultats sur l’écran et éventuellement, dans un fichier d’instructions PostScript.

### Auteur(s)

Alain Perronnet (http://www.ljll.math.upmc.fr/perronnet)

## Mélina

Le code MÉLINA est une bibliothèque de procédures pour la résolution de problèmes aux limites gouvernés par des équations aux dérivées partielles par la méthode des éléments finis en dimension 2 ou 3. Il a été développé par D.Martin (Université de RENNES 1) et O.deBayser (SMP, E.N.S.T.A. jusqu’en 1995) dans le cadre des problèmes étudiés au sein du groupe simulation et modélisation des phénomènes de propagation (S.M.P.). Ce code est essentiellement un code de recherche et fournit un ensemble d’outils aisément manipulables pour écrire rapidement des applications pour le traitement numérique de problèmes nouveaux ou/et la mise au point de nouveaux algorithmes.

Fiche PLUME

## Matlab

### Questions/Réponses

#### ssh sur Linux: Attention à TMOUT

Matlab est souvent lancé sur un serveur distant grâce à ssh suivi de la commande “matlab&”. Il est conseillé d’ajouter la commande export TMOUT=0 (TMOUT signifie time-out et représente le temps en secondes après lequel la session est déconnectée) après “ssh” avant “matlab” afin d’éviter toute déconnection automatique avant que le programme matlab soit terminé.

#### Limiter le nombre de coeurs de calcul utilisés par Matlab

Matlab utilise par défaut tous les coeurs disponibles. Pour éviter cela (par exemple quand il y a d’autres utilisateurs sur le même serveur de calcul), il faut utiliser l’option -singleCompThread

matlab -singleCompThread

Les utilisateurs de MatlabMPI ont eux-aussi besoin de cette option car MPI gère lui-même le parallélisme. Il faut donc ajouter -singleCompThread dans le fichier

MatlabMPI/src/MatMPI_Comm_settings.m

et sur la ligne de commande de tous les scripts MatlabMPI.

#### CUDA

Matlab est capable d’utiliser la carte CUDA de la machine. Par exemple:

%  feature('numCores')
n = gpuDeviceCount;
for ii = 1:n
gpuDevice(ii)
end

%Transfer a 10-by-10 matrix of random single-precision values to the GPU, then use the GPU to square each element.

X = rand(10, 'single');
G = gpuArray(X);
isequal(gather(G), X)  % Returns true
classUnderlying(G)     % Returns 'single'
G2 = G .* G            % Uses times method defined for
% GPUArray objects

for ii = 1:gpuDeviceCount
g = gpuDevice(ii);
fprintf(1, 'Device %i has ComputeCapability %s \n', ...
g.Index, g.ComputeCapability)
end

#### Comment lancer une commande Matlab sans fenêtre graphique?

matlab -nodisplay -r commande

Ceci est très utile en conjonction avec nohup ou screen. Voici aussi un exemple de script qsub :

• matlab.qsub
#!/bin/bash
#PBS -q seq
#PBS -N matlab
#PBS -j oe
. /usr/share/modules/init/sh
cd $PBS_O_WORKDIR matlab -nodisplay -r [commande] #### Les principales options de la commande Matlab > matlab -h Usage: matlab [-h|-help] | [-n | -e] [-arch | v=variant | v=arch/variant] [-c licensefile] [-display Xdisplay | -nodisplay] [-nosplash] [-mwvisual visualid] [-debug] [-softwareopengl] [-desktop | -nodesktop | -nojvm] [-jdb [port]] [-r MATLAB_command] [-logfile log] [-Ddebugger [options]] -h|-help - Display arguments. -n - Display final environment variables, arguments, and other diagnostic information. MATLAB is not run. -e - Display ALL the environment variables and their values to standard output. MATLAB is not run. If the exit status is not 0 on return then the variables and values may not be correct. -arch - Start MATLAB assuming architecture arch. v=variant - Start the version of MATLAB found in bin/glnxa64/variant instead of bin/glnxa64. v=arch/variant - Start the version of MATLAB found in bin/arch/variant instead of bin/glnxa64. -c licensefile - Set location of the license file that MATLAB should use. It can have the form port@host or be a colon separated list of license files. The LM_LICENSE_FILE and MLM_LICENSE_FILE environment variables will be ignored. -display Xdisplay - Send X commands to X server display, Xdisplay. -nodisplay - Do not display any X commands. The MATLAB desktop will not be started. However, unless -nojvm is also provided the Java virtual machine will be started. -nosplash - Do not display the splash screen during startup. -mwvisual visualid - The default X visual to use for figure windows. -debug - Provide debugging information especially for X based problems. -desktop - Allow the MATLAB desktop to be started by a process without a controlling terminal. This is usually a required command line argument when attempting to start MATLAB from a window manager menu or desktop icon. -nodesktop - Do not start the MATLAB desktop. Use the current terminal for commands. The Java virtual machine will be started. -nojvm - Shut off all Java support by not starting the Java virtual machine. In particular the MATLAB desktop will not be started. -jdb [port] - Enable remote Java debugging on port (default 4444) -r MATLAB_command - Start MATLAB and execute the MATLAB_command. -logfile log - Make a copy of any output to the command window in file log. This includes all crash reports. -Ddebugger [options] - Start debugger to debug MATLAB. #### Comment inverser une matrice? Pour trouver l’inverse d’une matrice A, il y a plusieurs possibilités en fonction de l’utilisation prévue pour l’inverse: • simple mais très long à calculer: Inv(A) • beaucoup plus rapide si on veut uniquement calculer le produit A^-1*B où B est un vecteur: A\B (utilise la méthode de résolution matricielle par défaut). • pour choisir une méthode de résolution matricielle particulière: appeler la fonction correspondante. Par exemple conjgrad(A,B,1e-8) pour le gradient conjugué. Quelques exemples avec les temps de calcul associés: http://scicomp.stackexchange.com/questions/1001/how-does-the-matlab-backslash-operator-solve-ax-b-for-square-matrices #### Comment calculer les zéros des polynômes de Legendre? Si on définit la fonction suivante dans le fichier leg.m (pour polynômes de Legendre associés à 2 indices n et m): • leg.m function leg = leg(n,m,x) y=legendre(n,x); leg=y(m,:); Alors par exemple un zéro de P^1_3 dans l’intervalle [0.1,0.9] se calcule de la façon suivante: > n=3;m=1;fzero(@(x) leg(n,m,x),[0.1 0.9]) ans = 0.7746 #### Emplacement du compilateur mex Si l’exécutable matlab est dans le chemin suivant : /usr/local/MATLAB/R2012b/bin/matlab Il peut être nécessaire de préciser le chemin complet pour mex. Il est dans le même répertoire : /usr/local/MATLAB/R2012b/bin/mex #### Tester le multithreading Ce petit programme peut utiliser 20 threads simultanées (visibles avec la commande “top”) si Matlab est correctement configuré: • threading.m % Benchmarking Ax = b algebraic system of equations with multithreading n = 8000; % set matrix size M = rand(n); % create random matrix A = M + M'; % create A as a symmetric real matrix x = ones(n,1); % define solution x as unity vector b = A * x; % compute RHS b from A and x display "start" y = A\b; % solves Ay = b; y should equal x ## Matlab MAT-Files (I do not describe the commercial Matlab software here but its file formats, because these are understood by many other programs) MAT-files are double-precision, binary, MATLAB format files. They can be created on one machine and later read by MATLAB on another machine with a different floating-point format, retaining as much accuracy and range as the different formats allow. They can also be manipulated by other programs external to MATLAB. ## Matrix Market Exchange Formats The Matrix Market (MM) exchange formats provide a simple mechanism to facilitate the exchange of matrix data. In particular, the objective has been to define a minimal base ASCII file format which can be very easily explained and parsed, but can easily adapted to applications with a more rigid structure, or extended to related data objects. The MM exchange format for matrices is really a collection of affiliated formats which share design elements. In our initial specification, two matrix formats are defined. ## Maxima Maxima is a system for the manipulation of symbolic and numerical expressions, including differentiation, integration, Taylor series, Laplace transforms, ordinary differential equations, systems of linear equations, and vectors, matrices, and tensors. Maxima produces high precision results by using exact fractions and arbitrarily long floating point representations, and can plot functions and data in two and three dimensions. The Maxima source code can be compiled on many systems, including Windows, Linux, and MacOS X. The source code for all systems and precompiled binaries for Windows and Linux are available at the SourceForge file manager. Maxima is a descendant of Macsyma, the legendary computer algebra system developed in the late 1960s at the Massachusetts Institute of Technology. It is the only system based on that effort still publicly available and with an active user community, thanks to its open source nature. Macsyma was revolutionary in its day, and many later systems, such as Maple and Mathematica, were inspired by it. ### Documentation http://maxima.sourceforge.net ## MayaVi MayaVi is a free, easy to use scientific data visualizer. It is written in Python and uses the amazing Visualization Toolkit (VTK) for the graphics. It provides a GUI written using Tkinter. MayaVi is free and distributed under the conditions of the BSD license. It is also cross platform and should run on any platform where both Python and VTK are available (which is almost any nix, Mac OSX or Windows).*” ### Web http://mayavi.sourceforge.net/ ### Documentation http://mayavi.sourceforge.net/#docsl ### Téléchargement http://mayavi.sourceforge.net/#downloadl ### Exemples http://mayavi.sourceforge.net/screenshots/#indexl ### Licence MayaVi is free and distributed under the conditions of the BSD license ## Mercurial # ## FAQ #### Which diff3 software to use for merging? #### Merging development heads To see the different heads: hg heads To merge two heads: hg merge hg commit -m "commit message" note: hg merge may ask to specify a version reference for each head (with -r version_number) if there is an ambiguity. ### How to view all changes as a graphical tree? To view the tree in a text terminal: hg glog This requires the following lines to be added to the Mercurial configuration file: [extensions] graphlog = ## METIS METIS is a family of programs for partitioning unstructured graphs and hypergraphs and computing fill-reducing orderings of sparse matrices. The underlying algorithms used by METIS are based on the state-of-the-art multilevel paradigm that has been shown to produce high quality results and scale to very large problems. ### Web http://glaros.dtc.umn.edu/gkhome/views/metis/ ## MPI MPI is a library specification for message-passing, proposed as a standard by a broadly based committee of vendors, implementors, and users. Reference: http://www.mcs.anl.gov/mpi/www Voir aussi: BSP. ## MUMPS MUMPS: a MUltifrontal Massively Parallel sparse direct Solver Fiche PLUME ## NAPACK NAPACK is a collection of Fortran subroutines for doing numerical linear algebra and optimization. It may be used to solve linear systems, to estimate the condition number or the norm of a matrix, to compute determinants, to multiply a matrix by a vector, to invert a matrix, to solve least squares problems, to perform unconstrained minimization, to compute eigenvalues, eigenvectors, the singular value decomposition, or the QR decomposition. The package has special routines for general, band, symmetric, indefinite, tridiagonal, upper Hessenberg, and circulant matrices. ### Web http://www.netlib.org/napack/ ## NCO The NetCDF Operators, or NCO, are a suite of programs known as operators. Each operator is a standalone, command line program which is executed at the UNIX (or NT) shell-level like, e.g., ls or mkdir. The operators take NetCDF or HDF4 files as input, then perform a set of operations (e.g., deriving new data, averaging, hyperslabbing, or metadata manipulation) and produce a NetCDF file as output. The operators are primarily designed to aid manipulation and analysis of gridded scientific data. The single command style of NCO allows users to manipulate and analyze files interactively and with simple scripts, avoiding the overhead (and some of the power) of a higher level programming environment. The NCO User’s Guide illustrates their use with examples from the field of climate modeling and analysis. The operators are as general as NetCDF itself: there are no restrictions on the contents of the NetCDF or HDF4 file(s) used as input. The internal routines of NCO are completely dynamic which means that NCO imposes no limit on the number of dimensions, sizes of variables, files etc. NCO is designed to be used both interactively and with large batch jobs. There are plenty of command line (i.e., runtime) options, but the defaults settings are often sufficient for everyday needs. NCO works on AIX, IRIX, Linux, SunOS, Solaris, tru64, UNICOS, and Windows NT. The following operators are thoroughly described in the NCO User’s Guide. Note that the “averagers” are misnamed because they can perform many non-linear operations as well, e.g., total, minimum, maximum, RMS. ### Web http://nco.sourceforge.net/ ## Netgen NETGEN is an automatic 3d tetrahedral mesh generator. It accepts input from constructive solid geometry (CSG) or boundary representation (BRep) from STL file format. The connection to a geometry kernel allows the handling of IGES and STEP files. NETGEN contains modules for mesh optimization and hierarchical mesh refinement. Netgen is open source based on the LGPL license. It is available for Unix/Linux and Windows. Fiche PLUME ### Format de données standard lus ## NGSolve NGSolve is a general purpose 3D finite element solver. Version 1.x supports scalar (heat flow), elasticity and magnetic field problems. The package provides C++ source code such that more advanced problem solvers can be built around it. NGSolve performs adaptive mesh refinement, the matrix equations are solved by optimal order multigrid methods. ## NIST Sparse BLAS This page contains software for various libaries developed at NIST for the Sparse Basic Linear Algebra Subprograms (BLAS), which describes kernels operations for sparse vectors and matrices. The current distribution adheres to the ANSI C interface of the BLAS Technical Forum Standard. Older libraries corresponding to previous designs are also included for archival and historical purposes. ### Web http://math.nist.gov/spblas ### Documentation BLAS Technical Forum Standard ## nohup exécute une commande en la rendant insensible aux déconnexions et stocke les résultats dans le fichier nohup.out : nohup <programme> & nohup FreeFem++-nw <programme>.edp & nohup matlab -nodisplay -r commande & nohup scilab -nw -f <programme>.sce & ### Interrompre un calcul lancé avec nohup Les calculs lancés en tâche de fond ne peuvent pas être stoppés avec Control-C. Il faut utiliser les commandes kill ou killall. Exemple : stopper les calculs Matlab en cours sur gpu1: killall MATLAB (NB: ceci n’a aucun effet sur les calculs Matlab lancés par les autres utilisateurs de la machine) Pour interrompre un calcul précis, il faut connaître son identifiant (numéro compris entre 1 et 65536), avec la commande : top (L’identifiant se trouve dans la colonne de droite). Pour stopper un calcul : kill <identifiant> ## NSC2KE NSC2KE est un solveur Volumes-Finis-Galerkin pour le calcul d’écoulements 2D et axisymetriques utilisant des maillages non-structurés. Pour résoudre la partie Euler des equations, le flux de Roe, de Osher et un flux cinetique sont disponibles. Pour le calcul d’écoulements turbulents un modéle k-epsilon est disponible. La modélisation à bas nombre de Reynolds s’effectue soit par une technique bi-couche, soit à travers des lois de paroi. L’utilisation d’un shéma Runge-Kutta à 4 pas permet aussi la résolution de problèmes instationnaires. http://www.abbesazzi.com/nsc2ke-2 contient une présentation du logiciel et le code source. NSC2KE utilise les maillages générés par Bamg ou EMC2. ## NumPy NumPy is the fundamental package for scientific computing with Python. ### Web http://www.numpy.org ## Octave GNU Octave is a high-level language, primarily intended for numerical computations. It provides a convenient command line interface for solving linear and nonlinear problems numerically, and for performing other numerical experiments using a language that is mostly compatible with Matlab. It may also be used as a batch-oriented language. Octave has extensive tools for solving common numerical linear algebra problems, finding the roots of nonlinear equations, integrating ordinary functions, manipulating polynomials, and integrating ordinary differential and differential-algebraic equations. It is easily extensible and customizable via user-defined functions written in Octave’s own language, or using dynamically loaded modules written in C++, C, Fortran, or other languages. Fiche PLUME ### Documentation http://www.octave.org/doc/interpreter/ ### Informations sur les formats de données Gnuplot is used for plotting. ## OFELI OFELI (Object Finite Element LIbrary) is an object oriented library of C++ classes for development of finite element codes. Its main features are : • Various storage schemes of matrices (dense, sparse, skyline, tridiagonal). • Direct methods and preconditioned iterative strategies for the solution of linear systems of equations. • Shape functions of most “popular” finite elements • Element arrays of most popular problems (Heat Transfer, Fluid Flow, Solid Mechanics, Electromagnetics, …). The OFELI package is not only a library of classes for Finite Element developments. The package contains in addition : • A guided tutorial to learn how to use and develop finite element codes using the library • More elaborated codes for various types of problems • An extensive documentation in PDF and HTML formats • Utility programs to convert mesh and output files and to generate simple meshes ### Web http://ofeli.sourceforge.net/ ### Licence GPL ## OFF This format, called OFF (for Object File Format), is general, flexible, and extensible. It supports ASCII text versions of objects for the purpose of interchange, and binary versions for efficiency of reading and writing. ### Documentation ### Logiciels capables de lire ce format Geomview ### Logiciels capables d’écrire dans ce format ADMesh ## OOFEM OOFEM is free finite element code with object oriented architecture for solving mechanical, transport and fluid mechanics problems that operates on various platforms. The aim of this project is to develop efficient and robust tool for FEM computations as well as to provide modular and extensible environment for future development. ### Web http://www.oofem.org/ ### Documentation http://www.oofem.org/en/documentation/#manuall ### Téléchargement http://www.oofem.org/en/download/#downloadl ### Exemples http://www.oofem.org/en/gallery/#galleryl ### Licence http://www.oofem.org/en/license/#licensel ## OpenDX OpenDX gives you new control over your data…and new insights into their meaning. Yet OpenDX is easy to use because it lets you visualize data in ways you’ve never dreamed of–without getting bogged down in the technology. As its name implies, OpenDX is Open Source. The license allows you to freely create, distribute, and develop visualization solutions as you see fit. OpenDX is a uniquely powerful, full-featured software package for the visualization of scientific, engineering and analytical data: Its open system design is built on a standard interface environments. And its sophisticated data model provides users with great flexibility in creating visualizations. With OpenDX, you can create the visualizations you want to create. OpenDX has been designed to be the place where the art of science and the science of visualization come together. It’s the place where they’re combined into one powerful, flexible framework that lets you “Simply Visualize.” ## Open Dynamics Engine ODE is an open source, high performance library for simulating rigid body dynamics. It is fully featured, stable, mature and platform independent with an easy to use C/C++ API. It has advanced joint types and integrated collision detection with friction. ODE is useful for simulating vehicles, objects in virtual reality environments and virtual creatures. It is currently used in many computer games, 3D authoring tools and simulation tools. ### Web http://www.ode.org ## OpenFEM OpenFEM is a finite element toolbox designed to be used within a matrix computing environment. It is available for both Matlab and Scilab. So far, OpenFEM has been jointly developed by INRIA and SDTools, based on the existing software packages Modulef and SDT (Structural Dynamics Toolbox). External contributions are strongly encouraged for the forthcoming versions in order to enlarge and improve the toolbox. ## OpenFOAM The OpenFOAM (Open Field Operation and Manipulation) CFD Toolbox can simulate anything from complex fluid flows involving chemical reactions, turbulence and heat transfer, to solid dynamics, electromagnetics and the pricing of financial options. The core technology of OpenFOAM is a flexible set of efficient C++ modules. These are used to build a wealth of: solvers, to simulate specific problems in engineering mechanics; utilities, to perform pre- and post-processing tasks ranging from simple data manipulations to visualisation and mesh processing; libraries, to create toolboxes that are accessible to the solvers/utilities, such as libraries of physical models. OpenFOAM is supplied with numerous pre-configured solvers, utilities and libraries and so can be used like any typical simulation package. However, it is open, not only in terms of source code, but also in its structure and hierarchical design, so that its solvers, utilities and libraries are fully extensible. OpenFOAM uses finite volume numerics to solve systems of partial differential equations ascribed on any 3D unstructured mesh of polyhedral cells. The fluid flow solvers are developed within a robust, implicit, pressure-velocity, iterative solution framework, although alternative techniques are applied to other continuum mechanics solvers. Domain decomposition parallelism is fundamental to the design of OpenFOAM and integrated at a low level so that solvers can generally be developed without the need for any ‘parallel-specific’ coding. ### Web http://www.opencfd.co.uk ## OpenMP OpenMP is a specification for a set of compiler directives, library routines, and environment variables that can be used to specify shared memory parallelism in Fortran and C/C++ programs. ## OpenSees […] OpenSees, a software framework for developing applications to simulate the performance of structural and geotechnical systems subjected to earthquakes. The goal of the OpenSees development is to improve the modeling and computational simulation in earthquake engineering through open-souce development. ### Web http://opensees.berkeley.edu/ ## ParaView Welcome to ParaView, an application designed with the need to visualize large data sets in mind. The goals of the ParaView project include the following: • Develop an open-source, multi-platform visualization application. • Support distributed computation models to process large data sets. • Create an open, flexible, and intuitive user interface. • Develop an extensible architecture based on open standards. ParaView runs on distributed and shared memory parallel as well as single processor systems and has been succesfully tested on Windows, Linux and various Unix workstations and clusters. Under the hood, ParaView uses the Visualization Toolkit as the data processing and rendering engine and has a user interface written using a unique blend of Tcl/Tk and C++. Fiche PLUME ### Questions/Réponses #### Comment relire un fichier de données VTK en dehors de Paraview? Avec l’interface Python/VTK dont de nombreux exemples sont à http://www.vtk.org/Wiki/VTK/Examples/Python #### Comment sauvegarder une image? Menu “File/Save Screenshot…” #### Comment changer le titre de la barre de couleurs? Cliquer sur l’icône “Edit Color Map” qui se situe à côté de l’outil de barre des couleurs. #### Comment changer les couleurs par défaut? Menu “Edit/Settings…/Colors” ## PARI/GP “* PARI/GP is a widely used computer algebra system designed for fast computations in number theory (factorizations, algebraic number theory, elliptic curves…), but also contains a large number of other useful functions to compute with mathematical entities such as matrices, polynomials, power series, algebraic numbers etc., and a lot of transcendental functions. PARI is also available as a C library to allow for faster computations.*” Fiche PLUME ### Documentation http://pari.math.u-bordeaux.fr/#docl ## pARMS pARMS: parallel Algebraic Recursive Multilevel Solvers pARMS is a library of parallel solvers for distributed sparse linear systems of equations. It is based on a preconditioned Krylov subspace approach, using a domain decomposition viewpoint. It offers a large selection of preconditioners for distributed sparse linear systems and a few of the best known accelerators. The basic methodology used relies on a Recursive Multi-level ILU factorization wich allows to develop many of the standard domain-decomposition type iterative solvers in a single framework. For example, the standard Schwarz procedures are included as are a number of Schur complement techniques. ### Web http://www-users.cs.umn.edu/~saad/software/pARMS/ ## PBLAS Parallel Basic Linear Algebra Subprograms (PBLAS) ### Web http://www.netlib.org/scalapack/#pblas_qrefl ## Perl Perl is a general-purpose scripting language, like Tcl/Tk and Python. ### Documentation Initiation : http://www.comp.leeds.ac.uk/Perl/#startl Référence : http://www.perl.com/pub/q/documentation Opérateurs de test sur les fichiers : http://www.cs.cf.ac.uk/Dave/PERL/#node69l ### Questions/Réponses #### Comment extraire les informations importantes dans un nom de fichier Voici par exemple un fichier dont le nom contient une valeur de vitesse. L’emplacement des parenthèses dans l’expression régulière permet d’isoler l’information importante : > echo resultats_v=2.txt|perl -e 'while(<>){/resultats_v=(.*)\.txt/;print "$1\n";}'
2

Un autre exemple avec plusieurs informations à extraire :

> echo resultats_v=2_c=3.txt|perl -e 'while(<>){/resultats_v=(.*)_c=(.*)\.txt/;print "v=$1 c=$2\n";}'
v=2 c=3

## PETSc

“*PETSc, the Portable, Extensible Toolkit for Scientific computation, provides sets of tools for the parallel (as well as serial), numerical solution of PDEs that require solving large-scale, sparse nonlinear systems of equations. PETSc includes nonlinear and linear equation solvers that employ a variety of Newton techniques and Krylov subspace methods. PETSc provides several parallel sparse matrix formats, including compressed row, block compressed row, and block diagonal storage.

PETSc is fully usable from Fortran, C and C++, and is portable, running on most UNIX systems. PETSc uses MPI for all parallel communication.*”

Fiche PLUME

## PLAPACK

Coding parallel algorithms is generally regarded as a formidable task. To make this task manageable in the arena of linear algebra algorithms, we have developed the Parallel Linear Algebra Package (PLAPACK), an infrastructure for coding such algorithms at a high level of abstraction. It is often believed that by raising the level of abstraction in this fashion, performance is sacrificed. Throughout, we have maintained that indeed there is a performance penalty, but that by coding at a higher level of abstraction, more sophisticated algorithms can be implemented, which allows high levels of performance to be regained. In this paper, we show this to indeed be the case for the parallel solver package implemented using PLAPACK, which includes Cholesky, LU, and QR factorization based solvers for symmetric positive definite, general, and overdetermined systems of equations, respectively. Performance comparison with ScaLAPACK shows better performance is attained by our solvers.

### Web

http://www.cs.utexas.edu/users/plapack/

### Exemples

http://www.cs.utexas.edu/users/plapack/Code

## Plotmtv

The application plotmtv is a fast multi-purpose plotting program for visualization of scientific data in an X11-window environment. Each plot comes with a simple but functional Graphical User Interface which allows users to zoom in or pan to areas of interest on the plot or to toggle between 2D and 3D plots.

## POOMA

POOMA is a high-performance C++ toolkit for parallel scientific computation. POOMA’s object-oriented design facilitates rapid application development. POOMA has been optimized to take full advantage of massively parallel machines. POOMA is available free of charge in order to facilitate its use in both industrial and research environments.

### Web

http://www.nongnu.org/freepooma/

### Licence

FreePOOMA is free software; you can redistribute it and/or modify it under the terms of the Expat license. See LICENSE, LICENSE.pooma and LICENSE.pete for more information.

## Povray

The Persistence of Vision Raytracer is a high-quality, totally free tool for creating stunning three-dimensional graphics. It is available in official versions for Windows, Mac OS/Mac OS X and i86 Linux. The source code is available for those wanting to do their own ports.

## PRIMME

PRIMME (PReconditioned Iterative MultiMethod Eigensolver)

• PRIMME is a C library to find a number of eigenvalues and their corresponding eigenvectors of a Real Symmetric, or Complex Hermitian matrix A.
• Preconditioning and finding largest, smallest or interior eigenvalues is supported.
• PRIMME is a multimethod eigensolver. Based on Davidson/Jacobi-Davidson main iteration, it can transform to most known preconditioned eigensolvers, by the appropriate choice of parameters. Two of the choices, GD+1 and JDQMR, have proved nearly optimal eigensolvers (see 1,2). For user friendliness it provides the following predefined choices of methods.

### Web

http://www.cs.wm.edu/~andreas/software

### Licence

Available under the Lesser GPL license

## PRISM

The goal of the PRISM (Parallel Research on Invariant Subspace Methods) project is to develop infrastructure and algorithms for the parallel solution of eigenvalue problems. We are currently investigating a complete eigensolver based on the Invariant Subspace Decomposition Algorithm for dense symmetric matrices (SYISDA).

### Web

http://www-unix.mcs.anl.gov/prism/

### Documentation

Users’ Guide

Historically, hardware vendors have implemented their own proprietary versions of threads. These implementations differed substantially from each other making it difficult for programmers to develop portable threaded applications.

In order to take full advantage of the capabilities provided by threads, a standardized programming interface was required. For UNIX systems, this interface has been specified by the IEEE POSIX 1003.1c standard (1995). Implementations which adhere to this standard are referred to as POSIX threads, or Pthreads. Most hardware vendors now offer Pthreads in addition to their proprietary API’s.

Pthreads are defined as a set of C language programming types and procedure calls, implemented with a pthread.h header/include file and a thread library - though the this library may be part of another library, such as libc.

There are several drafts of the POSIX threads standard. It is important to be aware of the draft number of a given implementation, because there are differences between drafts that can cause problems.

## Python

Python is a general-purpose scripting language, like Tcl/Tk and Perl.

### Questions/Réponses

Le multithreading est activé par “import threading”. Voir aussi http://docs.python.org/library/#threadingl#module-threading pour la liste des commandes et objets disponibles.

## Commande de soumission de travaux “qsub”

### Questions/Réponses

#### Comment assurer qu’un script soumis à qsub va être exécuté dans le répertoire où il a été soumis?

Par défault, un script est exécuté dans un répertoire temporaire différent du répertoire où il a été soumis. Pour changer ce comportement, ajouter au début du script:

mpirun -np $NCPUS ... ## Questions/Réponses sur les langages compilés ### Comment observer une fuite de mémoire? Les fuites de mémoires arrivent le plus souvent quand tous les malloc() ne sont pas suivis par un free(). On observe, soit dans le Gestionnaire des tâches Windows ou MacOS, soit avec l’utilitaire Unix “top”, que le programme demande de plus en plus de RAM. S’il en demande trop, l’ordinateur peut bloquer. Dans l’exemple ci-dessous avec top, c’est la colonne “VIRT” (comme mémoire virtuelle) qui augmente avec le temps: top - 10:25:38 up 5 days, 13 min, 10 users, load average: 0,64, 0,51, 0,59 Tasks: 224 total, 1 running, 223 sleeping, 0 stopped, 0 zombie %Cpu(s): 4,0 us, 2,8 sy, 0,0 ni, 92,7 id, 0,4 wa, 0,0 hi, 0,0 si, 0,0 st KiB Mem: 8195840 total, 7593824 used, 602016 free, 758696 buffers KiB Swap: 16777212 total, 284 used, 16776928 free, 2089788 cached PID USER PR NI VIRT RES SHR S %CPU %MEM TIME+ COMMAND 14945 root 20 0 527m 297m 92m S 19,1 3,7 216:05.06 Xorg 1 root 20 0 10636 760 648 S 0,0 0,0 0:05.24 init 2 root 20 0 0 0 0 S 0,0 0,0 0:00.26 kthreadd 3 root 20 0 0 0 0 S 0,0 0,0 0:06.51 ksoftirqd/0 6 root rt 0 0 0 0 S 0,0 0,0 0:00.00 migration/0 7 root rt 0 0 0 0 S 0,0 0,0 0:01.01 watchdog/0 8 root rt 0 0 0 0 S 0,0 0,0 0:00.00 migration/1 10 root 20 0 0 0 0 S 0,0 0,0 0:06.20 ksoftirqd/1 12 root rt 0 0 0 0 S 0,0 0,0 0:00.73 watchdog/1 13 root rt 0 0 0 0 S 0,0 0,0 0:00.00 migration/2 15 root 20 0 0 0 0 S 0,0 0,0 0:06.32 ksoftirqd/2 16 root rt 0 0 0 0 S 0,0 0,0 0:00.94 watchdog/2 17 root rt 0 0 0 0 S 0,0 0,0 0:00.00 migration/3 19 root 20 0 0 0 0 S 0,0 0,0 0:06.56 ksoftirqd/3 20 root rt 0 0 0 0 S 0,0 0,0 0:00.68 watchdog/3 21 root 0 -20 0 0 0 S 0,0 0,0 0:00.00 cpuset 22 root 0 -20 0 0 0 S 0,0 0,0 0:00.00 khelper 23 root 20 0 0 0 0 S 0,0 0,0 0:00.00 kdevtmpfs 24 root 0 -20 0 0 0 S 0,0 0,0 0:00.00 netns  ### Comment écrire des lignes différentes pour Windows, MacOS et Linux dans le même programme C? #ifdef __linux__ ...lignes valables uniquement sous linux... #endif #ifdef WIN32 ...lignes valables uniquement sous Windows... #endif #ifdef __APPLE__ ...lignes valables uniquement sous MacOS... #endif ### How to check what symbols a compiled object contains? On linux-type systems, use nm. T shows defined symbols, U shows undefined ones. eg: > nm prettyedp-env.o U _Unwind_Resume 0000000000000000 T _Z12getoneenvvarSs 00000000000003dc T _Z12readabledatev U _Z7loggingbSs U _Z7pathsepv 00000000000000b2 T _Z9envchangeSsSsbb U _ZNKSs5c_strEv U _ZNKSs7compareEPKc U _ZNSaIcEC1Ev U _ZNSaIcED1Ev U _ZNSs6appendEPKc U _ZNSs6appendERKSs U _ZNSsC1EPKcRKSaIcE U _ZNSsC1ERKSs U _ZNSsD1Ev U _ZNSsaSEPKc U _ZNSsaSERKSs 0000000000000000 W _ZSteqIcSt11char_traitsIcESaIcEEbRKSbIT_T0_T1_EPKS3_ 0000000000000000 W _ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_PKS3_ 0000000000000000 W _ZStplIcSt11char_traitsIcESaIcEESbIT_T0_T1_ERKS6_S8_ 0000000000000030 r _ZZL18__gthread_active_pvE20__gthread_active_ptr U __gxx_personality_v0 U getenv U localtime w pthread_cancel U setenv U strftime U time ### How to deal with a “segmentation fault” in a compiled program? The source for the program is needed. First try to locate where this error appears. This is done by adding -g when compiling and running the code through gdb. If there is no programming error at the location where the error occurs, it can be the consequence of an earlier error (memory errors may not be detected immediately). If this is the case then valgrind may be able to detect where the first error occurred: > valgrind ./prettyedp ==7341== Memcheck, a memory error detector ==7341== Copyright (C) 2002-2011, and GNU GPL'd, by Julian Seward et al. ==7341== Using Valgrind-3.7.0 and LibVEX; rerun with -h for copyright info ==7341== Command: ./prettyedp ==7341== * prettyedp: error: please specify a file ==7341== ==7341== HEAP SUMMARY: ==7341== in use at exit: 85,096 bytes in 2,008 blocks ==7341== total heap usage: 2,106 allocs, 98 frees, 114,551 bytes allocated ==7341== ==7341== LEAK SUMMARY: ==7341== definitely lost: 0 bytes in 0 blocks ==7341== indirectly lost: 0 bytes in 0 blocks ==7341== possibly lost: 33,608 bytes in 998 blocks ==7341== still reachable: 51,488 bytes in 1,010 blocks ==7341== suppressed: 0 bytes in 0 blocks ==7341== Rerun with --leak-check=full to see details of leaked memory ==7341== ==7341== For counts of detected and suppressed errors, rerun with: -v ==7341== ERROR SUMMARY: 0 errors from 0 contexts (suppressed: 4 from 4) ## Questions/Réponses sur FreeFem++ ### Numérotation des maillages Les fichiers maillage .mesh lu à la fois par Medit et par FreeFem++ ne sont pas gérés de la même façon dans les deux logiciels. Medit affiche des numéros d’éléments (point, triangle) commençant au numéro 1 (comme le fichier) tandis que FreeFem++ commence la numérotation à zéro, ce qui décale tous les numéros de 1. ### Solveur par défaut pour les problèmes 3D Les problèmes 3D occupent rapidement toute la RAM d’une machine moyenne (2 Goctets ou plus). UMFPACK, le solveur par défault de FreeFem++, n’est pas le bon choix dans ce cas car il demande lui-aussi une portion équivalente de la mémoire. Il vaut mieux utiliser un solveur plus lent mais peu gourmand en mémoire (CG ou GMRES si la matrice le permet, ou alors un solveur parallèle intégré à FreeFem++ comme MUMPS). ### Fichiers de données en format binaire Le format binaire peut diminuer la taille des fichiers de données numériques produits par FreeFem++ par un facteur 2 environ. Ce n’est pas forcément mieux que la compression avec un utilitaire comme zip. Actuellement le plus simple pour produire un fichier binaire est d’utiliser le C++. Voici un exemple où le fichier à traduire contient un vecteur : la première ligne contient la taille du vecteur, les lignes suivantes ses coordonnées. #include <stdio.h> #include <iostream> #include <fstream> using namespace std; int main(int argc,char *argv[]){ // Paramètres de la ligne de commande if(argc!=3){ cout<<"./asc2bin in out"<<endl; return 1; } ifstream i(argv[1],ifstream::in); if(!i){ cout<<"problème avec le fichier d'entrée"<<endl; return 1; } FILE *o=fopen(argv[2],"w"); if(!o){ cout<<"problème avec le fichier de sortie"<<endl; return 1; } // lit et réécrit le nombre d'éléments du vecteur int n; i>>n; cout<<n<<" elements"<<endl; fwrite(&n,sizeof(int),1,o); // lit et réécrit les composantes du vecteur for(int j=0;j<n;j++){ double d; i>>d; fwrite(&d,sizeof(double),1,o); } // ferme tous les fichiers i.close(); fclose(o); return 0; } ### Différences entre vecteurs et tableaux FreeFem++ Si les vecteurs uh et vh sont définis par fespace Vh(Th,P13d); Vh uh,vh; alors uh = randreal1(); vh = randreal1(); interpole la valeur donnée par la fonction randreal1() sur le maillage. La fonction est appelée autant de fois qu’il y a de points d’intégration. Tandis que vh[] = randreal1(); uh[] = randreal1(); initialise les tableaux avec une valeur constante donnée par un appel unique à randreal1(). ### Validation d’un problème 2D avec des résultats numériques 1D déjà connus Il peut être utile dans certains cas que la description 2D contenue dans un script FreeFem++ donne les mêmes résultats numériques qu’un cas-test 1D déjà validé. Pour cela il suffit de configurer le domaine 2D comme une bande rectangulaire dont les côtés obéissent à une condition aux limites périodique. For more information on how to specify a periodic boundary condition, see the fespace keyword. ### A quel moment FreeFem++ effectue-t-il les calculs correspondant à “matrix A=f(…,solver=…)” et “x=A^-1*b”? • cas de CG et GMRES : la résolution itérative a lieu au moment du calcul de x. • cas de UMFPACK : c’est une méthode de résolution directe. La décomposition LU a lieu lors de la définition de A (par un appel à umfpack_di_numeric() dans le fichier C++ ff/src/fflib/UMFPack_Solver.cpp). Le calcul de x exploite les matrices triangulaires L et U calculées auparavant. • autres solveurs : il faut rechercher l’implémentation correspondante de la classe abstraite MatriceMorse::VirtualSolver dans le répertoire src/solver du source C++ de FreeFem++. ### Comment fixer une échelle constante sur plusieurs images successives? (par exemple pour créer un film) Utiliser plot(nbiso=…,viso=…). Par exemple : // maillage simple pour l'exemple mesh M=square(10,10); fespace Vh(M,P1); Vh xh=x; // liste d'isovaleurs constantes d'une image à l'autre int ni=4; real[int] vi(4); vi[0]=0; vi[1]=1; vi[2]=2; vi[3]=3; // première image plot(xh,value=1,nbiso=ni,viso=vi); // deuxième image avec des valeurs deux fois plus grandes mais la même échelle xh=2*x; plot(xh,value=1,nbiso=ni,viso=vi); ### Comment changer les couleurs d’un graphique? utiliser plot(…,hsv=[…],…), comme dans l’exemple suivant (examples++-tutorial/plot.edp): • couleurs.edp int n=20,nn=n+10; real[int] xx(nn),yy(nn); // \url{from: http://en.wikipedia.org/wiki/HSV_color_space} //The HSV (Hue, Saturation, Value) model, // defines a color space in terms of three constituent components: // //HSV color space as a color wheel //Hue, the color type (such as red, blue, or yellow): // Ranges from 0-360 (but normalized to 0-100% h ere) // Saturation, the "vibrancy" of the color: Ranges from 0-100% // The lower the saturation of a color, the more "grayness" is present // and the more faded the color will appear. // Value, the brightness of the color: // Ranges from 0-100% // real[int] colorhsv=[ // color hsv model 4./6., 1 , 0.5, // dark blue 4./6., 1 , 1, // blue 5./6., 1 , 1, // magenta 1, 1. , 1, // red 1, 0.5 , 1 // light red ]; mesh Th=square(5,5); fespace Vh(Th,P2); Vh uh=x*x+y*y,vh=-y^2+x^2; assert(n+1 < nn); // compute a cut for (int i=0;i<=n;i++) { xx[i]=i; yy[i]=uh(real(i)/n,real(i)/n); // value of uh at point (i/10. , i/10.) } plot(Th,uh,[uh,vh],value=true,ps="three.eps",wait=true); // plot mesh, isovalue, and vector // zoom on box defined by the two corner points [0.1,0.2] and [0.5,0.6] plot(uh,[uh,vh],bb=[[0.1,0.2],[0.5,0.6]],wait=true,grey=1,fill=1,value=1,ps="threeg.eps"); // in grey with filling plot([xx(0:n),yy(0:n)],[xx(0:n:5),yy(0:n:5)],ps="likegnu.eps",wait=true); // like gnuplot plot a cut of uh real[int] viso(31); for (int i=0;i<viso.n;i++) viso[i]=i*0.1; plot(uh,viso=viso(0:viso.n-1),value=1,fill=1,wait=1,hsv=colorhsv,ps="threehsv.eps"); ### Comment sauvegarder les graphiques 3D sous forme de fichiers images PNG ou JPEG? Utiliser FreeFem++-cs. ### Comment connaître les différents numéros d’un même point dans plusieurs maillages superposés? Grâce à l’interpolation entre les deux maillages: • renumerotation.edp // petit maillage m sous-ensemble du grand maillage M mesh M=square(10,10); cout<<"nombre de points dans M="<<M.nv<<endl; mesh m=trunc(M,x<.5); cout<<"nombre de points dans m="<<m.nv<<endl; // matrices d'interpolation entre maillages fespace EM(M,P1); fespace Em(m,P1); matrix m2M=interpolate(EM,Em); matrix M2m=interpolate(Em,EM); // vecteur representant les numeros des points dans le petit maillage real[int] nm(m.nv); nm=0:(m.nv-1); // vecteur du grand maillage contenant les numeros des memes points // dans le petit maillage real[int] nM(M.nv); nM=m2M*nm; // verification // ------------ // choisit un point dans le grand maillage int n=35; cout<<"numero dans le grand maillage="<<n<<endl; EM F=0; F[][n]=1; plot(F,cmm="F"); // affiche le meme point dans le petit maillage par interpolation Em f=0; f[]=M2m*F[]; plot(f,cmm="interpolate"); // affiche le meme point dans le petit maillage par renumerotation f=0; cout<<"numero dans le petit maillage="<<nM(n)<<endl; f[][nM(n)]=1; plot(f,cmm="renumerotation"); ### Comment trouver la matrice élémentaire sur un élément d’un maillage? Voici une méthode impliquant un maillage “élémentaire” contenant un seul élément: • element.edp // petit maillage m sous-ensemble du grand maillage M // m = maillage avec un seul élément (numéro 55 choisi au hasard) mesh M=square(10,10); mesh m=trunc(M,M(x,y).nuTriangle==55); cout<<"nombre de points dans M="<<M.nv<<endl; cout<<"nombre de points dans m="<<m.nv<<endl; // matrices d'interpolation entre maillages fespace EM(M,P1); fespace Em(m,P1); matrix m2M=interpolate(EM,Em); matrix M2m=interpolate(Em,EM); // vecteur representant les numeros des points dans le grand maillage real[int] nM(M.nv); nM=0:(M.nv-1); // vecteur du petit maillage contenant les numeros des memes points // dans le grand maillage real[int] nm(m.nv); nm=M2m*nM; // Affiche les numéros des points du petit maillage dans le grand maillage cout<<"numeros des points = "; int p; for(p=0;p<m.nv;p++)cout<<nm(p)<<" "; cout<<endl; // affiche les points du petit maillage dans le grand maillage pour vérifier // qu'ils constituent bien un triangle EM F; for(p=0;p<m.nv;p++){F[][nm(p)]=1;} plot(F,cmm="verification"); La matrice élémentaire peut ensuite être obtenue en appliquant le problème global au petit maillage. ### Comment créer une échelle de couleurs monochrome rouge ou verte? Voici l’exemple examples++-tutorial/plot.edp avec une échelle monochrome rouge. Pour une échelle verte, remplacer la première coordonnée de chaque couleur (hue) par 0.33. • plot.edp int n=20,nn=n+10; real[int] xx(nn),yy(nn); // \url{from: http://en.wikipedia.org/wiki/HSV_color_space} //The HSV (Hue, Saturation, Value) model, // defines a color space in terms of three constituent components: // //HSV color space as a color wheel //Hue, the color type (such as red, blue, or yellow): // Ranges from 0-360 (but normalized to 0-100% h ere) // Saturation, the "vibrancy" of the color: Ranges from 0-100% // The lower the saturation of a color, the more "grayness" is present // and the more faded the color will appear. // Value, the brightness of the color: // Ranges from 0-100% // real[int] colorhsv=[ // color hsv model 1, 1, 0, 1, 1, 0.25, 1, 1, 0.5, 1, 1, 0.75, 1, 1, 1 ]; mesh Th=square(5,5); fespace Vh(Th,P2); Vh uh=x*x+y*y,vh=-y^2+x^2; assert(n+1 < nn); // compute a cut for (int i=0;i<=n;i++) { xx[i]=i; yy[i]=uh(real(i)/n,real(i)/n); // value of uh at point (i/10. , i/10.) } plot(Th,uh,[uh,vh],value=true,ps="three.eps",wait=true); // plot mesh, isovalue, and vector // zoom on box defined by the two corner points [0.1,0.2] and [0.5,0.6] plot(uh,[uh,vh],bb=[[0.1,0.2],[0.5,0.6]],wait=true,grey=1,fill=1,value=1,ps="threeg.eps"); // in grey with filling plot([xx(0:n),yy(0:n)],[xx(0:n:5),yy(0:n:5)],ps="likegnu.eps",wait=true); // like gnuplot plot a cut of uh real[int] viso(31); for (int i=0;i<viso.n;i++) viso[i]=i*0.1; plot(uh,viso=viso(0:viso.n-1),value=1,fill=1,wait=1,hsv=colorhsv,ps="threehsv.eps"); ### Quelle est la signification du paramètre “tgv” pour la définition matricielle d’un problème? tgv est la méthode utilisée par défaut par FreeFem++ pour implémenter les conditions de Dirichlet. tgv signifie “très grande valeur” (10^30 par défaut). Elle est imposée sur le terme diagonal de la matrice (ce qui rend les autres termes de la même ligne négligeables) et au second membre. Un avantage de cette méthode est de ne modifier qu’un seul terme de la matrice. Un désavantage est de créer une très grande valeur propre dans le système à résoudre, ce qui peut mettre en difficulté la méthode de résolution choisie. En cas de difficulté, une valeur négative pour le paramètre tgv force FreeFem++ à utiliser une autre méthode: mettre 1 sur la diagonale et annuler tous les autres termes de la ligne de la matrice. ### Comment créer rapidement un maillage 3D en forme de sphère? • sphere.edp load "msh3" border cc(t=0,2*pi){x=cos(t);y=sin(t);label=1;} mesh Th2= buildmesh(cc(500)); // eps is there to avoid square roots of negative values // and thin triangles close to the equator real eps=1e-2; func zmin=-sqrt(1+eps-x*x-y*y); func zmax=sqrt(1+eps-x*x-y*y); int[int] rup=[0,2],rdown=[0,1],rmid=[1,3,2,3,3,3,4,3]; mesh3 Th=buildlayers(Th2,20, zbound=[zmin,zmax], labelmid=rmid, reffaceup = rup, reffacelow = rdown); plot(Th); ce qui donne : ffquasisphere.png ### Comment convertir une image SVG en maillage FreeFem++? Voici un script perl qui sait traduire les SVG qui contiennent des courbes de Bézier cubiques et des lignes droites : • svg2edp #!/usr/bin/perl # ====================================================================== # Written by Antoine Le Hyaric # http://www.ljll.math.upmc.fr/lehyaric # ====================================================================== # headeralh mine perl start=20/02/2012 # Converts a 2D SVG picture (eg obtained with inkscape "Path/Trace Bitmap...") into a list of FreeFem++ borders and # meshes. Examples use: "svg2edp < file.svg > file.edp 2> file.gnuplot" use strict; # final list of all borders my @borders; # numbering borders my$numb=0;

sub straightborder{
my($x0,$y0,$x1,$y1)=@_;

die if (abs($x1-$x0)+abs($y1-$y0))<1e-6;

print "border b$numb(t=0,1){\n"; print "\tx=$x0*t+$x1*(1-t);\n"; print "\ty=$y0*t+$y1*(1-t);\n"; print "}\n"; push @borders,"b$numb(-2)";
$numb++; # stderr contains the same data for debugging via gnuplot print STDERR "$x0 $y0\n"; print STDERR "$x1 $y1\n"; } sub bezierinterp{ my($p0,$q0,$q1,$p1,$t)=@_;
return $p0*(1-$t)**3+$q0*3*(1-$t)**2*$t+$q1*3*(1-$t)*$t**2+$p1*$t**3;
}

sub bezierborder{
my($p1x,$p1y,$q1x,$q1y,$q2x,$q2y,$p2x,$p2y)=@_;
my $xprev=$p1x;
my $yprev=$p1y;

for(my $t=0.1;$t<=1;$t+=0.1){ my$xnext=bezierinterp($p1x,$q1x,$q2x,$p2x,$t); my$ynext=bezierinterp($p1y,$q1y,$q2y,$p2y,$t); print "border b$numb(t=0,1){\n";
print "\tx=$xprev*t+$xnext*(1-t);\n";
print "\ty=$yprev*t+$ynext*(1-t);\n";
print "\tlabel=1;\n";
print "}\n";
push @borders,"b$numb(-2)";$numb++;

# stderr contains the same data for debugging via gnuplot
print STDERR "$xprev$yprev\n";
print STDERR "$xnext$ynext\n";

$xprev=$xnext;
$yprev=$ynext;
}
}

# numbering meshes
my $numm=0; # read input file while(<STDIN>){ next unless / d="(.*)"/; my$path=$1; # scan path my$num='([-.0-9]+)';

# current point in absolute coordinates
my $curx=0; my$cury=0;

# first point (to close a curve) in absolute coordinates
my $firstx; my$firsty;
my $firstok=0; # list of all SVG commands [[http://www.w3.org/TR/SVG11/#pathsl#PathDataMovetoCommands]] my$state='';
my $abs=0; my @args; while($path=~m/ *(m|c|l|z|$num,$num)/gi){
my $Command=$1;
my $command=lc($Command);
my $x=$2;
my $y=$3;
if($command eq 'm' ||$command eq 'c' || $command eq 'l'){$state=lc($command); # capital letters represent absolute coordinates$abs=0;
$abs=1 if ord($Command)<97;

@args=();
}

# SVG command for closing the curve
elsif($command eq 'z'){ print "// closing the curve\n"; ###straightborder($curx,$cury,$firstx,$firsty);$curx=$firstx;$cury=$firsty; } # SVG commands followed by coordinates else{ # initial point if($state eq 'm'){
$curx=abscoord($curx,$x,$abs);
$cury=abscoord($cury,$y,$abs);
print "// moving to [$curx,$cury]\n";
if(!$firstok){$firstx=$curx;$firsty=$cury;$firstok=1;
}
}

# line
elsif($state eq 'l'){ print "// line\n"; my$tox=abscoord($curx,$x,$abs); my$toy=abscoord($cury,$y,$abs); straightborder($curx,$cury,$tox,$toy);$curx=$tox;$cury=$toy; } # bezier curve elsif($state eq 'c'){

push @args,abscoord($curx,$x,$abs),abscoord($cury,$y,$abs);

# draw one bezier segment when is fully defined (ie with 2 points + 2 control points)
if($#args==5){ print "// bezier curve\n"; my$tox=$args[4]; my$toy=$args[5]; bezierborder($curx,$cury,$args[0],$args[1],$args[2],$args[3],$tox,$toy); # the next bezier point may come without an explicit 'c' @args=();$curx=$tox;$cury=$toy; } } } } # create corresponding mesh if(\$#borders>=0){
print "mesh Th$numm=buildmesh(".[join](http://perldoc.perl.org/functions/#joinl)("+",@borders).");\n";$numm++;
}
}

# choose between relative and absolute coordinates
sub abscoord{
my($x0,$x,$abs)=@_; [return](http://perldoc.perl.org/functions/#returnl)$x if $abs; [return](http://perldoc.perl.org/functions/#returnl)$x+$x0; } ### Comment passer du 2D au 3D dans FreeFem++? Les points importants pour convertir un script .edp du 2D au 3D: • ajouter load “msh3” (et load “tetgen” si nécessaire) au début du script • utiliser le mot-clé mesh3 au lieu de mesh pour définir les maillages 3D • créer un maillage 3D grâce à (au choix): buildlayers(), tetg(), en incluant les géométries définies dans MeshSurface.idp (sphère et boite carrée), en chargeant un maillage externe au format .mesh construit avec Gmsh par exemple. • si nécessaire, changer la méthode de résolution par défaut de FreeFem++ (Umfpack) pour limiter la consommation de mémoire vive (essayer par exemple CG ou GMRES). ### Comment extraire les matrices contruites par FreeFem++? Le mot-clé problem ne permet pas de manipuler les matrices. Il faut utiliser le mot-clé varf avec les précautions suivantes: • un “problem” doit être traduit en deux matrices: une matrice carrée A et un second membre B qui donnent l’équation Ax=B • le second membre B calculé par varf est du signe opposé à celui calculé par problem. Ce changement de signe est contenu implicitement dans l’écriture des conditions de Dirichlet “on(…)” mais pas dans les termes intégraux dépendant de l’edp traitée. Voici un exemple: • problem2varf.edp mesh Th=square(10,10); fespace Vh(Th,P1); Vh uh,vh; func f=1; func g=1; // Résolution d'une EDP avec le mot-clé problem problem laplace(uh,vh)=int2d(Th)(dx(uh)*dx(vh)+dy(uh)*dy(vh))-int2d(Th)(f*vh)+on(1,2,3,4,uh=g); laplace; plot(uh); // Résolution de la même EDP sous forme matricielle varf laplaceA(uh,vh)=int2d(Th)(dx(uh)*dx(vh)+dy(uh)*dy(vh)); matrix A=laplaceA(Vh,Vh); varf laplaceB=int2d(Th)(f*vh)+on(1,2,3,4,uh=g); real[int] B=laplaceB(0,Vh); uh[]=A^-1*B; plot(uh); ### Comment coupler plusieurs problèmes en construisant une matrice par blocs? • Il faut extraire les matrices des deux problèmes A11, A22, B1, B2. Puis construire les blocs rectangulaires A12 et A21 matrix A12=probleme1(Vh2,Vh1); matrix A21=probleme1(Vh1,Vh2); • Puis construire la matrice par blocs matrix A=[[A11,A12],[A21,A22]]; real[int] B=[B1,B2]; • Puis calculer les deux solutions couplées Vh1 u1; Vh2 u2; real[int] T=A^-1*B; [u1[],u2[]]=T; ### Comment afficher un domaine de calcul très étroit? Quand une dimension du domaine de calcul est très petite par rapport aux autres, il est très difficile de voir les valeurs affichées sur le domaine qui ressemble plus à une ligne qu’à une surface. Voici comment augmenter la petite dimension du domaine juste pour afficher les valeurs numériques de manière visible. // very thin domain (x range is very small with respect to y) mesh Th=square(1,100,[.01*x,y]); plot(Th); fespace Vh(Th,P1); // example of value on this very this domain Vh uh=1e4*x*x+y*y; plot(uh); // wider mesh mesh Thzoom=square(100,100,[x,y]); plot(Thzoom); fespace Vhzoom(Thzoom,P1); // values from the thin domain displayed on the wider domain Vhzoom uhzoom=uh(x/100,y); plot(uhzoom); ### Dessiner une frontière dans un maillage Une solution pour dessiner une frontière à l’intérieur d’un maillage FreeFem++ est de créer un espace blanc (vide): // Maillage complet mesh Th=square(10,10,[2*x,y]); // Maillages séparés par un vide représentant une frontière dans le domaine mesh Th1=square(10,10,[x*0.99,y]); mesh Th2=square(10,10,[x*.9+1,y]); // Exemple de problème résolu sur Th et visualisé avec une frontière fespace Vh(Th,P1); Vh uh,vh; func f=1; func g=0; problem laplace(uh,vh,solver=GMRES,tgv=1e5) = int2d(Th)( dx(uh)*dx(vh) + dy(uh)*dy(vh) ) - int2d(Th)( f*vh ) + on(2,uh=g) ; laplace; // Interpolation de la solution continue sur le maillage avec frontière fespace Vh1(Th1,P1); fespace Vh2(Th2,P1); Vh1 uh1=uh; Vh2 uh2=uh; // Dessin avec frontière visible plot(uh1,uh2); ### Convertir un maillage vers FreeFem++ Cet exemple peut facilement être transformé pour lire tout autre format de maillage 2D enregistré dans un fichier texte : // mesh data int nodes; int equations; int elements; int nodesperelem; int spacedim; int ni; int nj; real[int,int] coordinates(3,1); real[int,int] geometry(3,1); real[int] subdomain(1); // Load mesh { ifstream i("mesh.data"); // skip some textual data (7 words) string l; i>>l>>l>>l>>l>>l>>l>>l; // read mesh size i>>nodes; i>>elements; i>>nodesperelem; i>>spacedim; i>>ni; i>>nj; coordinates.resize(3,nodes); geometry.resize(3,elements); subdomain.resize(elements); // skip textual title (1 word) i>>l; for(int n=0;n<nodes;n++){ for(int d=0;d<3;d++){ i>>coordinates(d,n); } } // skip textual title (1 word) i>>l; for(int n=0;n<elements;n++){ for(int d=0;d<3;d++){ i>>geometry(d,n); geometry(d,n)=geometry(d,n)-1; } } // skip textual title (4 words) i>>l>>l>>l>>l; for(int n=0;n<elements;n++)i>>subdomain(n); } // save mesh in FreeFem++ 2D .msh format { ofstream o("mesh.msh"); // numbers of points, elements, edges o<<nodes<<" "<<elements<<" "<<0<<endl; // points for(int n=0;n<nodes;n++){ // 2D coordinates for(int c=0;c<2;c++){ o<<coordinates(c,n)<<" "; } // label o<<0<<endl; } // elements for(int n=0;n<elements;n++){ // connectivity for(int c=0;c<3;c++){ o<<geometry(c,n)+1<<" "; } // label o<<0<<endl; } } // reload the mesh in the FreeFem++ format mesh Th=readmesh("mesh.msh"); // load some values fespace Vh(Th,P1); Vh u,v; { ifstream i("solution.data"); int rank; for(int n=0;n<nodes;n++){ // u i>>u[](n); // v i>>v[](n); } } } // display values in FreeFem++ plot(Th,[u,v],value=1,cmm="u,v"); ### Un exemple d’écoulement de Stokes en FreeFem++ L’exemple suivant se trouve dans le dossier examples++-chapt3/stokes.edp de FreeFem++ : //file Stokes.edp int n=3; mesh Th=square(10*n,10*n); fespace Uh(Th,P1b); Uh u,v,uu,vv; fespace Ph(Th,P1); Ph p,pp; solve stokes([u,v,p],[uu,vv,pp]) = int2d(Th)(dx(u)*dx(uu)+dy(u)*dy(uu) + dx(v)*dx(vv)+ dy(v)*dy(vv) + dx(p)*uu + dy(p)*vv + pp*(dx(u)+dy(v)) -1e-10*p*pp) + on(1,2,4,u=0,v=0) + on(3,u=1,v=0); plot([u,v],p,wait=1); ### Un exemple de simulation de Navier-Stokes dans une cavité entrainée avec plusieurs vortex? Voici un exemple standard de FreeFem qui montre un vortex en bas de la cavité entrainée. // remark: the sign of p is correct real s0=clock(); mesh Th=square(10,10); fespace Vh2(Th,P2); fespace Vh(Th,P1); Vh2 u2,v2,up1,up2; Vh2 u1,v1; Vh u1x=0,u1y,u2x,u2y, vv; real reylnods=1000; //cout << " Enter the reynolds number :"; cin >> reylnods; assert(reylnods>1 && reylnods < 100000); up1=0; up2=0; func g=(x)*(1-x)*4; Vh p=0,q; real alpha=0; real nu=1; int i=0,iter=0; real dt=0; solve NS ([u1,u2,p],[v1,v2,q],solver=Crout,init=i) = int2d(Th)( alpha*( u1*v1 + u2*v2) + nu * ( dx(u1)*dx(v1) + dy(u1)*dy(v1) + dx(u2)*dx(v2) + dy(u2)*dy(v2) ) + p*q*(0.000001) - p*dx(v1) - p*dy(v2) - dx(u1)*q - dy(u2)*q ) + int2d(Th) ( -alpha*convect([up1,up2],-dt,up1)*v1 -alpha*convect([up1,up2],-dt,up2)*v2 ) + on(3,u1=g,u2=0) + on(1,2,4,u1=0,u2=0) ; plot(coef=0.2,cmm=" [u1,u2] et p ",p,[u1,u2],ps="StokesP2P1.eps",value=1,wait=1); { real[int] xx(21),yy(21),pp(21); for (int i=0;i<21;i++) { yy[i]=i/20.; xx[i]=u1(0.5,i/20.); pp[i]=p(i/20.,0.999); } cout << " " << yy << endl; plot([xx,yy],wait=1,cmm="u1 x=0.5 cup"); plot([yy,pp],wait=1,cmm="pressure y=0.999 cup"); } dt = 0.1; int nbiter = 5; real coefdt = 0.25^(1./nbiter); real coefcut = 0.25^(1./nbiter) , cut=0.01; real tol=0.5,coeftol = 0.25^(1./nbiter); nu=1./reylnods; for (iter=1;iter<=nbiter;iter++) { cout << " dt = " << dt << " ------------------------ " << endl; alpha=1/dt; for (i=0;i<=50;i++) { up1=u1; up2=u2; NS; if ( !(i % 10)) plot(coef=0.2,cmm=" [u1,u2] et p ",p,[u1,u2],ps="plotNS_"+iter+"_"+i+".eps"); cout << "CPU " << clock()-s0 << "s " << endl; } if (iter>= nbiter) break; Th=adaptmesh(Th,[dx(u1),dy(u1),dx(u1),dy(u2)], abserror=0,cutoff=cut,err=tol, inquire=0,ratio=1.5,hmin=1./1000); plot(Th,ps="ThNS.eps"); dt = dt*coefdt; tol = tol *coeftol; cut = cut *coefcut; } cout << "CPU " << clock()-s0 << "s " << endl; ce qui donne: freefem-ns-vortex.png ### Comment savoir à quel région d’un maillage un point appartient? Utiliser le mot clé “region”. ### Comment afficher la valeur des labels dans tout le maillage? // Un exemple de maillage load "msh3" int nn=4; mesh Th2= square(nn,nn); int[int] rup=[0,0], rdown=[0,0], rmid=[1,1,2,2,3,3,4,4]; real zmin=0,zmax=1; mesh3 Th=buildlayers(Th2,nn, zbound=[zmin,zmax], labelmid=rmid, reffaceup = rup, reffacelow = rdown ); // Une fonction 'b' contenant les valeurs des labels en chaque point fespace Vh(Th,P1); Vh b; int t; for(t=0;t<Th.nt;t++){ int p; for(p=0;p<4;p++){ b[](Th[t][p])=Th[t][p].label; } } // Représentation graphique de b plot(b,nbiso=20,value=1); ### Multiplying matrices This is possible when loading the “lapack” module. eg: load "lapack" real[int,int] a(2,2); a=[[1,2],[3,4]]; real[int,int] b(2,2); b=a*a; cout<<b; ### What is the equivalent of #include in FreeFem++? include "file.idp" The “idp” extension is frequently used for included scripts but not required. ### How to return a vector as the result of a function? Returning a vector as the value of a function may sometimes pose problems. If the case arises, just tranform the return value into a function parameter. ### Are FreeFem++ functions recursive? Not at the moment. ### How to make a script wait for a fixed amount of time? Just use an external sleep command: int i; for(i=0;i<10;i++){ cout<<i<<endl; exec("sleep 2"); // seconds } ### How to refine a part of a mesh Example on a plain square mesh: mesh Th1=square(30,30); plot(Th1,cmm="Th1"); Refine mesh center and keep structured mesh around it (r2 and u can be changed at will): func r2=(x-0.5)*(x-0.5)+(y-0.5)*(y-0.5); func u=1+1/(0.2+10*r2); mesh Th2=splitmesh(Th1,u); plot(Th2,cmm="Th2"); ### FreeFem++ quadrature formulae note: all quadrature formulae with letter “T” apply to triangles, and “E” apply to edges. ### How to start writing to a file from scratch and then append to it? { ofstream f("toto.txt"); f << "coucou'\n"; }; Then to append to the same file: { ofstream f("toto.txt",append); f << "add coucou'\n"; }; ### How to randomize a symetric mesh to check if its regularity has an impact on numerical results? Here is an example with a square: int n=10; mesh m=square(n,n); for(int i=0;i<100;i++){ m=adaptmesh(m,1./n,IsMetric=1); plot(m); } ### How to copy a sparse matrix into a dense matrix? // Construction d'une matrice creuse mesh Th=square(10,10); plot(Th); fespace Vh(Th,P1); Vh uh,vh; varf laplaceA(uh,vh)=int2d(Th)(dx(uh)*dx(vh)+dy(uh)*dy(vh)); matrix SA=laplaceA(Vh,Vh); // Conversion de la matrice creuse en matrice pleine real[int,int] FA(SA.n,SA.n); // This does not work // "error operator = <P3KNMIdE>, <14Matrice_CreuseIdE>" //FA=SA; // This does not work // "Error: the coef a(0,2) do'nt exist in sparse matrix Matrix type = P14Matrice_CreuseIdE" //for(int i=0;i<SA.n;i++) // for(int j=0;j<SA.n;j++) // FA(i,j)=SA(i,j); // This is ok { real[int] coef; int[int] lg; int[int] cl; [lg,cl,coef]=SA; FA=0; for(int c=0;c<coef.n;c++)FA(lg(c),cl(c))=coef(c); } // just a test to see if SA and FA are identical real[int] one(SA.n); one=1; real[int] SAone=SA*one; cout<<SAone.max<<endl; real[int] FAone=FA*one; cout<<FAone.max<<endl; ### Comment déterminer les valeurs et vecteurs propres d’un matrice? Voici l’exemple LapEigenValue.edp // Computation of the eigen value and eigen vector of the // Dirichlet problem on square$]0,\pi[^2$// ---------------------------------------- // we use the inverse shift mode // the shift is given with sigma real // ------------------------------------- // find$\lambda$such that: // $$\int_{\omega} \nabla u_ \nabla v = \lambda \int_{\omega} u \nabla v$$ verbosity=1; mesh Th=square(20,20,[pi*y,pi*x]); fespace Vh(Th,P2); Vh u1,u2; real sigma = 00; // value of the shift varf a(u1,u2)= int2d(Th)( dx(u1)*dx(u2) + dy(u1)*dy(u2) - sigma* u1*u2 ) + on(1,2,3,4,u1=0) ; // Boundary condition varf b([u1],[u2]) = int2d(Th)( u1*u2 ) ; // no Boundary condition matrix A= a(Vh,Vh,solver=Crout,factorize=1); matrix B= b(Vh,Vh,solver=CG,eps=1e-20); // important remark: // the boundary condition is make with exact penalisation: // we put 1e30=tgv on the diagonal term of the lock degre of freedom. // So take dirichlet boundary condition just on$a$variationnal form // and not on$b$variationnanl form. // because we solve // $$w=A^-1*B*v$$ int nev=20; // number of computed eigen valeu close to sigma real[int] ev(nev); // to store nev eigein value Vh[int] eV(nev); // to store nev eigen vector int k=EigenValue(A,B,sym=true,sigma=sigma,value=ev,vector=eV,tol=1e-10,maxit=0,ncv=0); // tol= the tolerace // maxit= the maximal iteration see arpack doc. // ncv see arpack doc. // the return value is number of converged eigen value. k=min(k,nev); // some time the number of converged eigen value // can be greater than nev; int nerr=0; real[int] eev(36); eev=1e100; for(int i=1,k=0;i<6;++i) for(int j=1;j<6;++j) eev[k++]=i*i+j*j; eev.sort; cout << eev << endl; for (int i=0;i<k;i++) { u1=eV[i]; real gg = int2d(Th)(dx(u1)*dx(u1) + dy(u1)*dy(u1)); real mm= int2d(Th)(u1*u1) ; real err = int2d(Th)(dx(u1)*dx(u1) + dy(u1)*dy(u1) - (ev[i])*u1*u1) ; if(abs(err) > 1e-6) nerr++; if(abs(ev[i]-eev[i]) > 1e-1) nerr++; cout << " ---- " << i<< " " << ev[i] << " == " << eev[i] << " err= " << err << " --- "<<endl; // FFCS: add 3D view capabilities plot(eV[i],cmm="Eigen Vector "+i+" valeur =" + ev[i] ,wait=1,value=1,ps="eigen"+i+".eps",dim=3,fill=1,CutPlane=0,ShowAxes=0); } assert(nerr==0); ### Comment arrondir une valeur réelle à un nombre fixe de décimales? real a=1./3.; cout<<a<<endl; a=int(a*1000.)/1000.; cout<<a<<endl; Résultat : 0.333333 0.333 times: compile 0.01s, execution 1.10961e-18s, mpirank:0 CodeAlloc : nb ptr 2373, size :160416 mpirank: 0 Bien: On a fini Normalement ### Comment lire une matrice calculée par FreeFem++ dans Matlab? Voici un script Matlab écrit par Richard MICHEL. ### Comment appeler ARPACK pour une matrice sans maillage associé? int nev=5; // number of computed eigenvalue close to sigma real[int] ev(nev); // to store nev eigenvalues real[int,int] eV(AA.n,nev); // to store nev eigenvectors int k=EigenValue(AA,BB,sym=true,value=ev,rawvector=eV); ### Comment exécuter Matlab depuis FreeFem++? Dans le script FreeFem++ : (testé sur Windows et Linux) exec("matlab -automation -r \"run('/path/vers/le/script/matlab.m')\" ") ### Fusionner deux maillages le long d’une frontière interne L’important est de donner un label distinct à la portion de frontière qui sera à l’intérieur du maillage pour que les conditions aux bords ne lui soient pas appliquées: int[int] l1=[1,2,1,1]; mesh m1=square(10,10,label=l1); int[int] l2=[1,1,1,2]; mesh m2=square(10,10,[x+1,y],label=l2); plot(m1,m2); mesh m=m1+m2; plot(m); ### Créer une matrice pleine et la convertir en matrice creuse int N=10; complex [int,int] A(N,N); A=0; for(int i=0;i<N;i++){ A(i,i)=1.+i; if(i+1 < N) A(i,i+1)=-i-1i*i; a[i]=i*(1.+2i); } matrix<complex> sparseA=A; cout << sparseA << endl; ## Radia Main features - Saturated iron & anisotropic materials - Polyhedron shapes - Straight and curved current coils - Easy modeling and meshing - Fast 3D visualization with QuickDraw 3D or Mathematica - Parameterization of the models in the Mathematica Language - Fast solving - Semi-analytical computation of field, field integrals and forces - Operates on MacOs and Windows 95/NT - Authors : O. Chubar, P. Elleaume, J. Chavanne ### Web http://www.esrf.fr/Accelerators/Groups/InsertionDevices/Software/Radia ### Documentation http://www.esrf.fr/Accelerators/Groups/InsertionDevices/Software/Radia/Documentation ### Exemples http://www.esrf.fr/Accelerators/Groups/InsertionDevices/Software/Radia/Examples ### Autres indications Binary only download. Requires Mathematica. ## Rheolef This is rheolef, a computer environment that serves as a convenient “laboratory” for computations involving finite element-like methods. It provides a set of unix commands and C++ algorithms and containers. This environment is currently under development. Fiche PLUME ## rlabplus .. RLaB is an interactive, interpreted scientific programming environment. RLaB is a very high level language intended to provide fast prototyping and program development, as well as easy data-visualization, and processing. RLaB is not a clone of languages such as those used by tools like Matlab or Matrix-X/Xmath. However, as RLaB focuses on creating a good experimental environment (or laboratory) in which to do matrix math, it can be called ”Matlab-like“; since the programming language possesses similar operators and concepts. RLaB does not try to be a Matlab clone. Instead, it borrows what I believe are the best features of the Matlab language and provides improved language syntax and semantics. The syntax has been improved to allow users more expression and reduce ambiguities. The variable scoping rules have been improved to facilitate creation of larger programs and program libraries. A heterogeneous associative array has been added to allow users to create and operate on arbitrary data structures. The fundamental data type is a floating point matrix (either real or complex), though RLaB also includes string matrices, and sparse numerical matrices (both real and complex). Project rlabplus is a continuation of work on an open-source scripting environment for scientific computations RLaB2. Project rlabplus provides release 2 of RLaB2, which contains upgrades of the numerical libraries used in the first release, and many new libraries and toolkits, e.g., GNU Scientific Library (GSL). Original RLaB was created by Ian Searle and collaborators. Rlabplus is a creation of Marijan Kostrun. ## Sage Sage is a free open-source mathematics software system licensed under the GPL. It combines the power of many existing open-source packages into a common Python-based interface. Mission: Creating a viable free open source alternative to Magma, Maple, Mathematica and Matlab. Fiche PLUME ## Salomé SALOME is a free software that provides a generic platform for Pre and Post-Processing for numerical simulation. It is based on an open and flexible architecture made of reusable components available as free software. It is open-source (LGPL), and you can download both the sourcecode and the executables from this site. Fiche PLUME Format de données standard lus : Code_Aster, Gmsh, I-DEAS file format, IGES, Netgen, Salomé MED, STEP Format de données standard écrits : Code_Aster, Gmsh, I-DEAS file format, IGES, Netgen, Salomé MED, STEP ### Questions/Réponses #### Version Windows Une version pour Windows (version de test, pas la plus récente mais fonctionnelle) est téléchargeable à http://files.salome-platform.org/cea/adam/salomewindows/download ## ScaLAPACK The ScaLAPACK (or Scalable LAPACK) library includes a subset of LAPACK routines redesigned for distributed memory MIMD parallel computers. It is currently written in a Single-Program-Multiple-Data style using explicit message passing for interprocessor communication. It assumes matrices are laid out in a two-dimensional block cyclic decomposition. ScaLAPACK is designed for heterogeneous computing and is portable on any computer that supports MPI or PVM. Like LAPACK, the ScaLAPACK routines are based on block-partitioned algorithms in order to minimize the frequency of data movement between different levels of the memory hierarchy. (For such machines, the memory hierarchy includes the off-processor memory of other processors, in addition to the hierarchy of registers, cache, and local memory on each processor.) The fundamental building blocks of the ScaLAPACK library are distributed memory versions (PBLAS) of the Level 1, 2 and 3 BLAS, and a set of Basic Linear Algebra Communication Subprograms (BLACS) for communication tasks that arise frequently in parallel linear algebra computations. In the ScaLAPACK routines, all interprocessor communication occurs within the PBLAS and the BLACS. One of the design goals of ScaLAPACK was to have the ScaLAPACK routines resemble their LAPACK equivalents as much as possible. ### Web http://www.netlib.org/scalapack/#scalapack_homel ### Documentation FAQ ### Exemples http://www.netlib.org/scalapack/examples/#indexl ## Scilab Scilab (developped since 1989 by Scilab Group) is a scientific software package for numerical computations providing a powerful open computing environment for engineering and scientific applications. Distributed freely via the Internet since 1994, Scilab is currently being used in educational and industrial environnments around the world. Scilab includes hundreds of mathematical functions with the possibility to add interactively programs from various languages (C, Fortran…). It has sophisticated data structures (including lists, polynomials, rational functions, linear systems…), an interpreter and a high level programming language. Scilab has been conceived to be an open system where the user can define new data types and operations on these data types by using overloading. Fiche PLUME ### Questions/Réponses #### Quelques commandes pour démarrer Lire une matrice stockée dans un fichier texte A = fscanfMat('fichier') Extraire une ligne ou une colonne de cette matrice A(:,1) Un graphe en 2D plot2d(A) Executer un script enregistré dans un fichier exec('fichier') ## screen exécute chaque commande comme si elle disposait de son propre écran virtuel : • Démarrer un programme avec son propre écran : screen <programme> • Cacher un écran (sans arrêter les programmes qu’il contient même si on se déconnecte) : Control-A d • Revenir à un écran caché : screen -r • Aide : man screen ## SLEPc SLEPc, the Scalable Library for Eigenvalue Problem Computations, is a software library for the solution of large sparse eigenproblems on parallel computers. It can be used for the solution of problems formulated in either standard or generalized form, as well as other related problems such as the singular value decomposition. The emphasis of the software is on methods and techniques appropriate for problems in which the associated matrices are sparse, for example, those arising after the discretization of partial differential equations. Therefore, most of the methods offered by the library are projection methods or other methods with similar properties. Examples of these methods are Arnoldi, Lanczos and Subspace Iteration, to name a few. SLEPc implements these basic methods as well as more sophisticated algorithms. It also provides built-in support for spectral transformations such as the shift-and-invert technique. SLEPc is a general library in the sense that it covers standard and generalized eigenvalue problems, both Hermitian and non-Hermitian, with either real or complex arithmetic. SLEPc is built on top of PETSc, the Portable, Extensible Toolkit for Scientific Computation. It can be considered an extension of PETSc providing all the functionality necessary for the solution of eigenvalue problems. This means that PETSc must be previously installed in order to use SLEPc. PETSc users will find SLEPc very easy to use, since it enforces the same programming paradigm. For those users which are not familiar with PETSc yet, our recommendation is to fully understand its basic concepts before proceeding with SLEPc. ### Informations sur les formats de données SLEPc interfaces to some external software packages such as ARPACK, BLZPACK, PLANSO, TRLAN and LOBPCG. ## SLFCFD SLFCFD stands for San Le’s Free Computational Fluid Dynamics. It is a package of scientific software and graphical user interfaces for use in computational fluid dynamics. It is written in ANSI C by San Le and distributed under the terms of the GNU license. ### Web http://slfcfd.sourceforge.net/ ### Documentation http://slfcfd.sourceforge.net/#faql ### Téléchargement http://sourceforge.net/projects/slfcfd/ ### Exemples http://slfcfd.sourceforge.net/#galleryl ## SLFFEA SLFFEA stands for San Le’s Free Finite Element Analysis. It is a package of scientific software and graphical user interfaces for use in finite element analysis. It is written in ANSI C by San Le and distributed under the terms of the GNU license. ### Web http://slffea.sourceforge.net/ ### Documentation http://slffea.sourceforge.net/#faql ### Téléchargement http://slffea.sourceforge.net/#downloadl ### Exemples http://slffea.sourceforge.net/#galleryl ## SPARSE SPARSE consists of a set of C procedures for solving large sparse real or complex linear systems. Besides being able to solve linear systems, it solves transposed systems, finds determinants, and estimates errors due to ill-conditioning in the system of equations and instability in the computations. SPARSE does not require symmetry and is able to perform numerical pivoting (either diagonal or complete) to avoid unnecessary error in the solution. It was originally written for use in circuit simulators and is particularly apt at handling node- and modified-node admittance matrices. ### Web http://www.netlib.org/sparse/#indexl ### Documentation http://www.netlib.org/sparse/readme ## SparseLib++ SparseLib++ is a C++ class library for efficient sparse matrix computations across various computational platforms. The software package consists of matrix classes encompassing several sparse storage formats (e.g. compressed row, compressed column and coordinate formats), and providing basic functionality for managing sparse matrices. The Sparse BLAS Toolkit is used to for efficient kernel mathematical operations (e.g. sparse matrix-vector multiply) and to enhance portability and performance across a wide range of computer architectures. Included in the package are various preconditioners commonly used in iterative solvers for linear systems of equations. The focus is on computational support for iterative methods (for example, see IML++), but the sparse matrix objects presented here can be used in their own right. SparseLib++ matrices can be built out of nearly any C++ matrix/vector classes; it is shipped with the MV++ classes by default. ### Auteur(s) Sparselib++ authors are Roldan Pozo, Karin Remington, and Andrew Lumsdaine. ### Web http://math.nist.gov/sparselib++ ### Documentation SparseLib++ Sparse Matrix Class Library, User’s Guide ## SPOOLES SPOOLES 2.2 : SParse Object Oriented Linear Equations Solver SPOOLES is a library for solving sparse real and complex linear systems of equations, written in the C language using object oriented design. At present, there is the following functionality: 1. Compute multiple minimum degree, generalized nested dissection and multisection orderings of matrices with symmetric structure. 2. Factor and solve square linear systems of equations with symmetric structure, with or without pivoting for stability. The factorization can be symmetric LDLT, Hermitian LDLH, or nonsymmetric LDU. A direct factorization or a drop tolerance factorization can be computed. The factors and solve can be done in serial mode, multithreaded with Solaris or POSIX threads, or with MPI. 3. Factor and solve overdetermined full rank systems of equations using a multifrontal QR factorization, in serial or using POSIX threads. 4. Solve square linear systems using a variety of Krylov iterative methods. The preconditioner is a drop tolerance factorization, constructed with or without pivoting for stability. ### Web http://www.netlib.org/linalg/spooles ### Licence This release is entirely within the public domain; there are no licensing restrictions, and there is no warranty of any sort. ## STEP STEP, the Standard for the Exchange of Product Model Data, is a comprehensive ISO standard (ISO 10303) that describes how to represent and exchange digital product information. ### Web http://www.steptools.com/library/standard/ ### Logiciels capables de lire ce format ### Logiciels capables d’écrire dans ce format Salomé ## STL file format The .stl or stereolithography format is an ASCII or binary file used in manufacturing. It is a list of the triangular surfaces that describe a computer generated solid model. This is the standard input for most rapid prototyping machines. ### Documentation http://www.ennex.com/~fabbers/StL.asp ### Logiciels capables de lire ce format ADMesh ### Logiciels capables d’écrire dans ce format ADMesh ## SuperLU SuperLU is a general purpose library for the direct solution of large, sparse, nonsymmetric systems of linear equations on high performance machines. The library is written in C and is callable from either C or Fortran. The library routines will perform an LU decomposition with partial pivoting and triangular system solves through forward and back substitution. The LU factorization routines can handle non-square matrices but the triangular solves are performed only for square matrices. The matrix columns may be preordered (before factorization) either through library or user supplied routines. This preordering for sparsity is completely separate from the factorization. Working precision iterative refinement subroutines are provided for improved backward stability. Routines are also provided to equilibrate the system, estimate the condition number, calculate the relative backward error, and estimate error bounds for the refined solutions. ### Web http://crd.lbl.gov/~xiaoye/SuperLU/ ### Documentation http://crd.lbl.gov/~xiaoye/SuperLU/superlu_ug.pdf ## TetGen TetGen generates tetrahedral meshes. The algorithms used in TetGen are of Delaunay type. For a three-dimensional domain, defined by its boundary (such as a surface mesh), TetGen generates the boundary constrained (Delaunay) tetrahedralization, conforming Delaunay tetrahedralization, and quality Delaunay mesh. For a three-dimensional point set, the Delaunay tetrahedralization and convex hull are generated. TetGen is written in C++. It can be compiled into an executable program or a library for integrating into other applications. All major operating systems, e.g. Unix/Linux, MacOS, Windows, etc, are supported. ## Triangle A Two-Dimensional Quality Mesh Generator and Delaunay Triangulator. Triangle generates exact Delaunay triangulations, constrained Delaunay triangulations, conforming Delaunay triangulations, Voronoi diagrams, and high-quality triangular meshes. The latter can be generated with no small or large angles, and are thus suitable for finite element analysis. Fiche PLUME ## Trilinos The Trilinos Project is an effort to develop and implement robust parallel algorithms using modern object-oriented software design, while still leveraging the value of established numerical libraries such as PETSc, Aztec, the BLAS and LAPACK. It emphasizes abstract interfaces for maximum flexibility of component interchanging, and provides a full-featured set of concrete classes that implement all abstract interfaces. ### Web https://trilinos.org ## TYPHON TYPHON is an open source project which aims to offer a development platform for many computational methods for gas dynamics. It is structured as a multi-solver platform where it could be easily added a new solver. For now, it provides a finite volume solver for compressible inviscid equations and a finite volume solver for heat transfer. ### Web http://typhon.sourceforge.net/ ### Documentation http://typhon.sourceforge.net/#docl ### Téléchargement http://typhon.sourceforge.net/#get_downloadl ### Exemples http://typhon.sourceforge.net/#casel ## uBLAS uBLAS is a C++ template class library that provides BLAS level 1, 2, 3 functionality for dense, packed and sparse matrices. The design and implementation unify mathematical notation via operator overloading and efficient code generation via expression templates. […] uBLAS provides templated C++ classes for dense, unit and sparse vectors, dense, identity, triangular, banded, symmetric, hermitian and sparse matrices. Views into vectors and matrices can be constructed via ranges or slices and adaptor classes. The library covers the usual basic linear algebra operations on vectors and matrices: reductions like different norms, addition and subtraction of vectors and matrices and multiplication with a scalar, inner and outer products of vectors, matrix vector and matrix matrix products and triangular solver. The glue between containers, views and expression templated operations is a mostly STL conforming iterator interface. ### Téléchargement The latest stable release of uBLAS is part of the Boost libraries. ## UMFPACK UMFPACK is a set of routines for solving unsymmetric sparse linear systems, Ax=b, using the Unsymmetric MultiFrontal method. It uses dynamic memory allocation, and has a symbolic preordering and analysis phase that also reports the upper bounds on the nonzeros in L and U, flop count, and memory usage in the numeric phase. It can be used for real and complex matrices, rectangular and square, and both non-singular and singular. ## VisIt VisIt is a free interactive parallel visualization and graphical analysis tool for viewing scientific data on Unix and PC platforms. Users can quickly generate visualizations from their data, animate them through time, manipulate them, and save the resulting images for presentations. VisIt contains a rich set of visualization features so that you can view your data in a variety of ways. It can be used to visualize scalar and vector fields defined on two- and three-dimensional (2D and 3D) structured and unstructured meshes. VisIt was designed to handle very large data set sizes in the terascale range and yet can also handle small data sets in the kilobyte range. See the table below for more details about the tool’s features. Fiche PLUME ## Visualisation ### Images Quelques logiciels disponibles sur la plupart des machines pour créer des images à partir de vos résultats numériques : Pour retoucher une image une fois qu’elle a été enregistrée : GIMP • Une image JPEG de bonne qualité à partir d’une image EPS (fonctionne aussi à partir de PDF) : convert -density 200 -quality 100 <image>.eps <image>.jpg • Convertir toutes les images EPS du répertoire courant en JPEG : for i in *.eps;do echo$i;convert -density 200 -quality 100 $i$i.jpg;done

Note pour Windows : convert, ainsi que de nombreuses autres commandes utiles, est disponible en installant le logiciel gratuit Cygwin (http://www.cygwin.com).

### Films

#### Convertir une séquence d’images en film sous Linux

• Une animation GIF (visible dans tout navigateur internet) à partir d’une séquence d’images EPS (NB: EPS n’est pas le seul format d’entrée possible. On peut aussi utiliser PPM, PNG, JPG, etc. Un fond transparent conduit à une superposition d’images) :

convert -delay <délai entre deux images en centièmes de secondes> -loop 0 *.eps <animation>.gif

• Un film MPEG à partir d’une séquence d’images JPEG nommées image1.jpg, image2.jpg, etc:

ffmpeg -i <nom de l'image>%d.jpg <film>.mpg

• Un film MPEG-4 en 25 images/seconde à partir d’une séquence d’images .jpg :

mencoder mf://*.jpg -mf fps=25:type=jpg -ovc lavc -lavcopts vcodec=mpeg4 -oac copy -o <film>.avi

#### Convertir un film du format AVI au format MPEG

ffmpeg -i <in>.avi <out>.mpg

#### Extraire les images d’un film

• Depuis une animation GIF :

convert <animation>.gif <images>.jpg

• Depuis tout format de film : mplayer -vo png <film>

#### Coller deux films

mencoder -ovc copy -oac copy <film1>.avi <film2>.avi -o <film>.avi

#### Convertir toutes les images EPS avec un fond transparent du répertoire courant en images PNG avec un fond blanc

for i in *.eps;do echo $i;convert -alpha Off -background white$i \$i.png;done

## VRML

The Virtual Reality Modeling Language (VRML) is a file format for describing interactive 3D objects and worlds. VRML is designed to be used on the Internet, intranets, and local client systems. VRML is also intended to be a universal interchange format for integrated 3D graphics and multimedia. VRML may be used in a variety of application areas such as engineering and scientific visualization, multimedia presentations, entertainment and educational titles, web pages, and shared virtual worlds.

### Documentation

http://tecfa.unige.ch/guides/vrml/vrml97/spec/

## VTK

The Visualization ToolKit (VTK) is an open source, freely available software system for 3D computer graphics, image processing, and visualization used by thousands of researchers and developers around the world. VTK consists of a C++ class library, and several interpreted interface layers including Tcl/Tk, Java, and Python. Professional support and products for VTK are provided by Kitware, Inc. VTK supports a wide variety of visualization algorithms including scalar, vector, tensor, texture, and volumetric methods; and advanced modeling techniques such as implicit modelling, polygon reduction, mesh smoothing, cutting, contouring, and Delaunay triangulation. In addition, dozens of imaging algorithms have been directly integrated to allow the user to mix 2D imaging / 3D graphics algorithms and data. The design and implementation of the library has been strongly influenced by object-oriented principles. VTK has been installed and tested on nearly every Unix-based platform, PCs (Windows 98/ME/NT/2000/XP), and Mac OSX Jaguar or later.

Fiche PLUME

Documentation: Online Tutorials, Documentation, FAQ, Wiki

## Wings 3D

Wings 3D is a subdivision modeler inspired by Nendo and Mirai from Izware.

It is possible to assign materials, vertex color, UV coordinates and textures, but there will be improvements in those features before Wings goes 1.0.

There is no support in Wings for doing animations.

### Web

http://www.wings3d.com/

3D Studio (3DS)

## xd3d

xd3d is a simple scientific visualization tool designed to be easy to learn. It can plot 2d and 3d meshes, with shadowing, contour plots, vector fields, iso-contour (3d), as well as 3d surfaces z=f(x,y) defined by an algebraic expression or a cloud of points. It generates high quality vector PostScript files for scientific publications and still or animated bitmap images. It includes the graph plotter xgraphic.

xd3d can be installed on any unix system using X windows: all the unix workstations, linux systems, Mac OS X, and Microsoft-Windows computers with an X emulation like the freeware Cygwin/Xfree.

To compile and install xd3d and its related programs, you must have a Fortran 77 and a C compiler (like g77 and gcc). The X11 library libX11.a and the include file X.h must be present on your computer.

To run xd3d you only need to have X.

### Web

http://www.cmap.polytechnique.fr/~jouve/xd3d/index.php

### Format de données standard lus

Lit les fichiers au format NOPO (voir Modulef)

## Y12M

Y12MA solves sparse systems of linear algebraic equations by Gaussian elimination. The subroutine is a “black box subroutine” designed to solve efficiently problems which contain only one system with a single right hand side. The number of the input parameters is minimized. The user must assign values only to NN, NN1, N, Z, A, SNR, RNR, IHA and B according to the rules described in Section 2.4 (see below). It is extremely easy to modify the subroutine to the cases: (a) a sequence of systems with the same matrix is to be solved (note that one system with many right hand sides can be rewritten as a sequence of systems with the same matrix), (b) a sequence of systems whose matrices are different but of the same structure is to be solved and © a sequence of systems whose matrices are of the same structure and some of them are the same is to be solved.

### Web

http://www.netlib.org/y12m/#indexl

### Documentation

http://www.netlib.org/y12m/doc

## Yorick

Yorick is an interpreted programming language, designed for postprocessing or steering large scientific simulation codes. Smaller scientific simulations or calculations, such as the flow past an airfoil or the motion of a drumhead, can be written as standalone yorick programs. The language features a compact syntax for many common array operations, so it processes large arrays of numbers very efficiently. Unlike most interpreters, which are several hundred times slower than compiled code for number crunching, yorick can approach to within a factor of four or five of compiled speed for many common tasks. Superficially, yorick code resembles C code, but yorick variables are never explicitly declared and have a dynamic scoping similar to many Lisp dialects. The yorick language is designed to be typed interactively at a keyboard, as well as stored in files for later use. Yorick includes an interactive graphics package, and a binary file package capable of translating to and from the raw numeric formats of all modern computers.

## Z88

Z88 is a fast, powerful and compact Finite Elements Analysis Program especially designed for PCs running the great LINUX, workstations and large computers with UNIX and PCs with WindowsXP/95. Z88 features 20 finite element types covering plane stress, plate bending, axial symmetric structures and spacial structures up to 20-node Serendipity hexahedrons. Z88 comes with a user-friendly interface, a powerful mesh generator, a DXF-converter, two plot programs and, of course, two powerful solvers. Import of COSMOS files from Pro/ENGINEER and Pro/MECHANICA is supported.

http://z88.org/