From: bangerth Date: Tue, 11 Mar 2008 19:19:12 +0000 (+0000) Subject: Mention Trilinos X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=e32c80d35cdfdad2b17c6dc22a88d852ce2f7374;p=dealii-svn.git Mention Trilinos git-svn-id: https://svn.dealii.org/trunk@15887 0785d39b-7218-0410-832d-ea1e28bc413d --- diff --git a/deal.II/doc/doxygen/headers/software.h b/deal.II/doc/doxygen/headers/software.h index 8c81485ec8..c86d734048 100644 --- a/deal.II/doc/doxygen/headers/software.h +++ b/deal.II/doc/doxygen/headers/software.h @@ -2,7 +2,7 @@ // $Id$ // Version: $Name$ // -// Copyright (C) 2005, 2006, 2007 by the deal.II authors +// Copyright (C) 2005, 2006, 2007, 2008 by the deal.II authors // // This file is subject to QPL and may not be distributed // without copyright and license information. Please refer @@ -100,11 +100,29 @@ * namespace, that allow the use of PETSc in much the same way as deal.II's * own linear algebra classes are used. The use of these wrappers is explained * in the step-17 and step-18 example programs, as well as in the @ref - * PETScWrappers module. + * PETScWrappers module. The ReadMe file + * explains how to configure deal.II to use PETSc. * * PETSc can be obtained from http://www.mcs.anl.gov/petsc/. * * + * @subsection SoftwareTrilinos Trilinos + * + * Trilinos, like @ref SoftwarePETSc, is a library that supports, among other + * things of interest to numerical computations, a large number of linear + * algebra data structures and algorithms. It, too, can work on parallel + * clusters. + * + * Currently, we do not have wrapper classes that make Trilinos objects look + * like deal.II objects. However, our Makefiles are setup so that programs + * using Trilinos classes are automatically linked against the Trilinos + * libraries, and header files are found automatically. The ReadMe file explains how to configure deal.II + * to use this feature. + * + * Trilinos can be obtained from http://trilinos.sandia.org. + * + * * @subsection SoftwareMETIS METIS * * METIS is a tool that allows to partition a graph into chunks of roughly