AMDiS/lib/mtl4/CTestConfig.cmake

+## This file should be placed in the root directory of your project.
+## Then modify the CMakeLists.txt file in the root directory of your
+## project to incorporate the testing dashboard.
+## # The following are required to uses Dart and the Cdash dashboard
+##   ENABLE_TESTING()
+##   INCLUDE(CTest)
+set(CTEST_PROJECT_NAME "mtl4")
+set(CTEST_NIGHTLY_START_TIME "00:00:00 CEST")
+
+set(CTEST_DROP_METHOD "http")
+set(CTEST_DROP_SITE "simunova.zih.tu-dresden.de")
+set(CTEST_DROP_LOCATION "/CDash/submit.php?project=mtl4")
+set(CTEST_DROP_SITE_CDASH TRUE)
+# set(CTEST_CURL_OPTIONS "CURLOPT_SSL_VERIFYPEER_OFF")
+
+# build in parallel if not on Windows
+# if (NOT MSVC)
+#   message("now with make -j4")
+#   set(CTEST_BUILD_FLAGS -j4)
+# endif()
+
+while (${CTEST_ELAPSED_TIME} LESS 36)
+    set (START_TIME ${CTEST_ELAPSED_TIME})
+  ctest_start (Continuous)
+   ctest_sleep( ${START_TIME} 3 ${CTEST_ELAPSED_TIME})
+endwhile()

AMDiS/lib/mtl4/Doxyfile

+# Doxyfile 1.6.3
+
+# This file describes the settings to be used by the documentation system
+# doxygen (www.doxygen.org) for a project
+#
+# All text after a hash (#) is considered a comment and will be ignored
+# The format is:
+#       TAG = value [value, ...]
+# For lists items can also be appended using:
+#       TAG += value [value, ...]
+# Values that contain spaces should be placed between quotes (" ")
+
+#---------------------------------------------------------------------------
+# Project related configuration options
+#---------------------------------------------------------------------------
+
+# This tag specifies the encoding used for all characters in the config file
+# that follow. The default is UTF-8 which is also the encoding used for all
+# text before the first occurrence of this tag. Doxygen uses libiconv (or the
+# iconv built into libc) for the transcoding. See
+# http://www.gnu.org/software/libiconv for the list of possible encodings.
+
+DOXYFILE_ENCODING      = UTF-8
+
+# The PROJECT_NAME tag is a single word (or a sequence of words surrounded
+# by quotes) that should identify the project.
+
+PROJECT_NAME           = "MTL 4"
+
+# The PROJECT_NUMBER tag can be used to enter a project or revision number.
+# This could be handy for archiving the generated documentation or
+# if some version control system is used.
+
+PROJECT_NUMBER         = ""
+
+# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute)
+# base path where the generated documentation will be put.
+# If a relative path is entered, it will be relative to the location
+# where doxygen was started. If left blank the current directory will be used.
+
+OUTPUT_DIRECTORY       = libs/numeric/mtl/doc
+
+# If the CREATE_SUBDIRS tag is set to YES, then doxygen will create
+# 4096 sub-directories (in 2 levels) under the output directory of each output
+# format and will distribute the generated files over these directories.
+# Enabling this option can be useful when feeding doxygen a huge amount of
+# source files, where putting all generated files in the same directory would
+# otherwise cause performance problems for the file system.
+
+CREATE_SUBDIRS         = NO
+
+# The OUTPUT_LANGUAGE tag is used to specify the language in which all
+# documentation generated by doxygen is written. Doxygen will use this
+# information to generate all constant output in the proper language.
+# The default language is English, other supported languages are:
+# Afrikaans, Arabic, Brazilian, Catalan, Chinese, Chinese-Traditional,
+# Croatian, Czech, Danish, Dutch, Esperanto, Farsi, Finnish, French, German,
+# Greek, Hungarian, Italian, Japanese, Japanese-en (Japanese with English
+# messages), Korean, Korean-en, Lithuanian, Norwegian, Macedonian, Persian,
+# Polish, Portuguese, Romanian, Russian, Serbian, Serbian-Cyrilic, Slovak,
+# Slovene, Spanish, Swedish, Ukrainian, and Vietnamese.
+
+OUTPUT_LANGUAGE        = English
+
+# If the BRIEF_MEMBER_DESC tag is set to YES (the default) Doxygen will
+# include brief member descriptions after the members that are listed in
+# the file and class documentation (similar to JavaDoc).
+# Set to NO to disable this.
+
+BRIEF_MEMBER_DESC      = YES
+
+# If the REPEAT_BRIEF tag is set to YES (the default) Doxygen will prepend
+# the brief description of a member or function before the detailed description.
+# Note: if both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
+# brief descriptions will be completely suppressed.
+
+REPEAT_BRIEF           = YES
+
+# This tag implements a quasi-intelligent brief description abbreviator
+# that is used to form the text in various listings. Each string
+# in this list, if found as the leading text of the brief description, will be
+# stripped from the text and the result after processing the whole list, is
+# used as the annotated text. Otherwise, the brief description is used as-is.
+# If left blank, the following values are used ("$name" is automatically
+# replaced with the name of the entity): "The $name class" "The $name widget"
+# "The $name file" "is" "provides" "specifies" "contains"
+# "represents" "a" "an" "the"
+
+ABBREVIATE_BRIEF       = "The $name class" \
+                         "The $name widget" \
+                         "The $name file" \
+                         is \
+                         provides \
+                         specifies \
+                         contains \
+                         represents \
+                         a \
+                         an \
+                         the
+
+# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
+# Doxygen will generate a detailed section even if there is only a brief
+# description.
+
+ALWAYS_DETAILED_SEC    = NO
+
+# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
+# inherited members of a class in the documentation of that class as if those
+# members were ordinary class members. Constructors, destructors and assignment
+# operators of the base classes will not be shown.
+
+INLINE_INHERITED_MEMB  = NO
+
+# If the FULL_PATH_NAMES tag is set to YES then Doxygen will prepend the full
+# path before files name in the file list and in the header files. If set
+# to NO the shortest path that makes the file name unique will be used.
+
+FULL_PATH_NAMES        = NO
+
+# If the FULL_PATH_NAMES tag is set to YES then the STRIP_FROM_PATH tag
+# can be used to strip a user-defined part of the path. Stripping is
+# only done if one of the specified strings matches the left-hand part of
+# the path. The tag can be used to show relative paths in the file list.
+# If left blank the directory from which doxygen is run is used as the
+# path to strip.
+
+STRIP_FROM_PATH        = /Volumes/Doxygen/
+
+# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of
+# the path mentioned in the documentation of a class, which tells
+# the reader which header file to include in order to use a class.
+# If left blank only the name of the header file containing the class
+# definition is used. Otherwise one should specify the include paths that
+# are normally passed to the compiler using the -I flag.
+
+STRIP_FROM_INC_PATH    =
+
+# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter
+# (but less readable) file names. This can be useful is your file systems
+# doesn't support long names like on DOS, Mac, or CD-ROM.
+
+SHORT_NAMES            = NO
+
+# If the JAVADOC_AUTOBRIEF tag is set to YES then Doxygen
+# will interpret the first line (until the first dot) of a JavaDoc-style
+# comment as the brief description. If set to NO, the JavaDoc
+# comments will behave just like regular Qt-style comments
+# (thus requiring an explicit @brief command for a brief description.)
+
+JAVADOC_AUTOBRIEF      = NO
+
+# If the QT_AUTOBRIEF tag is set to YES then Doxygen will
+# interpret the first line (until the first dot) of a Qt-style
+# comment as the brief description. If set to NO, the comments
+# will behave just like regular Qt-style comments (thus requiring
+# an explicit \brief command for a brief description.)
+
+QT_AUTOBRIEF           = NO
+
+# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make Doxygen
+# treat a multi-line C++ special comment block (i.e. a block of //! or ///
+# comments) as a brief description. This used to be the default behaviour.
+# The new default is to treat a multi-line C++ comment block as a detailed
+# description. Set this tag to YES if you prefer the old behaviour instead.
+
+MULTILINE_CPP_IS_BRIEF = NO
+
+# If the INHERIT_DOCS tag is set to YES (the default) then an undocumented
+# member inherits the documentation from any documented member that it
+# re-implements.
+
+INHERIT_DOCS           = YES
+
+# If the SEPARATE_MEMBER_PAGES tag is set to YES, then doxygen will produce
+# a new page for each member. If set to NO, the documentation of a member will
+# be part of the file/class/namespace that contains it.
+
+SEPARATE_MEMBER_PAGES  = NO
+
+# The TAB_SIZE tag can be used to set the number of spaces in a tab.
+# Doxygen uses this value to replace tabs by spaces in code fragments.
+
+TAB_SIZE               = 8
+
+# This tag can be used to specify a number of aliases that acts
+# as commands in the documentation. An alias has the form "name=value".
+# For example adding "sideeffect=\par Side Effects:\n" will allow you to
+# put the command \sideeffect (or @sideeffect) in the documentation, which
+# will result in a user-defined paragraph with heading "Side Effects:".
+# You can put \n's in the value part of an alias to insert newlines.
+
+ALIASES                =
+
+# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C
+# sources only. Doxygen will then generate output that is more tailored for C.
+# For instance, some of the names that are used will be different. The list
+# of all members will be omitted, etc.
+
+OPTIMIZE_OUTPUT_FOR_C  = NO
+
+# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java
+# sources only. Doxygen will then generate output that is more tailored for
+# Java. For instance, namespaces will be presented as packages, qualified
+# scopes will look different, etc.
+
+OPTIMIZE_OUTPUT_JAVA   = NO
+
+# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
+# sources only. Doxygen will then generate output that is more tailored for
+# Fortran.
+
+OPTIMIZE_FOR_FORTRAN   = NO
+
+# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
+# sources. Doxygen will then generate output that is tailored for
+# VHDL.
+
+OPTIMIZE_OUTPUT_VHDL   = NO
+
+# Doxygen selects the parser to use depending on the extension of the files it parses.
+# With this tag you can assign which parser to use for a given extension.
+# Doxygen has a built-in mapping, but you can override or extend it using this tag.
+# The format is ext=language, where ext is a file extension, and language is one of
+# the parsers supported by doxygen: IDL, Java, Javascript, C#, C, C++, D, PHP,
+# Objective-C, Python, Fortran, VHDL, C, C++. For instance to make doxygen treat
+# .inc files as Fortran files (default is PHP), and .f files as C (default is Fortran),
+# use: inc=Fortran f=C. Note that for custom extensions you also need to set
+# FILE_PATTERNS otherwise the files are not read by doxygen.
+
+EXTENSION_MAPPING      =
+
+# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
+# to include (a tag file for) the STL sources as input, then you should
+# set this tag to YES in order to let doxygen match functions declarations and
+# definitions whose arguments contain STL classes (e.g. func(std::string); v.s.
+# func(std::string) {}). This also make the inheritance and collaboration
+# diagrams that involve STL classes more complete and accurate.
+
+BUILTIN_STL_SUPPORT    = NO
+
+# If you use Microsoft's C++/CLI language, you should set this option to YES to
+# enable parsing support.
+
+CPP_CLI_SUPPORT        = NO
+
+# Set the SIP_SUPPORT tag to YES if your project consists of sip sources only.
+# Doxygen will parse them like normal C++ but will assume all classes use public
+# instead of private inheritance when no explicit protection keyword is present.
+
+SIP_SUPPORT            = NO
+
+# For Microsoft's IDL there are propget and propput attributes to indicate getter
+# and setter methods for a property. Setting this option to YES (the default)
+# will make doxygen to replace the get and set methods by a property in the
+# documentation. This will only work if the methods are indeed getting or
+# setting a simple type. If this is not the case, or you want to show the
+# methods anyway, you should set this option to NO.
+
+IDL_PROPERTY_SUPPORT   = YES
+
+# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
+# tag is set to YES, then doxygen will reuse the documentation of the first
+# member in the group (if any) for the other members of the group. By default
+# all members of a group must be documented explicitly.
+
+DISTRIBUTE_GROUP_DOC   = NO
+
+# Set the SUBGROUPING tag to YES (the default) to allow class member groups of
+# the same type (for instance a group of public functions) to be put as a
+# subgroup of that type (e.g. under the Public Functions section). Set it to
+# NO to prevent subgrouping. Alternatively, this can be done per class using
+# the \nosubgrouping command.
+
+SUBGROUPING            = YES
+
+# When TYPEDEF_HIDES_STRUCT is enabled, a typedef of a struct, union, or enum
+# is documented as struct, union, or enum with the name of the typedef. So
+# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
+# with name TypeT. When disabled the typedef will appear as a member of a file,
+# namespace, or class. And the struct will be named TypeS. This can typically
+# be useful for C code in case the coding convention dictates that all compound
+# types are typedef'ed and only the typedef is referenced, never the tag name.
+
+TYPEDEF_HIDES_STRUCT   = NO
+
+# The SYMBOL_CACHE_SIZE determines the size of the internal cache use to
+# determine which symbols to keep in memory and which to flush to disk.
+# When the cache is full, less often used symbols will be written to disk.
+# For small to medium size projects (<1000 input files) the default value is
+# probably good enough. For larger projects a too small cache size can cause
+# doxygen to be busy swapping symbols to and from disk most of the time
+# causing a significant performance penality.
+# If the system has enough physical memory increasing the cache will improve the
+# performance by keeping more symbols in memory. Note that the value works on
+# a logarithmic scale so increasing the size by one will rougly double the
+# memory usage. The cache size is given by this formula:
+# 2^(16+SYMBOL_CACHE_SIZE). The valid range is 0..9, the default is 0,
+# corresponding to a cache size of 2^16 = 65536 symbols
+
+SYMBOL_CACHE_SIZE      = 0
+
+#---------------------------------------------------------------------------
+# Build related configuration options
+#---------------------------------------------------------------------------
+
+# If the EXTRACT_ALL tag is set to YES doxygen will assume all entities in
+# documentation are documented, even if no documentation was available.
+# Private class members and static file members will be hidden unless
+# the EXTRACT_PRIVATE and EXTRACT_STATIC tags are set to YES
+
+EXTRACT_ALL            = NO
+
+# If the EXTRACT_PRIVATE tag is set to YES all private members of a class
+# will be included in the documentation.
+
+EXTRACT_PRIVATE        = NO
+
+# If the EXTRACT_STATIC tag is set to YES all static members of a file
+# will be included in the documentation.
+
+EXTRACT_STATIC         = NO
+
+# If the EXTRACT_LOCAL_CLASSES tag is set to YES classes (and structs)
+# defined locally in source files will be included in the documentation.
+# If set to NO only classes defined in header files are included.
+
+EXTRACT_LOCAL_CLASSES  = YES
+
+# This flag is only useful for Objective-C code. When set to YES local
+# methods, which are defined in the implementation section but not in
+# the interface are included in the documentation.
+# If set to NO (the default) only methods in the interface are included.
+
+EXTRACT_LOCAL_METHODS  = NO
+
+# If this flag is set to YES, the members of anonymous namespaces will be
+# extracted and appear in the documentation as a namespace called
+# 'anonymous_namespace{file}', where file will be replaced with the base
+# name of the file that contains the anonymous namespace. By default
+# anonymous namespace are hidden.
+
+EXTRACT_ANON_NSPACES   = NO
+
+# If the HIDE_UNDOC_MEMBERS tag is set to YES, Doxygen will hide all
+# undocumented members of documented classes, files or namespaces.
+# If set to NO (the default) these members will be included in the
+# various overviews, but no documentation section is generated.
+# This option has no effect if EXTRACT_ALL is enabled.
+
+HIDE_UNDOC_MEMBERS     = YES
+
+# If the HIDE_UNDOC_CLASSES tag is set to YES, Doxygen will hide all
+# undocumented classes that are normally visible in the class hierarchy.
+# If set to NO (the default) these classes will be included in the various
+# overviews. This option has no effect if EXTRACT_ALL is enabled.
+
+HIDE_UNDOC_CLASSES     = YES
+
+# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, Doxygen will hide all
+# friend (class|struct|union) declarations.
+# If set to NO (the default) these declarations will be included in the
+# documentation.
+
+HIDE_FRIEND_COMPOUNDS  = NO
+
+# If the HIDE_IN_BODY_DOCS tag is set to YES, Doxygen will hide any
+# documentation blocks found inside the body of a function.
+# If set to NO (the default) these blocks will be appended to the
+# function's detailed documentation block.
+
+HIDE_IN_BODY_DOCS      = NO
+
+# The INTERNAL_DOCS tag determines if documentation
+# that is typed after a \internal command is included. If the tag is set
+# to NO (the default) then the documentation will be excluded.
+# Set it to YES to include the internal documentation.
+
+INTERNAL_DOCS          = NO
+
+# If the CASE_SENSE_NAMES tag is set to NO then Doxygen will only generate
+# file names in lower-case letters. If set to YES upper-case letters are also
+# allowed. This is useful if you have classes or files whose names only differ
+# in case and if your file system supports case sensitive file names. Windows
+# and Mac users are advised to set this option to NO.
+
+CASE_SENSE_NAMES       = NO
+
+# If the HIDE_SCOPE_NAMES tag is set to NO (the default) then Doxygen
+# will show members with their full class and namespace scopes in the
+# documentation. If set to YES the scope will be hidden.
+
+HIDE_SCOPE_NAMES       = NO
+
+# If the SHOW_INCLUDE_FILES tag is set to YES (the default) then Doxygen
+# will put a list of the files that are included by a file in the documentation
+# of that file.
+
+SHOW_INCLUDE_FILES     = YES
+
+# If the FORCE_LOCAL_INCLUDES tag is set to YES then Doxygen
+# will list include files with double quotes in the documentation
+# rather than with sharp brackets.
+
+FORCE_LOCAL_INCLUDES   = NO
+
+# If the INLINE_INFO tag is set to YES (the default) then a tag [inline]
+# is inserted in the documentation for inline members.
+
+INLINE_INFO            = YES
+
+# If the SORT_MEMBER_DOCS tag is set to YES (the default) then doxygen
+# will sort the (detailed) documentation of file and class members
+# alphabetically by member name. If set to NO the members will appear in
+# declaration order.
+
+SORT_MEMBER_DOCS       = YES
+
+# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the
+# brief documentation of file, namespace and class members alphabetically
+# by member name. If set to NO (the default) the members will appear in
+# declaration order.
+
+SORT_BRIEF_DOCS        = NO
+
+# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen
+# will sort the (brief and detailed) documentation of class members so that
+# constructors and destructors are listed first. If set to NO (the default)
+# the constructors will appear in the respective orders defined by
+# SORT_MEMBER_DOCS and SORT_BRIEF_DOCS.
+# This tag will be ignored for brief docs if SORT_BRIEF_DOCS is set to NO
+# and ignored for detailed docs if SORT_MEMBER_DOCS is set to NO.
+
+SORT_MEMBERS_CTORS_1ST = NO
+
+# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the
+# hierarchy of group names into alphabetical order. If set to NO (the default)
+# the group names will appear in their defined order.
+
+SORT_GROUP_NAMES       = NO
+
+# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be
+# sorted by fully-qualified names, including namespaces. If set to
+# NO (the default), the class list will be sorted only by class name,
+# not including the namespace part.
+# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
+# Note: This option applies only to the class list, not to the
+# alphabetical list.
+
+SORT_BY_SCOPE_NAME     = NO
+
+# The GENERATE_TODOLIST tag can be used to enable (YES) or
+# disable (NO) the todo list. This list is created by putting \todo
+# commands in the documentation.
+
+GENERATE_TODOLIST      = YES
+
+# The GENERATE_TESTLIST tag can be used to enable (YES) or
+# disable (NO) the test list. This list is created by putting \test
+# commands in the documentation.
+
+GENERATE_TESTLIST      = YES
+
+# The GENERATE_BUGLIST tag can be used to enable (YES) or
+# disable (NO) the bug list. This list is created by putting \bug
+# commands in the documentation.
+
+GENERATE_BUGLIST       = YES
+
+# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or
+# disable (NO) the deprecated list. This list is created by putting
+# \deprecated commands in the documentation.
+
+GENERATE_DEPRECATEDLIST= YES
+
+# The ENABLED_SECTIONS tag can be used to enable conditional
+# documentation sections, marked by \if sectionname ... \endif.
+
+ENABLED_SECTIONS       =
+
+# The MAX_INITIALIZER_LINES tag determines the maximum number of lines
+# the initial value of a variable or define consists of for it to appear in
+# the documentation. If the initializer consists of more lines than specified
+# here it will be hidden. Use a value of 0 to hide initializers completely.
+# The appearance of the initializer of individual variables and defines in the
+# documentation can be controlled using \showinitializer or \hideinitializer
+# command in the documentation regardless of this setting.
+
+MAX_INITIALIZER_LINES  = 30
+
+# Set the SHOW_USED_FILES tag to NO to disable the list of files generated
+# at the bottom of the documentation of classes and structs. If set to YES the
+# list will mention the files that were used to generate the documentation.
+
+SHOW_USED_FILES        = YES
+
+# If the sources in your project are distributed over multiple directories
+# then setting the SHOW_DIRECTORIES tag to YES will show the directory hierarchy
+# in the documentation. The default is NO.
+
+SHOW_DIRECTORIES       = NO
+
+# Set the SHOW_FILES tag to NO to disable the generation of the Files page.
+# This will remove the Files entry from the Quick Index and from the
+# Folder Tree View (if specified). The default is YES.
+
+SHOW_FILES             = YES
+
+# Set the SHOW_NAMESPACES tag to NO to disable the generation of the
+# Namespaces page.  This will remove the Namespaces entry from the Quick Index
+# and from the Folder Tree View (if specified). The default is YES.
+
+SHOW_NAMESPACES        = YES
+
+# The FILE_VERSION_FILTER tag can be used to specify a program or script that
+# doxygen should invoke to get the current version for each file (typically from
+# the version control system). Doxygen will invoke the program by executing (via
+# popen()) the command <command> <input-file>, where <command> is the value of
+# the FILE_VERSION_FILTER tag, and <input-file> is the name of an input file
+# provided by doxygen. Whatever the program writes to standard output
+# is used as the file version. See the manual for examples.
+
+FILE_VERSION_FILTER    =
+
+# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed by
+# doxygen. The layout file controls the global structure of the generated output files
+# in an output format independent way. The create the layout file that represents
+# doxygen's defaults, run doxygen with the -l option. You can optionally specify a
+# file name after the option, if omitted DoxygenLayout.xml will be used as the name
+# of the layout file.
+
+LAYOUT_FILE            =
+
+#---------------------------------------------------------------------------
+# configuration options related to warning and progress messages
+#---------------------------------------------------------------------------
+
+# The QUIET tag can be used to turn on/off the messages that are generated
+# by doxygen. Possible values are YES and NO. If left blank NO is used.
+
+QUIET                  = NO
+
+# The WARNINGS tag can be used to turn on/off the warning messages that are
+# generated by doxygen. Possible values are YES and NO. If left blank
+# NO is used.
+
+WARNINGS               = YES
+
+# If WARN_IF_UNDOCUMENTED is set to YES, then doxygen will generate warnings
+# for undocumented members. If EXTRACT_ALL is set to YES then this flag will
+# automatically be disabled.
+
+WARN_IF_UNDOCUMENTED   = YES
+
+# If WARN_IF_DOC_ERROR is set to YES, doxygen will generate warnings for
+# potential errors in the documentation, such as not documenting some
+# parameters in a documented function, or documenting parameters that
+# don't exist or using markup commands wrongly.
+
+WARN_IF_DOC_ERROR      = YES
+
+# This WARN_NO_PARAMDOC option can be abled to get warnings for
+# functions that are documented, but have no documentation for their parameters
+# or return value. If set to NO (the default) doxygen will only warn about
+# wrong or incomplete parameter documentation, but not about the absence of
+# documentation.
+
+WARN_NO_PARAMDOC       = NO
+
+# The WARN_FORMAT tag determines the format of the warning messages that
+# doxygen can produce. The string should contain the $file, $line, and $text
+# tags, which will be replaced by the file and line number from which the
+# warning originated and the warning text. Optionally the format may contain
+# $version, which will be replaced by the version of the file (if it could
+# be obtained via FILE_VERSION_FILTER)
+
+WARN_FORMAT            = "$file:$line: $text"
+
+# The WARN_LOGFILE tag can be used to specify a file to which warning
+# and error messages should be written. If left blank the output is written
+# to stderr.
+
+WARN_LOGFILE           =
+
+#---------------------------------------------------------------------------
+# configuration options related to the input files
+#---------------------------------------------------------------------------
+
+# The INPUT tag can be used to specify the files and/or directories that contain
+# documented source files. You may enter file names like "myfile.cpp" or
+# directories like "/usr/src/myproject". Separate the files or directories
+# with spaces.
+
+INPUT                  = .
+
+# This tag can be used to specify the character encoding of the source files
+# that doxygen parses. Internally doxygen uses the UTF-8 encoding, which is
+# also the default input encoding. Doxygen uses libiconv (or the iconv built
+# into libc) for the transcoding. See http://www.gnu.org/software/libiconv for
+# the list of possible encodings.
+
+INPUT_ENCODING         = UTF-8
+
+# If the value of the INPUT tag contains directories, you can use the
+# FILE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp
+# and *.h) to filter out the source-files in the directories. If left
+# blank the following patterns are tested:
+# *.c *.cc *.cxx *.cpp *.c++ *.java *.ii *.ixx *.ipp *.i++ *.inl *.h *.hh *.hxx
+# *.hpp *.h++ *.idl *.odl *.cs *.php *.php3 *.inc *.m *.mm *.py *.f90
+
+FILE_PATTERNS          = *.c \
+                         *.cc \
+                         *.cxx \
+                         *.cpp \
+                         *.c++ \
+                         *.d \
+                         *.java \
+                         *.ii \
+                         *.ixx \
+                         *.ipp \
+                         *.i++ \
+                         *.inl \
+                         *.h \
+                         *.hh \
+                         *.hxx \
+                         *.hpp \
+                         *.h++ \
+                         *.idl \
+                         *.odl \
+                         *.cs \
+                         *.php \
+                         *.php3 \
+                         *.inc \
+                         *.m \
+                         *.mm \
+                         *.dox \
+                         *.py \
+                         *.C \
+                         *.CC \
+                         *.C++ \
+                         *.II \
+                         *.I++ \
+                         *.H \
+                         *.HH \
+                         *.H++ \
+                         *.CS \
+                         *.PHP \
+                         *.PHP3 \
+                         *.M \
+                         *.MM \
+                         *.PY
+
+# The RECURSIVE tag can be used to turn specify whether or not subdirectories
+# should be searched for input files as well. Possible values are YES and NO.
+# If left blank NO is used.
+
+RECURSIVE              = YES
+
+# The EXCLUDE tag can be used to specify files and/or directories that should
+# excluded from the INPUT source files. This way you can easily exclude a
+# subdirectory from a directory tree whose root is specified with the INPUT tag.
+
+EXCLUDE                = libs/numeric/mtl/doc/* \
+                         libs/numeric/mtl/doc-complete/* \
+                         packages
+
+# The EXCLUDE_SYMLINKS tag can be used select whether or not files or
+# directories that are symbolic links (a Unix filesystem feature) are excluded
+# from the input.
+
+EXCLUDE_SYMLINKS       = NO
+
+# If the value of the INPUT tag contains directories, you can use the
+# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
+# certain files from those directories. Note that the wildcards are matched
+# against the file with absolute path, so to exclude all test directories
+# for example use the pattern */test/*
+
+EXCLUDE_PATTERNS       = .svn
+
+# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
+# (namespaces, classes, functions, etc.) that should be excluded from the
+# output. The symbol name can be a fully qualified name, a word, or if the
+# wildcard * is used, a substring. Examples: ANamespace, AClass,
+# AClass::ANamespace, ANamespace::*Test
+
+EXCLUDE_SYMBOLS        =
+
+# The EXAMPLE_PATH tag can be used to specify one or more files or
+# directories that contain example code fragments that are included (see
+# the \include command).
+
+EXAMPLE_PATH           = libs/numeric/mtl/examples \
+                         boost/numeric/itl/krylov \
+			 libs/numeric/mtl/experimental
+
+# If the value of the EXAMPLE_PATH tag contains directories, you can use the
+# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp
+# and *.h) to filter out the source-files in the directories. If left
+# blank all files are included.
+
+EXAMPLE_PATTERNS       = *.*pp
+
+# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
+# searched for input files to be used with the \include or \dontinclude
+# commands irrespective of the value of the RECURSIVE tag.
+# Possible values are YES and NO. If left blank NO is used.
+
+EXAMPLE_RECURSIVE      = NO
+
+# The IMAGE_PATH tag can be used to specify one or more files or
+# directories that contain image that are included in the documentation (see
+# the \image command).
+
+IMAGE_PATH             = libs/numeric/mtl/examples/images
+
+# The INPUT_FILTER tag can be used to specify a program that doxygen should
+# invoke to filter for each input file. Doxygen will invoke the filter program
+# by executing (via popen()) the command <filter> <input-file>, where <filter>
+# is the value of the INPUT_FILTER tag, and <input-file> is the name of an
+# input file. Doxygen will then use the output that the filter program writes
+# to standard output.  If FILTER_PATTERNS is specified, this tag will be
+# ignored.
+
+INPUT_FILTER           =
+
+# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
+# basis.  Doxygen will compare the file name with each pattern and apply the
+# filter if there is a match.  The filters are a list of the form:
+# pattern=filter (like *.cpp=my_cpp_filter). See INPUT_FILTER for further
+# info on how filters are used. If FILTER_PATTERNS is empty, INPUT_FILTER
+# is applied to all files.
+
+FILTER_PATTERNS        =
+
+# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
+# INPUT_FILTER) will be used to filter the input files when producing source
+# files to browse (i.e. when SOURCE_BROWSER is set to YES).
+
+FILTER_SOURCE_FILES    = NO
+
+#---------------------------------------------------------------------------
+# configuration options related to source browsing
+#---------------------------------------------------------------------------
+
+# If the SOURCE_BROWSER tag is set to YES then a list of source files will
+# be generated. Documented entities will be cross-referenced with these sources.
+# Note: To get rid of all source code in the generated output, make sure also
+# VERBATIM_HEADERS is set to NO.
+
+SOURCE_BROWSER         = YES
+
+# Setting the INLINE_SOURCES tag to YES will include the body
+# of functions and classes directly in the documentation.
+
+INLINE_SOURCES         = NO
+
+# Setting the STRIP_CODE_COMMENTS tag to YES (the default) will instruct
+# doxygen to hide any special comment blocks from generated source code
+# fragments. Normal C and C++ comments will always remain visible.
+
+STRIP_CODE_COMMENTS    = YES
+
+# If the REFERENCED_BY_RELATION tag is set to YES
+# then for each documented function all documented
+# functions referencing it will be listed.
+
+REFERENCED_BY_RELATION = NO
+
+# If the REFERENCES_RELATION tag is set to YES
+# then for each documented function all documented entities
+# called/used by that function will be listed.
+
+REFERENCES_RELATION    = NO
+
+# If the REFERENCES_LINK_SOURCE tag is set to YES (the default)
+# and SOURCE_BROWSER tag is set to YES, then the hyperlinks from
+# functions in REFERENCES_RELATION and REFERENCED_BY_RELATION lists will
+# link to the source code.  Otherwise they will link to the documentation.
+
+REFERENCES_LINK_SOURCE = YES
+
+# If the USE_HTAGS tag is set to YES then the references to source code
+# will point to the HTML generated by the htags(1) tool instead of doxygen
+# built-in source browser. The htags tool is part of GNU's global source
+# tagging system (see http://www.gnu.org/software/global/global.html). You
+# will need version 4.8.6 or higher.
+
+USE_HTAGS              = NO
+
+# If the VERBATIM_HEADERS tag is set to YES (the default) then Doxygen
+# will generate a verbatim copy of the header file for each class for
+# which an include is specified. Set to NO to disable this.
+
+VERBATIM_HEADERS       = YES
+
+#---------------------------------------------------------------------------
+# configuration options related to the alphabetical class index
+#---------------------------------------------------------------------------
+
+# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index
+# of all compounds will be generated. Enable this if the project
+# contains a lot of classes, structs, unions or interfaces.
+
+ALPHABETICAL_INDEX     = YES
+
+# If the alphabetical index is enabled (see ALPHABETICAL_INDEX) then
+# the COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns
+# in which this list will be split (can be a number in the range [1..20])
+
+COLS_IN_ALPHA_INDEX    = 5
+
+# In case all classes in a project start with a common prefix, all
+# classes will be put under the same header in the alphabetical index.
+# The IGNORE_PREFIX tag can be used to specify one or more prefixes that
+# should be ignored while generating the index headers.
+
+IGNORE_PREFIX          =
+
+#---------------------------------------------------------------------------
+# configuration options related to the HTML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_HTML tag is set to YES (the default) Doxygen will
+# generate HTML output.
+
+GENERATE_HTML          = YES
+
+# The HTML_OUTPUT tag is used to specify where the HTML docs will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be
+# put in front of it. If left blank `html' will be used as the default path.
+
+HTML_OUTPUT            = html
+
+# The HTML_FILE_EXTENSION tag can be used to specify the file extension for
+# each generated HTML page (for example: .htm,.php,.asp). If it is left blank
+# doxygen will generate files with .html extension.
+
+HTML_FILE_EXTENSION    = .html
+
+# The HTML_HEADER tag can be used to specify a personal HTML header for
+# each generated HTML page. If it is left blank doxygen will generate a
+# standard header.
+
+HTML_HEADER            = libs/numeric/mtl/examples/doxygen_header.html
+
+# The HTML_FOOTER tag can be used to specify a personal HTML footer for
+# each generated HTML page. If it is left blank doxygen will generate a
+# standard footer.
+
+HTML_FOOTER            = libs/numeric/mtl/examples/doxygen_footer.html
+
+# The HTML_STYLESHEET tag can be used to specify a user-defined cascading
+# style sheet that is used by each HTML page. It can be used to
+# fine-tune the look of the HTML output. If the tag is left blank doxygen
+# will generate a default style sheet. Note that doxygen will try to copy
+# the style sheet file to the HTML output directory, so don't put your own
+# stylesheet in the HTML output directory as well, or it will be erased!
+
+HTML_STYLESHEET        =
+
+# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML
+# page will contain the date and time when the page was generated. Setting
+# this to NO can help when comparing the output of multiple runs.
+
+HTML_TIMESTAMP         = YES
+
+# If the HTML_ALIGN_MEMBERS tag is set to YES, the members of classes,
+# files or namespaces will be aligned in HTML using tables. If set to
+# NO a bullet list will be used.
+
+HTML_ALIGN_MEMBERS     = YES
+
+# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
+# documentation will contain sections that can be hidden and shown after the
+# page has loaded. For this to work a browser that supports
+# JavaScript and DHTML is required (for instance Mozilla 1.0+, Firefox
+# Netscape 6.0+, Internet explorer 5.0+, Konqueror, or Safari).
+
+HTML_DYNAMIC_SECTIONS  = NO
+
+# If the GENERATE_DOCSET tag is set to YES, additional index files
+# will be generated that can be used as input for Apple's Xcode 3
+# integrated development environment, introduced with OSX 10.5 (Leopard).
+# To create a documentation set, doxygen will generate a Makefile in the
+# HTML output directory. Running make will produce the docset in that
+# directory and running "make install" will install the docset in
+# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find
+# it at startup.
+# See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html for more information.
+
+GENERATE_DOCSET        = NO
+
+# When GENERATE_DOCSET tag is set to YES, this tag determines the name of the
+# feed. A documentation feed provides an umbrella under which multiple
+# documentation sets from a single provider (such as a company or product suite)
+# can be grouped.
+
+DOCSET_FEEDNAME        = "Doxygen generated docs"
+
+# When GENERATE_DOCSET tag is set to YES, this tag specifies a string that
+# should uniquely identify the documentation set bundle. This should be a
+# reverse domain-name style string, e.g. com.mycompany.MyDocSet. Doxygen
+# will append .docset to the name.
+
+DOCSET_BUNDLE_ID       = org.doxygen.Project
+
+# If the GENERATE_HTMLHELP tag is set to YES, additional index files
+# will be generated that can be used as input for tools like the
+# Microsoft HTML help workshop to generate a compiled HTML help file (.chm)
+# of the generated HTML documentation.
+
+GENERATE_HTMLHELP      = NO
+
+# If the GENERATE_HTMLHELP tag is set to YES, the CHM_FILE tag can
+# be used to specify the file name of the resulting .chm file. You
+# can add a path in front of the file if the result should not be
+# written to the html output directory.
+
+CHM_FILE               =
+
+# If the GENERATE_HTMLHELP tag is set to YES, the HHC_LOCATION tag can
+# be used to specify the location (absolute path including file name) of
+# the HTML help compiler (hhc.exe). If non-empty doxygen will try to run
+# the HTML help compiler on the generated index.hhp.
+
+HHC_LOCATION           =
+
+# If the GENERATE_HTMLHELP tag is set to YES, the GENERATE_CHI flag
+# controls if a separate .chi index file is generated (YES) or that
+# it should be included in the master .chm file (NO).
+
+GENERATE_CHI           = NO
+
+# If the GENERATE_HTMLHELP tag is set to YES, the CHM_INDEX_ENCODING
+# is used to encode HtmlHelp index (hhk), content (hhc) and project file
+# content.
+
+CHM_INDEX_ENCODING     =
+
+# If the GENERATE_HTMLHELP tag is set to YES, the BINARY_TOC flag
+# controls whether a binary table of contents is generated (YES) or a
+# normal table of contents (NO) in the .chm file.
+
+BINARY_TOC             = NO
+
+# The TOC_EXPAND flag can be set to YES to add extra items for group members
+# to the contents of the HTML help documentation and to the tree view.
+
+TOC_EXPAND             = NO
+
+# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and QHP_VIRTUAL_FOLDER
+# are set, an additional index file will be generated that can be used as input for
+# Qt's qhelpgenerator to generate a Qt Compressed Help (.qch) of the generated
+# HTML documentation.
+
+GENERATE_QHP           = NO
+
+# If the QHG_LOCATION tag is specified, the QCH_FILE tag can
+# be used to specify the file name of the resulting .qch file.
+# The path specified is relative to the HTML output folder.
+
+QCH_FILE               =
+
+# The QHP_NAMESPACE tag specifies the namespace to use when generating
+# Qt Help Project output. For more information please see
+# http://doc.trolltech.com/qthelpproject.html#namespace
+
+QHP_NAMESPACE          = org.doxygen.Project
+
+# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating
+# Qt Help Project output. For more information please see
+# http://doc.trolltech.com/qthelpproject.html#virtual-folders
+
+QHP_VIRTUAL_FOLDER     = doc
+
+# If QHP_CUST_FILTER_NAME is set, it specifies the name of a custom filter to add.
+# For more information please see
+# http://doc.trolltech.com/qthelpproject.html#custom-filters
+
+QHP_CUST_FILTER_NAME   =
+
+# The QHP_CUST_FILT_ATTRS tag specifies the list of the attributes of the custom filter to add.For more information please see
+# <a href="http://doc.trolltech.com/qthelpproject.html#custom-filters">Qt Help Project / Custom Filters</a>.
+
+QHP_CUST_FILTER_ATTRS  =
+
+# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this project's
+# filter section matches.
+# <a href="http://doc.trolltech.com/qthelpproject.html#filter-attributes">Qt Help Project / Filter Attributes</a>.
+
+QHP_SECT_FILTER_ATTRS  =
+
+# If the GENERATE_QHP tag is set to YES, the QHG_LOCATION tag can
+# be used to specify the location of Qt's qhelpgenerator.
+# If non-empty doxygen will try to run qhelpgenerator on the generated
+# .qhp file.
+
+QHG_LOCATION           =
+
+# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files
+# will be generated, which together with the HTML files, form an Eclipse help
+# plugin. To install this plugin and make it available under the help contents
+# menu in Eclipse, the contents of the directory containing the HTML and XML
+# files needs to be copied into the plugins directory of eclipse. The name of
+# the directory within the plugins directory should be the same as
+# the ECLIPSE_DOC_ID value. After copying Eclipse needs to be restarted before
+# the help appears.
+
+GENERATE_ECLIPSEHELP   = NO
+
+# A unique identifier for the eclipse help plugin. When installing the plugin
+# the directory name containing the HTML and XML files should also have
+# this name.
+
+ECLIPSE_DOC_ID         = org.doxygen.Project
+
+# The DISABLE_INDEX tag can be used to turn on/off the condensed index at
+# top of each HTML page. The value NO (the default) enables the index and
+# the value YES disables it.
+
+DISABLE_INDEX          = NO
+
+# This tag can be used to set the number of enum values (range [1..20])
+# that doxygen will group on one line in the generated HTML documentation.
+
+ENUM_VALUES_PER_LINE   = 4
+
+# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
+# structure should be generated to display hierarchical information.
+# If the tag value is set to YES, a side panel will be generated
+# containing a tree-like index structure (just like the one that
+# is generated for HTML Help). For this to work a browser that supports
+# JavaScript, DHTML, CSS and frames is required (i.e. any modern browser).
+# Windows users are probably better off using the HTML help feature.
+
+GENERATE_TREEVIEW      = NO
+
+# By enabling USE_INLINE_TREES, doxygen will generate the Groups, Directories,
+# and Class Hierarchy pages using a tree view instead of an ordered list.
+
+USE_INLINE_TREES       = NO
+
+# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be
+# used to set the initial width (in pixels) of the frame in which the tree
+# is shown.
+
+TREEVIEW_WIDTH         = 250
+
+# Use this tag to change the font size of Latex formulas included
+# as images in the HTML documentation. The default is 10. Note that
+# when you change the font size after a successful doxygen run you need
+# to manually remove any form_*.png images from the HTML output directory
+# to force them to be regenerated.
+
+FORMULA_FONTSIZE       = 10
+
+# When the SEARCHENGINE tag is enabled doxygen will generate a search box
+# for the HTML output. The underlying search engine uses javascript
+# and DHTML and should work on any modern browser. Note that when using
+# HTML help (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets
+# (GENERATE_DOCSET) there is already a search function so this one should
+# typically be disabled. For large projects the javascript based search engine
+# can be slow, then enabling SERVER_BASED_SEARCH may provide a better solution.
+
+SEARCHENGINE           = NO
+
+# When the SERVER_BASED_SEARCH tag is enabled the search engine will be
+# implemented using a PHP enabled web server instead of at the web client
+# using Javascript. Doxygen will generate the search PHP script and index
+# file to put on the web server. The advantage of the server
+# based approach is that it scales better to large projects and allows
+# full text search. The disadvances is that it is more difficult to setup
+# and does not have live searching capabilities.
+
+SERVER_BASED_SEARCH    = NO
+
+#---------------------------------------------------------------------------
+# configuration options related to the LaTeX output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_LATEX tag is set to YES (the default) Doxygen will
+# generate Latex output.
+
+GENERATE_LATEX         = YES
+
+# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be
+# put in front of it. If left blank `latex' will be used as the default path.
+
+LATEX_OUTPUT           = latex
+
+# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
+# invoked. If left blank `latex' will be used as the default command name.
+# Note that when enabling USE_PDFLATEX this option is only used for
+# generating bitmaps for formulas in the HTML output, but not in the
+# Makefile that is written to the output directory.
+
+LATEX_CMD_NAME         = latex
+
+# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to
+# generate index for LaTeX. If left blank `makeindex' will be used as the
+# default command name.
+
+MAKEINDEX_CMD_NAME     = makeindex
+
+# If the COMPACT_LATEX tag is set to YES Doxygen generates more compact
+# LaTeX documents. This may be useful for small projects and may help to
+# save some trees in general.
+
+COMPACT_LATEX          = NO
+
+# The PAPER_TYPE tag can be used to set the paper type that is used
+# by the printer. Possible values are: a4, a4wide, letter, legal and
+# executive. If left blank a4wide will be used.
+
+PAPER_TYPE             = letter
+
+# The EXTRA_PACKAGES tag can be to specify one or more names of LaTeX
+# packages that should be included in the LaTeX output.
+
+EXTRA_PACKAGES         =
+
+# The LATEX_HEADER tag can be used to specify a personal LaTeX header for
+# the generated latex document. The header should contain everything until
+# the first chapter. If it is left blank doxygen will generate a
+# standard header. Notice: only use this tag if you know what you are doing!
+
+LATEX_HEADER           =
+
+# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated
+# is prepared for conversion to pdf (using ps2pdf). The pdf file will
+# contain links (just like the HTML output) instead of page references
+# This makes the output suitable for online browsing using a pdf viewer.
+
+PDF_HYPERLINKS         = NO
+
+# If the USE_PDFLATEX tag is set to YES, pdflatex will be used instead of
+# plain latex in the generated Makefile. Set this option to YES to get a
+# higher quality PDF documentation.
+
+USE_PDFLATEX           = NO
+
+# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \\batchmode.
+# command to the generated LaTeX files. This will instruct LaTeX to keep
+# running if errors occur, instead of asking the user for help.
+# This option is also used when generating formulas in HTML.
+
+LATEX_BATCHMODE        = NO
+
+# If LATEX_HIDE_INDICES is set to YES then doxygen will not
+# include the index chapters (such as File Index, Compound Index, etc.)
+# in the output.
+
+LATEX_HIDE_INDICES     = NO
+
+# If LATEX_SOURCE_CODE is set to YES then doxygen will include
+# source code with syntax highlighting in the LaTeX output.
+# Note that which sources are shown also depends on other settings
+# such as SOURCE_BROWSER.
+
+LATEX_SOURCE_CODE      = NO
+
+#---------------------------------------------------------------------------
+# configuration options related to the RTF output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_RTF tag is set to YES Doxygen will generate RTF output
+# The RTF output is optimized for Word 97 and may not look very pretty with
+# other RTF readers or editors.
+
+GENERATE_RTF           = NO
+
+# The RTF_OUTPUT tag is used to specify where the RTF docs will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be
+# put in front of it. If left blank `rtf' will be used as the default path.
+
+RTF_OUTPUT             = rtf
+
+# If the COMPACT_RTF tag is set to YES Doxygen generates more compact
+# RTF documents. This may be useful for small projects and may help to
+# save some trees in general.
+
+COMPACT_RTF            = NO
+
+# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated
+# will contain hyperlink fields. The RTF file will
+# contain links (just like the HTML output) instead of page references.
+# This makes the output suitable for online browsing using WORD or other
+# programs which support those fields.
+# Note: wordpad (write) and others do not support links.
+
+RTF_HYPERLINKS         = NO
+
+# Load stylesheet definitions from file. Syntax is similar to doxygen's
+# config file, i.e. a series of assignments. You only have to provide
+# replacements, missing definitions are set to their default value.
+
+RTF_STYLESHEET_FILE    =
+
+# Set optional variables used in the generation of an rtf document.
+# Syntax is similar to doxygen's config file.
+
+RTF_EXTENSIONS_FILE    =
+
+#---------------------------------------------------------------------------
+# configuration options related to the man page output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_MAN tag is set to YES (the default) Doxygen will
+# generate man pages
+
+GENERATE_MAN           = NO
+
+# The MAN_OUTPUT tag is used to specify where the man pages will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be
+# put in front of it. If left blank `man' will be used as the default path.
+
+MAN_OUTPUT             = man
+
+# The MAN_EXTENSION tag determines the extension that is added to
+# the generated man pages (default is the subroutine's section .3)
+
+MAN_EXTENSION          = .3
+
+# If the MAN_LINKS tag is set to YES and Doxygen generates man output,
+# then it will generate one additional man file for each entity
+# documented in the real man page(s). These additional files
+# only source the real man page, but without them the man command
+# would be unable to find the correct page. The default is NO.
+
+MAN_LINKS              = NO
+
+#---------------------------------------------------------------------------
+# configuration options related to the XML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_XML tag is set to YES Doxygen will
+# generate an XML file that captures the structure of
+# the code including all documentation.
+
+GENERATE_XML           = NO
+
+# The XML_OUTPUT tag is used to specify where the XML pages will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be
+# put in front of it. If left blank `xml' will be used as the default path.
+
+XML_OUTPUT             = xml
+
+# The XML_SCHEMA tag can be used to specify an XML schema,
+# which can be used by a validating XML parser to check the
+# syntax of the XML files.
+
+XML_SCHEMA             =
+
+# The XML_DTD tag can be used to specify an XML DTD,
+# which can be used by a validating XML parser to check the
+# syntax of the XML files.
+
+XML_DTD                =
+
+# If the XML_PROGRAMLISTING tag is set to YES Doxygen will
+# dump the program listings (including syntax highlighting
+# and cross-referencing information) to the XML output. Note that
+# enabling this will significantly increase the size of the XML output.
+
+XML_PROGRAMLISTING     = YES
+
+#---------------------------------------------------------------------------
+# configuration options for the AutoGen Definitions output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_AUTOGEN_DEF tag is set to YES Doxygen will
+# generate an AutoGen Definitions (see autogen.sf.net) file
+# that captures the structure of the code including all
+# documentation. Note that this feature is still experimental
+# and incomplete at the moment.
+
+GENERATE_AUTOGEN_DEF   = NO
+
+#---------------------------------------------------------------------------
+# configuration options related to the Perl module output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_PERLMOD tag is set to YES Doxygen will
+# generate a Perl module file that captures the structure of
+# the code including all documentation. Note that this
+# feature is still experimental and incomplete at the
+# moment.
+
+GENERATE_PERLMOD       = NO
+
+# If the PERLMOD_LATEX tag is set to YES Doxygen will generate
+# the necessary Makefile rules, Perl scripts and LaTeX code to be able
+# to generate PDF and DVI output from the Perl module output.
+
+PERLMOD_LATEX          = NO
+
+# If the PERLMOD_PRETTY tag is set to YES the Perl module output will be
+# nicely formatted so it can be parsed by a human reader.  This is useful
+# if you want to understand what is going on.  On the other hand, if this
+# tag is set to NO the size of the Perl module output will be much smaller
+# and Perl will parse it just the same.
+
+PERLMOD_PRETTY         = YES
+
+# The names of the make variables in the generated doxyrules.make file
+# are prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX.
+# This is useful so different doxyrules.make files included by the same
+# Makefile don't overwrite each other's variables.
+
+PERLMOD_MAKEVAR_PREFIX =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the preprocessor
+#---------------------------------------------------------------------------
+
+# If the ENABLE_PREPROCESSING tag is set to YES (the default) Doxygen will
+# evaluate all C-preprocessor directives found in the sources and include
+# files.
+
+ENABLE_PREPROCESSING   = YES
+
+# If the MACRO_EXPANSION tag is set to YES Doxygen will expand all macro
+# names in the source code. If set to NO (the default) only conditional
+# compilation will be performed. Macro expansion can be done in a controlled
+# way by setting EXPAND_ONLY_PREDEF to YES.
+
+MACRO_EXPANSION        = NO
+
+# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES
+# then the macro expansion is limited to the macros specified with the
+# PREDEFINED and EXPAND_AS_DEFINED tags.
+
+EXPAND_ONLY_PREDEF     = NO
+
+# If the SEARCH_INCLUDES tag is set to YES (the default) the includes files
+# in the INCLUDE_PATH (see below) will be search if a #include is found.
+
+SEARCH_INCLUDES        = YES
+
+# The INCLUDE_PATH tag can be used to specify one or more directories that
+# contain include files that are not input files but should be processed by
+# the preprocessor.
+
+INCLUDE_PATH           =
+
+# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
+# patterns (like *.h and *.hpp) to filter out the header-files in the
+# directories. If left blank, the patterns specified with FILE_PATTERNS will
+# be used.
+
+INCLUDE_FILE_PATTERNS  =
+
+# The PREDEFINED tag can be used to specify one or more macro names that
+# are defined before the preprocessor is started (similar to the -D option of
+# gcc). The argument of the tag is a list of macros of the form: name
+# or name=definition (no spaces). If the definition and the = are
+# omitted =1 is assumed. To prevent a macro definition from being
+# undefined via #undef or recursively expanded use the := operator
+# instead of the = operator.
+
+PREDEFINED             = MTL_HAS_UMFPACK MTL_HAS_VPT
+
+# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then
+# this tag can be used to specify a list of macro names that should be expanded.
+# The macro definition that is found in the sources will be used.
+# Use the PREDEFINED tag if you want to use a different macro definition.
+
+EXPAND_AS_DEFINED      =
+
+# If the SKIP_FUNCTION_MACROS tag is set to YES (the default) then
+# doxygen's preprocessor will remove all function-like macros that are alone
+# on a line, have an all uppercase name, and do not end with a semicolon. Such
+# function macros are typically used for boiler-plate code, and will confuse
+# the parser if not removed.
+
+SKIP_FUNCTION_MACROS   = YES
+
+#---------------------------------------------------------------------------
+# Configuration::additions related to external references
+#---------------------------------------------------------------------------
+
+# The TAGFILES option can be used to specify one or more tagfiles.
+# Optionally an initial location of the external documentation
+# can be added for each tagfile. The format of a tag file without
+# this location is as follows:
+#   TAGFILES = file1 file2 ...
+# Adding location for the tag files is done as follows:
+#   TAGFILES = file1=loc1 "file2 = loc2" ...
+# where "loc1" and "loc2" can be relative or absolute paths or
+# URLs. If a location is present for each tag, the installdox tool
+# does not have to be run to correct the links.
+# Note that each tag file must have a unique name
+# (where the name does NOT include the path)
+# If a tag file is not located in the directory in which doxygen
+# is run, you must also specify the path to the tagfile here.
+
+TAGFILES               =
+
+# When a file name is specified after GENERATE_TAGFILE, doxygen will create
+# a tag file that is based on the input files it reads.
+
+GENERATE_TAGFILE       =
+
+# If the ALLEXTERNALS tag is set to YES all external classes will be listed
+# in the class index. If set to NO only the inherited external classes
+# will be listed.
+
+ALLEXTERNALS           = NO
+
+# If the EXTERNAL_GROUPS tag is set to YES all external groups will be listed
+# in the modules index. If set to NO, only the current project's groups will
+# be listed.
+
+EXTERNAL_GROUPS        = YES
+
+# The PERL_PATH should be the absolute path and name of the perl script
+# interpreter (i.e. the result of `which perl').
+
+PERL_PATH              = /usr/bin/perl
+
+#---------------------------------------------------------------------------
+# Configuration options related to the dot tool
+#---------------------------------------------------------------------------
+
+# If the CLASS_DIAGRAMS tag is set to YES (the default) Doxygen will
+# generate a inheritance diagram (in HTML, RTF and LaTeX) for classes with base
+# or super classes. Setting the tag to NO turns the diagrams off. Note that
+# this option is superseded by the HAVE_DOT option below. This is only a
+# fallback. It is recommended to install and use dot, since it yields more
+# powerful graphs.
+
+CLASS_DIAGRAMS         = YES
+
+# You can define message sequence charts within doxygen comments using the \msc
+# command. Doxygen will then run the mscgen tool (see
+# http://www.mcternan.me.uk/mscgen/) to produce the chart and insert it in the
+# documentation. The MSCGEN_PATH tag allows you to specify the directory where
+# the mscgen tool resides. If left empty the tool is assumed to be found in the
+# default search path.
+
+MSCGEN_PATH            =
+
+# If set to YES, the inheritance and collaboration graphs will hide
+# inheritance and usage relations if the target is undocumented
+# or is not a class.
+
+HIDE_UNDOC_RELATIONS   = YES
+
+# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
+# available from the path. This tool is part of Graphviz, a graph visualization
+# toolkit from AT&T and Lucent Bell Labs. The other options in this section
+# have no effect if this option is set to NO (the default)
+
+HAVE_DOT               = YES
+
+# By default doxygen will write a font called FreeSans.ttf to the output
+# directory and reference it in all dot files that doxygen generates. This
+# font does not include all possible unicode characters however, so when you need
+# these (or just want a differently looking font) you can specify the font name
+# using DOT_FONTNAME. You need need to make sure dot is able to find the font,
+# which can be done by putting it in a standard location or by setting the
+# DOTFONTPATH environment variable or by setting DOT_FONTPATH to the directory
+# containing the font.
+
+DOT_FONTNAME           = FreeSans
+
+# The DOT_FONTSIZE tag can be used to set the size of the font of dot graphs.
+# The default size is 10pt.
+
+DOT_FONTSIZE           = 10
+
+# By default doxygen will tell dot to use the output directory to look for the
+# FreeSans.ttf font (which doxygen will put there itself). If you specify a
+# different font using DOT_FONTNAME you can set the path where dot
+# can find it using this tag.
+
+DOT_FONTPATH           =
+
+# If the CLASS_GRAPH and HAVE_DOT tags are set to YES then doxygen
+# will generate a graph for each documented class showing the direct and
+# indirect inheritance relations. Setting this tag to YES will force the
+# the CLASS_DIAGRAMS tag to NO.
+
+CLASS_GRAPH            = YES
+
+# If the COLLABORATION_GRAPH and HAVE_DOT tags are set to YES then doxygen
+# will generate a graph for each documented class showing the direct and
+# indirect implementation dependencies (inheritance, containment, and
+# class references variables) of the class with other documented classes.
+
+COLLABORATION_GRAPH    = YES
+
+# If the GROUP_GRAPHS and HAVE_DOT tags are set to YES then doxygen
+# will generate a graph for groups, showing the direct groups dependencies
+
+GROUP_GRAPHS           = YES
+
+# If the UML_LOOK tag is set to YES doxygen will generate inheritance and
+# collaboration diagrams in a style similar to the OMG's Unified Modeling
+# Language.
+
+UML_LOOK               = NO
+
+# If set to YES, the inheritance and collaboration graphs will show the
+# relations between templates and their instances.
+
+TEMPLATE_RELATIONS     = NO
+
+# If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDE_GRAPH, and HAVE_DOT
+# tags are set to YES then doxygen will generate a graph for each documented
+# file showing the direct and indirect include dependencies of the file with
+# other documented files.
+
+INCLUDE_GRAPH          = YES
+
+# If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDED_BY_GRAPH, and
+# HAVE_DOT tags are set to YES then doxygen will generate a graph for each
+# documented header file showing the documented files that directly or
+# indirectly include this file.
+
+INCLUDED_BY_GRAPH      = YES
+
+# If the CALL_GRAPH and HAVE_DOT options are set to YES then
+# doxygen will generate a call dependency graph for every global function
+# or class method. Note that enabling this option will significantly increase
+# the time of a run. So in most cases it will be better to enable call graphs
+# for selected functions only using the \callgraph command.
+
+CALL_GRAPH             = NO
+
+# If the CALLER_GRAPH and HAVE_DOT tags are set to YES then
+# doxygen will generate a caller dependency graph for every global function
+# or class method. Note that enabling this option will significantly increase
+# the time of a run. So in most cases it will be better to enable caller
+# graphs for selected functions only using the \callergraph command.
+
+CALLER_GRAPH           = NO
+
+# If the GRAPHICAL_HIERARCHY and HAVE_DOT tags are set to YES then doxygen
+# will graphical hierarchy of all classes instead of a textual one.
+
+GRAPHICAL_HIERARCHY    = YES
+
+# If the DIRECTORY_GRAPH, SHOW_DIRECTORIES and HAVE_DOT tags are set to YES
+# then doxygen will show the dependencies a directory has on other directories
+# in a graphical way. The dependency relations are determined by the #include
+# relations between the files in the directories.
+
+DIRECTORY_GRAPH        = YES
+
+# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
+# generated by dot. Possible values are png, jpg, or gif
+# If left blank png will be used.
+
+DOT_IMAGE_FORMAT       = png
+
+# The tag DOT_PATH can be used to specify the path where the dot tool can be
+# found. If left blank, it is assumed the dot tool can be found in the path.
+
+DOT_PATH               = /Volumes/Doxygen/Doxygen.app/Contents/Resources/
+
+# The DOTFILE_DIRS tag can be used to specify one or more directories that
+# contain dot files that are included in the documentation (see the
+# \dotfile command).
+
+DOTFILE_DIRS           =
+
+# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of
+# nodes that will be shown in the graph. If the number of nodes in a graph
+# becomes larger than this value, doxygen will truncate the graph, which is
+# visualized by representing a node as a red box. Note that doxygen if the
+# number of direct children of the root node in a graph is already larger than
+# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note
+# that the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
+
+DOT_GRAPH_MAX_NODES    = 50
+
+# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the
+# graphs generated by dot. A depth value of 3 means that only nodes reachable
+# from the root by following a path via at most 3 edges will be shown. Nodes
+# that lay further from the root node will be omitted. Note that setting this
+# option to 1 or 2 may greatly reduce the computation time needed for large
+# code bases. Also note that the size of a graph can be further restricted by
+# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
+
+MAX_DOT_GRAPH_DEPTH    = 1000
+
+# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
+# background. This is disabled by default, because dot on Windows does not
+# seem to support this out of the box. Warning: Depending on the platform used,
+# enabling this option may lead to badly anti-aliased labels on the edges of
+# a graph (i.e. they become hard to read).
+
+DOT_TRANSPARENT        = NO
+
+# Set the DOT_MULTI_TARGETS tag to YES allow dot to generate multiple output
+# files in one run (i.e. multiple -o and -T options on the command line). This
+# makes dot run faster, but since only newer versions of dot (>1.8.10)
+# support this, this feature is disabled by default.
+
+DOT_MULTI_TARGETS      = NO
+
+# If the GENERATE_LEGEND tag is set to YES (the default) Doxygen will
+# generate a legend page explaining the meaning of the various boxes and
+# arrows in the dot generated graphs.
+
+GENERATE_LEGEND        = YES
+
+# If the DOT_CLEANUP tag is set to YES (the default) Doxygen will
+# remove the intermediate dot files that are used to generate
+# the various graphs.
+
+DOT_CLEANUP            = YES

AMDiS/lib/mtl4/INSTALL

+-*- text -*-
+
+Software License for MTL
+
+Copyright (c) 2007-2008 The Trustees of Indiana University.
+              2008 Dresden University of Technology and the Trustees of Indiana University.
+              2010 SimuNova UG, www.simunova.com.
+All rights reserved.
+Authors: Peter Gottschling and Andrew Lumsdaine
+
+This file is part of the Matrix Template Library
+
+See also tools/license/license.mtl.txt in the distribution.
+---------------------------------------------------------------
+
+              The Matrix Template Library
+                     Version 4
+
+
+I. Installation
+===============
+
+see http://www.simunova.com/node/189

AMDiS/lib/mtl4/MTLConfig.cmake

+set(MTL_COMMON_CONFIG "${MTL_DIR}/tools/cmake/MTLCommon.cmake")
+if( EXISTS ${MTL_COMMON_CONFIG})
+	include(${MTL_COMMON_CONFIG})
+else()
+	message(ERROR "could not find the common mtl configuration. this is possibly a wrong installation of mtl.")
+endif()

AMDiS/lib/mtl4/README

+-*- text -*-
+
+Software License for MTL
+
+Copyright (c) 2007-2008 The Trustees of Indiana University. All rights reserved.
+Authors: Peter Gottschling and Andrew Lumsdaine
+
+This file is part of the Matrix Template Library
+
+See also license.mtl.txt in the distribution.
+---------------------------------------------------------------
+
+              The Matrix Template Library
+                      Version 4
+
+I. Introduction
+===============
+
+The Matrix Template Library is a C++ class library for basic linear
+algebra. The MTL is designed for high-performance while at the same
+time taking advantage of the generic programming paradigm (ala the
+STL) to allow much greater flexibility and breadth of
+functionality. Many new and advanced programming techniques were used
+in the construction of this library.
+
+The MTL is a low level library in the sense that the user must be
+conscious of the matrix type being used, and that all computationally
+expensive operations are explicit. The MTL is not a C++ Matlab or
+Mathematica. Nevertheless, the interface is designed to be simple and easy
+to use.
+
+The matrix types provided include compressed sparse row/column,
+traditional row- and column-major dense, Morton-order, and block-recursive
+matrices. All matrix types share a common and easy to use interface.
+
+The algorithms consist of the traditional basic linear algebra
+routines (from the BLAS level-1 to 3) which includes matrix and vector
+arithmetic.
+
+
+II. Compilers
+=============
+
+The Matrix Template Library is written in compliance with the C++ standard
+and should be compilable with every compiler compliant with the standard.
+It has been tested (and passed) with the following compilers and architectures:
+
+Linux & MacOS
+-------------
+    clang++ 3.0 (32 bit)
+    g++ 4.1.3 (32 and 64 bit)
+    g++ 4.2.4 (64bit)
+    g++ 4.3.4 (32 and 64 bit)
+    g++ 4.4.3 (32 and 64 bit)
+    g++ 4.5.1 (64 bit)
+    g++ 4.6.0 (64 bit)
+    g++ 4.6.1 (64 bit)
+    icc 9.1 (32 and 64 bit)
+    icc 10.0 (32 and 64 bit)
+    icc 10.1 (32 and 64 bit)
+    icc 11.0 (32 and 64 bit)
+    icc 11.1 (32 and 64 bit)
+
+Windows
+-------
+    VC 8.0 from Visual Studio 2005 (32 bit)
+    VC 9.0 from Visual Studio 2008 (32 bit)
+    VC 10.0 from Visual Studio 2010 (32 bit)
+
+Compilers that are not standard-compliant (e.g. VC 6.0 from VS 2003) are not subject to support.
+
+
+III. Documentation
+==================
+
+The documentation can be generated with doxygen in the main directory and
+is found in the /libs/numeric/mtl/doc. You
+can also view the documentation at our web site:
+http://www.simunova.com/node/184
+At the moment, the documentation illustrates the basic operations and
+partially provides a reference manual of some classes and functions.
+A detailed description of more features, especially tuning opportunities,
+is in the works.
+
+There are also a large number of examples in the /libs/numeric/mtl/examples
+directory.
+
+
+IV. Installation Procedure
+==========================
+
+See the file INSTALL in this directory.
+
+
+
+V. Contact Information
+=======================
+
+The Matrix Template Library is available at the main distribution site:
+
+    http://www.mtl4.org
+
+This distribution includes:
+
+    - Source code for the MTL (all header files /boost/numeric/mtl)
+    - Some completing sources (header files /boost/numeric/meta_math)
+    - A test suite (/libs/numeric/mtl/test)
+    - Some example code (/libs/numeric/mtl/examples)
+
+Bug reports should be sent to mtl4@osl.iu.edu.
+
+Questions, comments, suggestions, and requests for additional
+information should also be directed to mtl4@osl.iu.edu.
+
+Subscribe at:
+
+     http://www.osl.iu.edu/mailman/listinfo.cgi/mtl4

AMDiS/lib/mtl4/SConstruct

+import getopt, sys, os, os.path, re, string
+
+######################
+# Helper functions
+######################
+
+# platform-dependent preprocessor definitions
+def macro_flag(env, flag):
+    if sys.platform == 'win32' and conf.env['CC'] == 'cl':
+        return '/D' + flag
+    else:
+        return '-D' + flag
+
+# add debugging flags to environment
+def add_debug(env):
+    if sys.platform == 'win32' and conf.env['CC'] == 'cl':
+        env.Append(CCFLAGS = '/Z7')
+        env.Append(CCFLAGS = '/MDd')
+    else:
+        env.Append(CCFLAGS = '-g')
+    #print macro_flag(env, 'MTL_ASSERT_FOR_THROW')
+    env.Append(CCFLAGS = macro_flag(env, 'MTL_ASSERT_FOR_THROW'))
+
+
+def check_g5():
+    print "platform ", sys.platform
+    if sys.platform == "darwin" :
+
+	system("/usr/bin/system_profiler SPHardwareDataType")
+	profile = os.popen("system_profiler SPHardwareDataType").read()
+	print profile
+	if profile.find("Mac G5") != -1:
+	    print "is G5"
+	    return 1
+    print "isn't G5"
+    return None
+
+
+def add_platform_flags(env):
+    if env['CC'] == 'cl':
+        # Turn off some warnings: 1. for problems with CRTP 2. with VC's own headers
+        #                         3. alleged ambiguos assignment
+        # I hope we find a cleaner way to get rid of this warning
+        wd = ' /wd4355 /wd4996 /wd4522'
+        env.Append(CCFLAGS = '/EHa /D_CONSOLE /D_CRT_SECURE_NO_DEPRECATE /DNOMINMAX' +
+			     ' /D_SECURE_SCL=0' + wd)
+
+        # The following two if shouldn't be necessary
+        # Note that INCLUDE must be split and LIB must not :-P
+        if os.environ.has_key('INCLUDE') :
+            for p in os.environ['INCLUDE'].split(';'):
+                env.Append(CPPPATH = p)
+        if os.environ.has_key('LIB') :
+            env.Append(LIBPATH = os.environ['LIB'])
+
+
+# add optimization flags to environment
+# normal optimization for opt=1, for opt=2 high optimization
+# at the moment additional flags are added in this function
+# -> this needs to be cleaned up!
+def add_opt(env, opt):
+    if int(opt):
+        env.Append(CCFLAGS = macro_flag(env, 'NDEBUG'))
+    if sys.platform == 'win32' and conf.env['CC'] == 'cl':
+        if int(opt) == 1:
+            env.Append(CCFLAGS = '/O2 /Ot /Ob2')
+        elif int(opt) == 2:
+            env.Append(CCFLAGS = '/Ox')
+            env.Append(CCFLAGS = '/MD')
+    else:
+        if int(opt) == 2:
+    	    env.Append(CCFLAGS = '-O3')
+    	    if conf.env['CC'] == 'gcc':
+    	        env.Append(CCFLAGS = '-ffast-math')
+    	        #check_g5()
+            # env.Append(CCFLAGS = '-pg') # for profiling
+    	    # env.Append(LINKFLAGS = '-pg') # for profiling
+        elif int(opt) == 1:
+    	    env.Append(CCFLAGS = '-O2')
+            # env.Append(CCFLAGS = '-pg') # for profiling
+    	    # env.Append(LINKFLAGS = '-pg') # for profiling
+
+    if env['CC'] != 'cl':
+        env.Append(CXXFLAGS = conf.env['CCFLAGS'])
+
+
+def check_no_long_double(conf):
+    cc = conf.env['CC']
+    if cc == 'gcc':
+        # conf.env.Append(CXXFLAGS = '-Werror -Wreorder -pedantic -Wpointer-arith -Wcast-align -Wcast-qual -Wwrite-strings')
+	output = os.popen(cc + " --version").read()
+	st = output.split('\n')[0]
+	tmatch = re.search(".* \(GCC\) (\d\.\d)", st)
+	if tmatch and string.atof(tmatch.group(1)) == 4.0:
+	    conf.env.Append(CCFLAGS = '-Wno-long-double')
+	    # conf.env.Append(CXXFLAGS = '-Wno-long-double')
+
+
+def add_user_opt(env, add_optflag):
+     env.Append(CCFLAGS = add_optflag)
+     env.Append(CXXFLAGS = add_optflag)
+
+###############################
+# check for installed blas ...
+# search different libraries
+###############################
+def detected_blas(env): # blas library found
+   env.Append(CPPDEFINES = 'MTL_HAS_BLAS')
+
+def check_for_blas(env):
+ # symbolname
+ symname = 'dgemm_'
+ found_blas = 0
+
+ # get command line blas path
+ blas_path = ARGUMENTS.get('blas_path', '')
+ if blas_path:
+   print 'adding ' + blas_path + ' to LIBPATH.'
+   env.Append(LIBPATH = [ blas_path, blas_path + '/lib/' ])
+
+ # extra linker flags for blas
+ blas_ldflags = ARGUMENTS.get('blas_ldflags', '')
+ if blas_ldflags:
+   env.Append(_LIBFLAGS=blas_ldflags.split())
+
+ # get command line blas lib
+ blas_lib = ARGUMENTS.get('blas_lib', '')
+ if blas_lib:
+   myenv = env.Copy()
+   conf = Configure(myenv)
+   # check supplied lib
+   print "Checking for lib " + blas_lib + "..."
+   if conf.CheckLib(blas_lib, symname):
+     myenv = conf.Finish()
+     detected_blas(myenv)
+     myenv.Append(LIBS=[blas_lib])
+     return myenv
+ else:
+   print "Autodetecting BLAS support. See config.log for details!"
+
+   ########################
+   # check for acml
+   myenv = env.Copy()
+   # new configure object
+   conf = Configure(myenv)
+   # additional libs needed for acml
+   myenv.Append(LIBS=['m', 'g2c'])
+   if conf.CheckLib('acml', symname):
+     detected_blas(myenv)
+     found_blas = 1
+   myenv = conf.Finish()
+   if(found_blas == 1):
+     return myenv
+
+   ########################
+   # check for goto
+   myenv = env.Copy()
+   # new configure object
+   conf = Configure(myenv)
+   # additional libs needed for goto
+   myenv.Append(LIBS=['pthread'])
+   # extra linker flags for libgoto
+   # myenv.Append(_LIBFLAGS=['libs/numeric/mtl/build/xerbla.c'])
+   myenv.Append(_LIBFLAGS=['libs/numeric/mtl/build/xerbla.o']) # not portable !!!
+   # myenv.Library('build/xerbla', 'build/xerbla.c')
+   # myenv.Append(LIBS=['xerbla'])
+   # myenv.Append(LIBPATH=['build'])
+
+   if conf.CheckLib('goto', symname) or conf.CheckLib('goto_opteron-64', symname) or \
+      conf.CheckLib('goto_coppermine-32', symname) or conf.CheckLib('goto_opteron-32', symname) or \
+      conf.CheckLib('goto_itanium2-64', symname) or conf.CheckLib('goto_katmai-32', symname) or \
+      conf.CheckLib('goto_northwood-32', symname) or conf.CheckLib('goto_prescott-32', symname) or \
+      conf.CheckLib('goto_prescott-64', symname):
+     detected_blas(myenv)
+     found_blas = 1
+   myenv = conf.Finish()
+   if(found_blas == 1):
+     return myenv
+
+   ########################
+   # check for ATLAS
+   myenv = env.Copy()
+   # new configure object
+   conf = Configure(myenv)
+   # additional libs needed for goto
+   myenv.Append(LIBS=['f77blas', 'g2c'])
+   if conf.CheckLib('atlas', symname):
+     detected_blas(myenv)
+     found_blas = 1
+   myenv = conf.Finish()
+   if(found_blas == 1):
+     return myenv
+
+ return env
+
+
+
+###################################
+# Add UMFPACK (extremely simplistic)
+###################################
+
+def detected_umfpack(env): # umfpack library found
+   env.Append(CPPDEFINES = 'MTL_HAS_UMFPACK')
+
+def check_for_umfpack(env):
+ ufconfig_path = ARGUMENTS.get('ufconfig_path', '')
+ if ufconfig_path:
+   env.Prepend(CPPPATH = [ ufconfig_path ])
+ else:
+   print "UMFPACK only works with the UFconfig library."
+   print "Provide ufconfig_path."
+   print "Building continued without UMFPACK."
+   return env
+
+ amd_path = ARGUMENTS.get('amd_path', '')
+ if amd_path:
+   # print 'adding ' + amd_path + '/Lib to LIBPATH.'
+   env.Append(LIBPATH = [ amd_path + '/Lib' ])
+   #print 'adding ' + amd_path + '/Include to CPPPATH.'
+   env.Prepend(CPPPATH = [ amd_path + '/Include' ])
+   env.Prepend(LIBS=['amd'])
+   # print "nachher: ", env['CPPPATH']
+ else:
+   print "UMFPACK only works with the AMD library."
+   print "Provide amd_path."
+   print "Building continued without UMFPACK."
+   return env
+
+ # get command line umfpack path
+ umfpack_path = ARGUMENTS.get('umfpack_path', '')
+ if umfpack_path:
+   # print 'adding ' + umfpack_path + '/Lib to LIBPATH.'
+   env.Prepend(LIBPATH = [ umfpack_path + '/Lib' ])
+   env.Prepend(LIBS=['umfpack'])
+   # print 'adding ' + umfpack_path + '/Include to CPPPATH.'
+   env.Append(CPPPATH = [ umfpack_path + '/Include' ])
+   detected_umfpack(env)
+   return env
+
+
+
+
+######################
+# Start setting up env
+######################
+
+
+SourceSignatures('timestamp')
+
+env = Environment()
+# env.Decider('timestamp-newer')
+
+conf = Configure(env)
+check_no_long_double(conf)
+env = conf.Finish()
+
+# Search only for BLAS when explicitly asked for
+with_blas = ARGUMENTS.get('with_blas', 0)
+if int(with_blas):
+    env = check_for_blas(env)
+
+# Search only for UMFPACK when explicitly asked for
+with_umfpack = ARGUMENTS.get('with_umfpack', 0)
+if int(with_umfpack):
+    env = check_for_umfpack(env)
+
+
+
+
+######################
+# Include paths
+######################
+
+
+my_cpppath = []
+if os.environ.has_key('MTL_BOOST_ROOT') :
+    mtlp = os.environ['MTL_BOOST_ROOT']
+    my_cpppath.append(mtlp)
+if os.environ.has_key('BOOST_ROOT') :
+    my_cpppath.append(os.environ['BOOST_ROOT'])
+
+# In branches, the current directory is prepended
+pwd = os.getcwd()
+if not os.environ.has_key('MTL_BOOST_ROOT') \
+or not hasattr(os.path, 'samefile') or not os.path.samefile(pwd, mtlp):
+     my_cpppath = [pwd] + my_cpppath
+
+# Add directory of extern libraries if exist
+# Not needed currently
+#if os.path.exists('extern'):
+#    my_cpppath.append(os.path.abspath('extern'))
+
+env.Append(CPPPATH = my_cpppath)
+
+# Hack to select compiler explicitly
+# env['CXX'] = 'g++-4.1'
+
+
+######################
+# Opt. and debug flags
+######################
+
+
+opts = Options()
+opts.Add('opt', 'Set to 1 for normal optimization, 2 for high optimization', 0)
+opts.Add('debug', 'Set to 1 for debugging', 0)
+opts.Add('check', 'Set to 1 if test programs shall be ran', 0)
+opts.Add('with_concepts', 'Set to 1 if test programs shall be compiled with conceptg++ (must be in ~/bin)', 0)
+opts.Add('full_warnings', 'Set to 1 to turn on all possible warnings and transform into errors (currently only gcc)', 0)
+
+
+opts.Add('add_ccflag', 'Add extra CC compiler flags that aren\'t automatically set', '')
+opts.Add('add_cxxflag', 'Add extra CXX compiler flags that aren\'t automatically set', '')
+opts.Add('add_optflag', 'Add extra optimization flags that aren\'t automatically set', '')
+
+############
+# BLAS flags
+############
+
+opts.Add('with_blas', 'Link with BLAS (have to given each time :-( until we can save configurations)', 0)
+opts.Add('blas_path', 'Add path of blas library', '')
+opts.Add('blas_lib', 'Add name of blas library', '')
+opts.Add('blas_ldflags', 'Add LDFLAGS for blas library', '')
+
+############
+# UMFPACK flags
+############
+opts.Add('with_umfpack', 'Use UMFPACK. Needs umfpack_path and amd_path.', 0)
+opts.Add('umfpack_path', 'Add path of UMFPACK library', '')
+opts.Add('amd_path', 'Add path of AMD library', '')
+opts.Add('ufconfig_path', 'Add path of AMD library', '')
+
+
+Help(opts.GenerateHelpText(env))
+
+#env.Append(CCFLAGS = ARGUMENTS.get('debug', ''))
+# Hack, for test only
+# env.Replace(CXX = '/san/intel/cc/9.0/bin/icc')
+
+# To test with conceptg++
+# requires
+if int(ARGUMENTS.get('with_concepts', 0)):
+    env['CXX'] = '~/bin/conceptg++'
+    env.Append(CCFLAGS = macro_flag(env, 'CONCEPTS_WITHOUT_OVERLOADED_REQUIREMENTS'))
+
+
+# Full warnings and treat as errors
+if int(ARGUMENTS.get('full_warnings', 0)):
+    if env['CXX'] == 'g++':
+        env.Append(CXXFLAGS = '-Werror -Wall -Wreorder -pedantic -Wpointer-arith -Wcast-qual -Wcast-align -Wwrite-strings')
+full_warnings = ARGUMENTS.get('full_warnings', 0)
+
+
+# add user-defined CC flags
+add_ccflag = ARGUMENTS.get('add_ccflag', '')
+if add_ccflag:
+     env.Append(CCFLAGS = add_ccflag)
+
+# add user-defined CXX flags
+add_cxxflag = ARGUMENTS.get('add_cxxflag', '')
+if add_cxxflag:
+     env.Append(CXXFLAGS = add_cxxflag)
+
+add_platform_flags(env)
+
+#create alternative environments
+debug_env = env.Copy()
+opt_env = env.Copy()
+high_opt_env = env.Copy()
+
+# add debugging flags to appropriate environment
+debug = ARGUMENTS.get('debug', 0)
+if int(debug):
+    add_debug(env)
+add_debug(debug_env)
+
+
+# add optimization flags to appropriate environment
+opt = ARGUMENTS.get('opt', 0)
+
+# Add optimization flags and then copy C flags into C++ flags
+add_opt(debug_env, 0)
+add_opt(env, int(opt))
+add_opt(opt_env, 1)
+add_opt(high_opt_env, 2)
+
+# add user-defined optimization flags
+add_optflag = ARGUMENTS.get('add_optflag', '')
+if add_optflag:
+     add_user_opt(env, add_optflag)
+     add_user_opt(opt_env, add_optflag)
+     add_user_opt(high_opt_env, add_optflag)
+
+# whether test programs should be ran
+check = ARGUMENTS.get('check', 0)
+
+#####################
+# Sub-directories
+#####################
+
+Export('env debug_env opt_env high_opt_env check full_warnings')
+
+SConscript(['libs/numeric/mtl/build/SConscript',
+            'libs/numeric/mtl/test/SConscript',
+            'libs/numeric/mtl/test_with_optimization/SConscript',
+            'libs/numeric/mtl/examples/SConscript',
+            'libs/numeric/mtl/experimental/SConscript',
+            'libs/numeric/mtl/timing/SConscript',
+            'libs/numeric/linear_algebra/test/SConscript',
+            'libs/numeric/itl/test/SConscript'])
+

AMDiS/lib/mtl4/boost/numeric/itl/iteration/basic_iteration.hpp

+// Software License for MTL
+//
+// Copyright (c) 2007 The Trustees of Indiana University.
+//               2008 Dresden University of Technology and the Trustees of Indiana University.
+//               2010 SimuNova UG (haftungsbeschränkt), www.simunova.com.
+// All rights reserved.
+// Authors: Peter Gottschling and Andrew Lumsdaine
+//
+// This file is part of the Matrix Template Library
+//
+// See also license.mtl.txt in the distribution.
+
+#ifndef ITL_BASIC_ITERATION_INCLUDE
+#define ITL_BASIC_ITERATION_INCLUDE
+
+#include <iostream>
+#include <complex>
+#include <string>
+
+namespace itl {
+
+
+template <class Real>
+class basic_iteration
+{
+  public:
+    typedef basic_iteration self;
+    typedef Real            real;
+
+    template <class Vector>
+    basic_iteration(const Vector& r0, int max_iter_, Real t, Real a = Real(0))
+      : error(0), i(0), norm_r0(std::abs(two_norm(r0))),
+	max_iter(max_iter_), rtol_(t), atol_(a), is_finished(false), my_quite(false), my_suppress(false) { }
+
+    basic_iteration(Real nb, int max_iter_, Real t, Real a = Real(0))
+      : error(0), i(0), norm_r0(nb), max_iter(max_iter_), rtol_(t), atol_(a), is_finished(false),
+	my_quite(false), my_suppress(false) {}
+
+    virtual ~basic_iteration() {}
+
+    bool check_max()
+    {
+	if (i >= max_iter)
+	    error= 1, is_finished= true, err_msg= "Too many iterations.";
+	return is_finished;
+    }
+
+    template <class Vector>
+    bool finished(const Vector& r)
+    {
+	if (converged(two_norm(r)))
+	    return is_finished= true;
+	return check_max();
+    }
+
+    bool finished(const Real& r)
+    {
+	if (converged(r))
+	    return is_finished= true;
+	return check_max();
+    }
+
+    template <typename T>
+    bool finished(const std::complex<T>& r)
+    {
+	if (converged(std::abs(r)))
+	    return is_finished= true;
+	return check_max();
+    }
+
+    bool finished() const { return is_finished; }
+
+    template <class T>
+    int terminate(const T& r) { finished(r); return error; }
+
+    bool converged(const Real& r) { resid_= r; return converged(); }
+
+    bool converged() const
+    {
+	if (norm_r0 == 0)
+	    return resid_ <= atol_;  // ignore relative tolerance if |r0| is zero
+	return resid_ <= rtol_ * norm_r0 || resid_ <= atol_;
+    }
+
+    self& operator++() { ++i; return *this; }
+
+    self& operator+=(int n) { i+= n; return *this; }
+
+    bool first() const { return i <= 1; }
+
+    virtual operator int() const { return error; }
+
+    virtual int error_code() const { return error; }
+
+    bool is_converged() const { return is_finished && error == 0; }
+
+    int iterations() const { return i; }
+
+    int max_iterations() const { return max_iter; }
+
+    void set_max_iterations(int m) { max_iter= m; }
+
+    Real resid() const { return resid_; }
+
+    Real relresid() const { return resid_ / norm_r0; }
+
+    Real normb() const { return norm_r0; }
+
+    Real tol() const { return rtol_; }
+    Real atol() const { return atol_; }
+
+    int fail(int err_code) { error = err_code; return error_code(); }
+
+    int fail(int err_code, const std::string& msg)
+    { error = err_code; err_msg = msg; return error_code(); }
+
+    void set(Real v) { norm_r0 = v; }
+
+    void set_quite(bool q) { my_quite= q; }
+
+    bool is_quite() const { return my_quite; }
+
+    void suppress_resume(bool s) { my_suppress= s; }
+
+    bool resume_suppressed() const { return my_suppress; }
+
+    void update_progress(const basic_iteration& that)
+    {
+	i= that.i;
+	resid_= that.resid_;
+	if (that.error > 1) { // copy error except too many iterations
+	    error= that.error;
+	    err_msg= that.err_msg;
+	    is_finished= true;
+	} else
+	    finished(resid_);
+    }
+
+  protected:
+    int          error, i;
+    Real         norm_r0;
+    int          max_iter;
+    Real         rtol_, atol_, resid_;
+    std::string  err_msg;
+    bool         is_finished, my_quite, my_suppress;
+};
+
+
+} // namespace itl
+
+#endif // ITL_BASIC_ITERATION_INCLUDE

AMDiS/lib/mtl4/boost/numeric/itl/iteration/cyclic_iteration.hpp

+// Software License for MTL
+//
+// Copyright (c) 2007 The Trustees of Indiana University.
+//               2008 Dresden University of Technology and the Trustees of Indiana University.
+//               2010 SimuNova UG (haftungsbeschränkt), www.simunova.com.
+// All rights reserved.
+// Authors: Peter Gottschling and Andrew Lumsdaine
+//
+// This file is part of the Matrix Template Library2
+//
+// See also license.mtl.txt in the distribution.
+
+#ifndef ITL_CYCLIC_ITERATION_INCLUDE
+#define ITL_CYCLIC_ITERATION_INCLUDE
+
+#include <iostream>
+#include <boost/numeric/itl/iteration/basic_iteration.hpp>
+
+namespace itl {
+
+  /// Class for iteration control that cyclically prints residual
+  template <class Real, class OStream = std::ostream>
+  class cyclic_iteration : public basic_iteration<Real>
+  {
+      typedef basic_iteration<Real> super;
+      typedef cyclic_iteration self;
+
+      void print_resid()
+      {
+	  if (!this->my_quite && this->i % cycle == 0)
+	      if (multi_print || this->i != last_print) { // Avoid multiple print-outs in same iteration
+		  out << "iteration " << this->i << ": resid " << this->resid()
+		      // << " / " << this->norm_r0 << " = " << this->resid() / this->norm_r0 << " (rel. error)"
+		      << std::endl;
+		  last_print= this->i;
+	      }
+      }
+
+    public:
+
+      template <class Vector>
+      cyclic_iteration(const Vector& r0, int max_iter_, Real tol_, Real atol_ = Real(0), int cycle_ = 100,
+		       OStream& out = std::cout)
+	: super(r0, max_iter_, tol_, atol_), cycle(cycle_), last_print(-1), multi_print(false), out(out)
+      {}
+
+      cyclic_iteration(Real r0, int max_iter_, Real tol_, Real atol_ = Real(0), int cycle_ = 100,
+		       OStream& out = std::cout)
+	: super(r0, max_iter_, tol_, atol_), cycle(cycle_), last_print(-1), multi_print(false), out(out)
+      {}
+
+
+      bool finished() { return super::finished(); }
+
+      template <typename T>
+      bool finished(const T& r)
+      {
+	  bool ret= super::finished(r);
+	  print_resid();
+	  return ret;
+      }
+
+      inline self& operator++() { ++this->i; return *this; }
+
+      inline self& operator+=(int n) { this->i+= n; return *this; }
+
+      operator int() const { return error_code(); }
+
+      /// Whether the residual is printed multiple times in iteration
+      bool is_multi_print() const { return multi_print; }
+
+      /// Set whether the residual is printed multiple times in iteration
+      void set_multi_print(bool m) { multi_print= m; }
+
+      int error_code() const
+      {
+	  if (!this->my_suppress)
+	      out << "finished! error code = " << this->error << '\n'
+		  << this->iterations() << " iterations\n"
+		  << this->resid() << " is actual final residual. \n"
+		  << this->relresid() << " is actual relative tolerance achieved. \n"
+		  << "Relative tol: " << this->rtol_ << "  Absolute tol: " << this->atol_ << '\n'
+		  << "Convergence:  " << pow(this->relresid(), 1.0 / double(this->iterations())) << std::endl;
+	  return this->error;
+      }
+    protected:
+      int        cycle, last_print;
+      bool       multi_print;
+      OStream&   out;
+  };
+
+
+
+} // namespace itl
+
+#endif // ITL_CYCLIC_ITERATION_INCLUDE

AMDiS/lib/mtl4/boost/numeric/itl/iteration/noisy_iteration.hpp

+// Software License for MTL
+//
+// Copyright (c) 2007 The Trustees of Indiana University.
+//               2008 Dresden University of Technology and the Trustees of Indiana University.
+//               2010 SimuNova UG (haftungsbeschränkt), www.simunova.com.
+// All rights reserved.
+// Authors: Peter Gottschling and Andrew Lumsdaine
+//
+// This file is part of the Matrix Template Library
+//
+// See also license.mtl.txt in the distribution.
+
+#ifndef ITL_NOISY_ITERATION_INCLUDE
+#define ITL_NOISY_ITERATION_INCLUDE
+
+#include <iostream>
+#include <boost/numeric/itl/iteration/cyclic_iteration.hpp>
+
+namespace itl {
+
+  template <class Real, class OStream = std::ostream>
+  class noisy_iteration : public cyclic_iteration<Real, OStream>
+  {
+    public:
+      template <class Vector>
+      noisy_iteration(const Vector& r0, int max_iter_, Real tol_, Real atol_ = Real(0),
+		      OStream& out = std::cout)
+	: cyclic_iteration<Real, OStream>(r0, max_iter_, tol_, atol_, 1, out)
+      {}
+  };
+
+} // namespace itl
+
+#endif // ITL_NOISY_ITERATION_INCLUDE

AMDiS/lib/mtl4/boost/numeric/itl/itl.hpp

+// Software License for MTL
+//
+// Copyright (c) 2007 The Trustees of Indiana University.
+//               2008 Dresden University of Technology and the Trustees of Indiana University.
+//               2010 SimuNova UG (haftungsbeschränkt), www.simunova.com.
+// All rights reserved.
+// Authors: Peter Gottschling and Andrew Lumsdaine
+//
+// This file is part of the Matrix Template Library
+//
+// See also license.mtl.txt in the distribution.
+
+#ifndef ITL_ITL_INCLUDE
+#define ITL_ITL_INCLUDE
+
+
+#include <boost/numeric/itl/iteration/basic_iteration.hpp>
+#include <boost/numeric/itl/iteration/cyclic_iteration.hpp>
+#include <boost/numeric/itl/iteration/noisy_iteration.hpp>
+
+#include <boost/numeric/itl/krylov/cg.hpp>
+#include <boost/numeric/itl/krylov/cgs.hpp>
+#include <boost/numeric/itl/krylov/bicg.hpp>
+#include <boost/numeric/itl/krylov/bicgstab.hpp>
+#include <boost/numeric/itl/krylov/bicgstab_2.hpp>
+#include <boost/numeric/itl/krylov/bicgstab_ell.hpp>
+#include <boost/numeric/itl/krylov/fsm.hpp>
+#include <boost/numeric/itl/krylov/idr_s.hpp>
+#include <boost/numeric/itl/krylov/gmres.hpp>
+#include <boost/numeric/itl/krylov/tfqmr.hpp>
+#include <boost/numeric/itl/krylov/qmr.hpp>
+
+#include <boost/numeric/itl/krylov/repeating_solver.hpp>
+
+#include <boost/numeric/itl/minimization/quasi_newton.hpp>
+
+#include <boost/numeric/itl/pc/identity.hpp>
+#include <boost/numeric/itl/pc/is_identity.hpp>
+#include <boost/numeric/itl/pc/diagonal.hpp>
+#include <boost/numeric/itl/pc/ilu.hpp>
+#include <boost/numeric/itl/pc/ilu_0.hpp>
+#include <boost/numeric/itl/pc/ilut.hpp>
+#include <boost/numeric/itl/pc/ic_0.hpp>
+
+#include <boost/numeric/itl/pc/imf_preconditioner.hpp>
+#include <boost/numeric/itl/pc/imf_algorithms.hpp>
+
+#include <boost/numeric/itl/pc/sub_matrix_pc.hpp>
+#include <boost/numeric/itl/pc/concat.hpp>
+
+#include <boost/numeric/itl/smoother/gauss_seidel.hpp>
+
+#include <boost/numeric/itl/stepper/armijo.hpp>
+#include <boost/numeric/itl/stepper/wolf.hpp>
+
+#include <boost/numeric/itl/updater/bfgs.hpp>
+#include <boost/numeric/itl/updater/broyden.hpp>
+#include <boost/numeric/itl/updater/dfp.hpp>
+#include <boost/numeric/itl/updater/psb.hpp>
+#include <boost/numeric/itl/updater/sr1.hpp>
+
+#endif // ITL_ITL_INCLUDE

AMDiS/lib/mtl4/boost/numeric/itl/itl_fwd.hpp

+// Software License for MTL
+//
+// Copyright (c) 2007 The Trustees of Indiana University.
+//               2008 Dresden University of Technology and the Trustees of Indiana University.
+//               2010 SimuNova UG (haftungsbeschränkt), www.simunova.com.
+// All rights reserved.
+// Authors: Peter Gottschling and Andrew Lumsdaine
+//
+// This file is part of the Matrix Template Library
+//
+// See also license.mtl.txt in the distribution.
+
+#ifndef ITL_ITL_FWD_INCLUDE
+#define ITL_ITL_FWD_INCLUDE
+
+#include <boost/numeric/mtl/concept/collection.hpp>
+
+namespace itl {
+
+    template <class Real>                class basic_iteration;
+    template <class Real, class OStream> class cyclic_iteration;
+    template <class Real, class OStream> class noisy_iteration;
+
+    template <typename Solver, typename VectorIn, bool trans> class solver_proxy;
+
+    namespace pc {
+
+	template <typename PC, typename Vector, bool> struct solver;
+	template <typename Matrix, typename Value> class identity;
+	// template <typename Matrix, typename Value, typename Vector> Vector solve(const identity<Matrix>&, const Vector& x);
+	// template <typename Matrix, typename Vector> Vector adjoint_solve(const identity<Matrix>&, const Vector& x);
+
+	template <typename Matrix, typename Value> class diagonal;
+	// template <typename Matrix, typename Vector> Vector solve(const diagonal<Matrix>& P, const Vector& x);
+	// template <typename Matrix, typename Vector> Vector adjoint_solve(const diagonal<Matrix>& P, const Vector& x);
+
+	template <typename Matrix, typename Factorizer, typename Value> class ilu;
+	template <typename Matrix, typename Value> class ilu_0; // Maybe we should declare the default here???
+	template <typename Matrix, typename Value> class ilut; // Maybe we should declare the default here???
+	// template <typename Matrix, typename Vector> Vector solve(const ilu_0<Matrix>& P, const Vector& x);
+	// template <typename Matrix, typename Vector> Vector adjoint_solve(const ilu_0<Matrix>& P, const Vector& x);
+
+	template <typename Matrix, typename Value> class ic_0; // Maybe we should declare the default here???
+	// template <typename Matrix, typename Vector> Vector solve(const ic_0<Matrix>& P, const Vector& x);
+	// template <typename Matrix, typename Value, typename Vector> Vector adjoint_solve(const ic_0<Matrix, Value>& P, const Vector& x);
+
+    } //  namespace pc
+
+    template < typename LinearOperator, typename HilbertSpaceX, typename HilbertSpaceB,
+	       typename Preconditioner, typename Iteration >
+    int cg(const LinearOperator& A, HilbertSpaceX& x, const HilbertSpaceB& b,
+	   const Preconditioner& M, Iteration& iter);
+
+    template < typename LinearOperator, typename Preconditioner= pc::identity<LinearOperator, double>,
+	       typename RightPreconditioner= pc::identity<LinearOperator, double> >
+    class cg_solver;
+
+
+    template < typename LinearOperator, typename Vector,
+	       typename Preconditioner, typename Iteration >
+    int bicg(const LinearOperator &A, Vector &x, const Vector &b,
+	     const Preconditioner &M, Iteration& iter);
+
+    template < class LinearOperator, class HilbertSpaceX, class HilbertSpaceB,
+	       class Preconditioner, class Iteration >
+    int bicgstab(const LinearOperator& A, HilbertSpaceX& x, const HilbertSpaceB& b,
+		 const Preconditioner& M, Iteration& iter);
+
+    template < class LinearOperator, class HilbertSpaceX, class HilbertSpaceB,
+	       class Preconditioner, class Iteration >
+    int bicgstab_2(const LinearOperator& A, HilbertSpaceX& x, const HilbertSpaceB& b,
+		   const Preconditioner& M, Iteration& iter);
+
+    template < typename LinearOperator, typename Vector,
+	       typename LeftPreconditioner, typename RightPreconditioner,
+	       typename Iteration >
+    int bicgstab_ell(const LinearOperator &A, Vector &x, const Vector &b,
+		     const LeftPreconditioner &L, const RightPreconditioner &R,
+		     Iteration& iter, size_t l);
+
+    template < typename LinearOperator, typename Preconditioner= pc::identity<LinearOperator, double>,
+	       typename RightPreconditioner= pc::identity<LinearOperator, double> >
+    class bicgstab_ell_solver;
+
+    template <typename Solver, unsigned N, bool Stored= false>
+    class repeating_solver;
+
+} // namespace itl
+
+#endif // ITL_ITL_FWD_INCLUDE

AMDiS/lib/mtl4/boost/numeric/itl/krylov/bicg.hpp

+// Software License for MTL
+//
+// Copyright (c) 2007 The Trustees of Indiana University.
+//               2008 Dresden University of Technology and the Trustees of Indiana University.
+//               2010 SimuNova UG (haftungsbeschränkt), www.simunova.com.
+// All rights reserved.
+// Authors: Peter Gottschling and Andrew Lumsdaine
+//
+// This file is part of the Matrix Template Library
+//
+// See also license.mtl.txt in the distribution.
+
+#ifndef ITL_BICG_INCLUDE
+#define ITL_BICG_INCLUDE
+
+#include <complex>
+#include <boost/numeric/itl/itl_fwd.hpp>
+#include <boost/numeric/mtl/concept/collection.hpp>
+#include <boost/numeric/mtl/operation/conj.hpp>
+#include <boost/numeric/mtl/operation/resource.hpp>
+#include <boost/numeric/mtl/interface/vpt.hpp>
+
+namespace itl {
+
+/// Bi-Conjugate Gradient
+template < typename LinearOperator, typename Vector,
+	   typename Preconditioner, typename Iteration >
+int bicg(const LinearOperator &A, Vector &x, const Vector &b,
+	 const Preconditioner &M, Iteration& iter)
+{
+    mtl::vampir_trace<7003> tracer;
+    using mtl::conj;
+    typedef typename mtl::Collection<Vector>::value_type Scalar;
+    Scalar     rho_1(0), rho_2(0), alpha(0), beta(0);
+    Vector     r(b - A * x), z(resource(x)), p(resource(x)), q(resource(x)),
+ 	       r_tilde(r), z_tilde(resource(x)), p_tilde(resource(x)), q_tilde(resource(x));
+
+    while ( ! iter.finished(r)) {
+	++iter;
+	z= solve(M, r);
+	z_tilde= adjoint_solve(M, r_tilde);
+	rho_1= dot(z_tilde, z);
+
+	if (rho_1 == 0.) return iter.fail(2, "bicg breakdown");
+	if (iter.first()) {
+	    p= z;
+	    p_tilde= z_tilde;
+	} else {
+	    beta= rho_1 / rho_2;
+	    p= z + beta * p;
+	    p_tilde= z_tilde + conj(beta) * p_tilde;
+	}
+
+	q= A * p;
+	q_tilde= adjoint(A) * p_tilde;
+	alpha= rho_1 / dot(p_tilde, q);
+
+	x+= alpha * p;
+	r-= alpha * q;
+	r_tilde-= conj(alpha) * q_tilde;
+
+	rho_2= rho_1;
+    }
+    return iter;
+}
+
+/// Solver class for BiCG method; right preconditioner ignored (prints warning if not identity)
+template < typename LinearOperator, typename Preconditioner= pc::identity<LinearOperator>,
+	   typename RightPreconditioner= pc::identity<LinearOperator> >
+class bicg_solver
+{
+  public:
+    /// Construct solver from a linear operator; generate (left) preconditioner from it
+    explicit bicg_solver(const LinearOperator& A) : A(A), L(A)
+    {
+	if (!pc::static_is_identity<RightPreconditioner>::value)
+	    std::cerr << "Right Preconditioner ignored!" << std::endl;
+    }
+
+    /// Construct solver from a linear operator and (left) preconditioner
+    bicg_solver(const LinearOperator& A, const Preconditioner& L) : A(A), L(L)
+    {
+	if (!pc::static_is_identity<RightPreconditioner>::value)
+	    std::cerr << "Right Preconditioner ignored!" << std::endl;
+    }
+
+    /// Solve linear system approximately as specified by \p iter
+    template < typename HilbertSpaceB, typename HilbertSpaceX, typename Iteration >
+    int solve(const HilbertSpaceB& b, HilbertSpaceX& x, Iteration& iter) const
+    {
+	return bicg(A, x, b, L, iter);
+    }
+
+    /// Perform one bicg iteration on linear system
+    template < typename HilbertSpaceB, typename HilbertSpaceX >
+    int solve(const HilbertSpaceB& b, HilbertSpaceX& x) const
+    {
+	itl::basic_iteration<double> iter(x, 1, 0, 0);
+	return bicg(A, x, b, L, iter);
+    }
+
+  private:
+    const LinearOperator& A;
+    Preconditioner        L;
+};
+
+} // namespace itl
+
+#endif // ITL_BICG_INCLUDE
+
+
+
+
+
+

AMDiS/lib/mtl4/boost/numeric/itl/krylov/bicgstab.hpp

+// Software License for MTL
+//
+// Copyright (c) 2007 The Trustees of Indiana University.
+//               2008 Dresden University of Technology and the Trustees of Indiana University.
+//               2010 SimuNova UG (haftungsbeschränkt), www.simunova.com.
+// All rights reserved.
+// Authors: Peter Gottschling and Andrew Lumsdaine
+//
+// This file is part of the Matrix Template Library
+//
+// See also license.mtl.txt in the distribution.
+
+#ifndef ITL_BICGSTAB_INCLUDE
+#define ITL_BICGSTAB_INCLUDE
+
+#include <boost/numeric/mtl/concept/collection.hpp>
+#include <boost/numeric/mtl/utility/exception.hpp>
+#include <boost/numeric/itl/utility/exception.hpp>
+#include <boost/numeric/mtl/operation/resource.hpp>
+#include <boost/numeric/mtl/interface/vpt.hpp>
+
+namespace itl {
+
+///  Bi-Conjugate Gradient Stabilized
+template < class LinearOperator, class HilbertSpaceX, class HilbertSpaceB,
+	   class Preconditioner, class Iteration >
+int bicgstab(const LinearOperator& A, HilbertSpaceX& x, const HilbertSpaceB& b,
+	     const Preconditioner& M, Iteration& iter)
+{
+  typedef typename mtl::Collection<HilbertSpaceX>::value_type Scalar;
+  typedef HilbertSpaceX                                       Vector;
+  mtl::vampir_trace<7004> tracer;
+
+  Scalar     rho_1(0), rho_2(0), alpha(0), beta(0), gamma, omega(0);
+  Vector     p(resource(x)), phat(resource(x)), s(resource(x)), shat(resource(x)),
+             t(resource(x)), v(resource(x)), r(resource(x)), rtilde(resource(x));
+
+  r = b - A * x;
+  rtilde = r;
+
+  while (! iter.finished(r)) {
+    ++iter;
+    rho_1 = dot(rtilde, r);
+    MTL_THROW_IF(rho_1 == 0.0, unexpected_orthogonality());
+
+    if (iter.first())
+      p = r;
+    else {
+      MTL_THROW_IF(omega == 0.0, unexpected_orthogonality());
+      beta = (rho_1 / rho_2) * (alpha / omega);
+      p = r + beta * (p - omega * v);
+    }
+    phat = solve(M, p);
+    v = A * phat;
+
+    gamma = dot(rtilde, v);
+    MTL_THROW_IF(gamma == 0.0, unexpected_orthogonality());
+
+    alpha = rho_1 / gamma;
+    s = r - alpha * v;
+
+    if (iter.finished(s)) {
+      x += alpha * phat;
+      break;
+    }
+    shat = solve(M, s);
+    t = A * shat;
+    omega = dot(t, s) / dot(t, t);
+
+    x += omega * shat + alpha * phat;
+    r = s - omega * t;
+
+    rho_2 = rho_1;
+  }
+  return iter;
+}
+
+/// Solver class for BiCGStab method; right preconditioner ignored (prints warning if not identity)
+template < typename LinearOperator, typename Preconditioner= pc::identity<LinearOperator>,
+	   typename RightPreconditioner= pc::identity<LinearOperator> >
+class bicgstab_solver
+{
+  public:
+    /// Construct solver from a linear operator; generate (left) preconditioner from it
+    explicit bicgstab_solver(const LinearOperator& A) : A(A), L(A)
+    {
+	if (!pc::static_is_identity<RightPreconditioner>::value)
+	    std::cerr << "Right Preconditioner ignored!" << std::endl;
+    }
+
+    /// Construct solver from a linear operator and (left) preconditioner
+    bicgstab_solver(const LinearOperator& A, const Preconditioner& L) : A(A), L(L)
+    {
+	if (!pc::static_is_identity<RightPreconditioner>::value)
+	    std::cerr << "Right Preconditioner ignored!" << std::endl;
+    }
+
+    /// Solve linear system approximately as specified by \p iter
+    template < typename HilbertSpaceB, typename HilbertSpaceX, typename Iteration >
+    int solve(const HilbertSpaceB& b, HilbertSpaceX& x, Iteration& iter) const
+    {
+	return bicgstab(A, x, b, L, iter);
+    }
+
+    /// Perform one BiCGStab iteration on linear system
+    template < typename HilbertSpaceB, typename HilbertSpaceX >
+    int solve(const HilbertSpaceB& b, HilbertSpaceX& x) const
+    {
+	itl::basic_iteration<double> iter(x, 1, 0, 0);
+	return solve(b, x, iter);
+    }
+
+  private:
+    const LinearOperator& A;
+    Preconditioner        L;
+};
+
+} // namespace itl
+
+#endif // ITL_BICGSTAB_INCLUDE

AMDiS/lib/mtl4/boost/numeric/itl/krylov/bicgstab_2.hpp

+// Software License for MTL
+//
+// Copyright (c) 2007 The Trustees of Indiana University.
+//               2008 Dresden University of Technology and the Trustees of Indiana University.
+//               2010 SimuNova UG (haftungsbeschränkt), www.simunova.com.
+// All rights reserved.
+// Authors: Peter Gottschling and Andrew Lumsdaine
+//
+// This file is part of the Matrix Template Library
+//
+// See also license.mtl.txt in the distribution.
+
+#ifndef ITL_BICGSTAB_2_INCLUDE
+#define ITL_BICGSTAB_2_INCLUDE
+
+#include <boost/numeric/mtl/concept/collection.hpp>
+#include <boost/numeric/mtl/utility/exception.hpp>
+#include <boost/numeric/linear_algebra/identity.hpp>
+#include <boost/numeric/mtl/operation/resource.hpp>
+#include <boost/numeric/mtl/operation/size.hpp>
+#include <boost/numeric/itl/pc/identity.hpp>
+#include <boost/numeric/mtl/vector/dense_vector.hpp>
+#include <boost/numeric/mtl/matrix/strict_upper.hpp>
+#include <boost/numeric/mtl/matrix/dense2D.hpp>
+#include <boost/numeric/mtl/utility/irange.hpp>
+#include <boost/numeric/mtl/operation/orth.hpp>
+#include <boost/numeric/mtl/operation/lazy.hpp>
+#include <boost/numeric/mtl/interface/vpt.hpp>
+
+namespace itl {
+
+/// Bi-Conjugate Gradient Stabilized(2)
+template < typename LinearOperator, typename Vector,
+	   typename Preconditioner, typename Iteration >
+int bicgstab_2(const LinearOperator &A, Vector &x, const Vector &b,
+	       const Preconditioner &L, Iteration& iter)
+{
+    mtl::vampir_trace<7005> tracer;
+    using mtl::size; using mtl::irange; using mtl::imax; using mtl::matrix::strict_upper; using mtl::lazy;
+    typedef typename mtl::Collection<Vector>::value_type Scalar;
+    typedef typename mtl::Collection<Vector>::size_type  Size;
+
+    if (size(b) == 0) throw mtl::logic_error("empty rhs vector");
+
+    const size_t                l= 2;
+    const Scalar                zero= math::zero(Scalar()), one= math::one(Scalar());
+    Vector                      x0(resource(x)), y(resource(x));
+    mtl::vector::dense_vector<Vector>   r_hat(l+1,Vector(resource(x))), u_hat(l+1,Vector(resource(x)));
+
+    // shift problem
+    x0= zero;
+    r_hat[0]= b;
+    if (two_norm(x) != zero) {
+	r_hat[0]-= A * x;
+	x0= x;
+	x= zero;
+    }
+
+    Vector  r0_tilde(r_hat[0]/two_norm(r_hat[0]));
+    y= solve(L, r_hat[0]);
+    r_hat[0]= y;
+    u_hat[0]= zero;
+
+    Scalar                      rho_0(one), rho_1(zero), alpha(zero), Gamma(zero), beta(zero), omega(one);
+    mtl::matrix::dense2D<Scalar>        tau(l+1, l+1);
+    mtl::vector::dense_vector<Scalar>   sigma(l+1), gamma(l+1), gamma_a(l+1), gamma_aa(l+1);
+
+    while (! iter.finished(r_hat[0])) {
+	++iter;
+	rho_0= -omega * rho_0;
+
+	for (Size j= 0; j < 2; ++j) {
+	    rho_1= dot(r0_tilde, r_hat[j]);
+	    beta= alpha * rho_1/rho_0; rho_0= rho_1;
+
+	    for (Size i= 0; i <= j; ++i)
+		u_hat[i]= r_hat[i] - beta * u_hat[i];
+
+	    y= A * u_hat[j];
+	    u_hat[j+1]= solve(L, y);
+	    Gamma= dot(r0_tilde, u_hat[j+1]);
+	    alpha= rho_0 / Gamma;
+
+	    for (Size i= 0; i <= j; ++i)
+		r_hat[i]-= alpha * u_hat[i+1];
+
+	    if (iter.finished(r_hat[j])) {
+		x+= x0;
+		return iter;
+	    }
+
+	    y= A * r_hat[j];
+	    r_hat[j+1]= solve(L, y);
+	    x+= alpha * u_hat[0];
+	}
+
+	// mod GS (MR part)
+	irange  i1m(1, imax);
+	mtl::vector::dense_vector<Vector>   r_hat_tail(r_hat[i1m]);
+	tau[i1m][i1m]= orthogonalize_factors(r_hat_tail);
+	for (Size j= 1; j <= l; ++j)
+	    gamma_a[j]= dot(r_hat[j], r_hat[0]) / tau[j][j];
+
+	gamma[l]= gamma_a[l]; omega= gamma[l];
+	if (omega == zero) return iter.fail(3, "bicg breakdown #2");
+
+	// is this something like a tri-solve?
+	for (Size j= l-1; j > 0; --j) {
+	    Scalar sum= zero;
+	    for (Size i=j+1;i<=l;++i)
+		sum += tau[j][i] * gamma[i];
+	    gamma[j] = gamma_a[j] - sum;
+	}
+
+	gamma_aa[irange(1, l)]= strict_upper(tau[irange(1, l)][irange(1, l)]) * gamma[irange(2, l+1)] + gamma[irange(2, l+1)];
+
+	x+= gamma[1] * r_hat[0];
+	r_hat[0]-= gamma_a[l] * r_hat[l];
+	u_hat[0]-= gamma[l] * u_hat[l];
+	for (Size j=1; j < l; ++j) {
+	    u_hat[0] -= gamma[j] * u_hat[j];
+	    x+= gamma_aa[j] * r_hat[j];
+	    r_hat[0] -= gamma_a[j] * r_hat[j];
+	}
+    }
+    x+= x0; // convert to real solution and undo shift
+    return iter;
+}
+
+
+
+/// Solver class for BiCGStab(2) method; right preconditioner ignored (prints warning if not identity)
+template < typename LinearOperator, typename Preconditioner= pc::identity<LinearOperator>,
+	   typename RightPreconditioner= pc::identity<LinearOperator> >
+class bicgstab_2_solver
+{
+  public:
+    /// Construct solver from a linear operator; generate (left) preconditioner from it
+    explicit bicgstab_2_solver(const LinearOperator& A) : A(A), L(A)
+    {
+	if (!pc::static_is_identity<RightPreconditioner>::value)
+	    std::cerr << "Right Preconditioner ignored!" << std::endl;
+    }
+
+    /// Construct solver from a linear operator and (left) preconditioner
+    bicgstab_2_solver(const LinearOperator& A, const Preconditioner& L) : A(A), L(L)
+    {
+	if (!pc::static_is_identity<RightPreconditioner>::value)
+	    std::cerr << "Right Preconditioner ignored!" << std::endl;
+    }
+
+    /// Solve linear system approximately as specified by \p iter
+    template < typename HilbertSpaceB, typename HilbertSpaceX, typename Iteration >
+    int solve(const HilbertSpaceB& b, HilbertSpaceX& x, Iteration& iter) const
+    {
+	return bicgstab_2(A, x, b, L, iter);
+    }
+
+    /// Perform one BiCGStab(2) iteration on linear system
+    template < typename HilbertSpaceB, typename HilbertSpaceX >
+    int solve(const HilbertSpaceB& b, HilbertSpaceX& x) const
+    {
+	itl::basic_iteration<double> iter(x, 1, 0, 0);
+	return bicgstab_2(A, x, b, L, iter);
+    }
+
+  private:
+    const LinearOperator& A;
+    Preconditioner        L;
+};
+
+
+
+} // namespace itl
+
+#endif // ITL_BICGSTAB_2_INCLUDE
+
+
+
+
+
+

AMDiS/lib/mtl4/boost/numeric/itl/krylov/bicgstab_ell.hpp

+// Software License for MTL
+//
+// Copyright (c) 2007 The Trustees of Indiana University.
+//               2008 Dresden University of Technology and the Trustees of Indiana University.
+//               2010 SimuNova UG (haftungsbeschränkt), www.simunova.com.
+// All rights reserved.
+// Authors: Peter Gottschling and Andrew Lumsdaine
+//
+// This file is part of the Matrix Template Library
+//
+// See also license.mtl.txt in the distribution.
+
+// Written by Jan Bos
+// Edited  by Peter Gottschling
+
+#ifndef ITL_BICGSTAB_ELL_INCLUDE
+#define ITL_BICGSTAB_ELL_INCLUDE
+
+#include <boost/numeric/itl/itl_fwd.hpp>
+#include <boost/numeric/mtl/concept/collection.hpp>
+#include <boost/numeric/mtl/vector/dense_vector.hpp>
+#include <boost/numeric/mtl/matrix/strict_upper.hpp>
+#include <boost/numeric/mtl/matrix/dense2D.hpp>
+#include <boost/numeric/mtl/utility/irange.hpp>
+#include <boost/numeric/mtl/operation/orth.hpp>
+#include <boost/numeric/mtl/utility/exception.hpp>
+#include <boost/numeric/linear_algebra/identity.hpp>
+#include <boost/numeric/mtl/operation/resource.hpp>
+#include <boost/numeric/mtl/operation/size.hpp>
+#include <boost/numeric/mtl/interface/vpt.hpp>
+
+namespace itl {
+
+/// Bi-Conjugate Gradient Stabilized(ell)
+template < typename LinearOperator, typename Vector,
+	   typename LeftPreconditioner, typename RightPreconditioner,
+	   typename Iteration >
+int bicgstab_ell(const LinearOperator &A, Vector &x, const Vector &b,
+		 const LeftPreconditioner &L, const RightPreconditioner &R,
+		 Iteration& iter, size_t l)
+{
+    mtl::vampir_trace<7006> tracer;
+    using mtl::size; using mtl::irange; using mtl::imax; using mtl::matrix::strict_upper;
+    typedef typename mtl::Collection<Vector>::value_type Scalar;
+    typedef typename mtl::Collection<Vector>::size_type  Size;
+
+    if (size(b) == 0) throw mtl::logic_error("empty rhs vector");
+
+    const Scalar                zero= math::zero(Scalar()), one= math::one(Scalar());
+    Vector                      x0(resource(x)), y(resource(x));
+    mtl::vector::dense_vector<Vector>   r_hat(l+1,Vector(resource(x))), u_hat(l+1,Vector(resource(x)));
+
+    // shift problem
+    x0= zero;
+    r_hat[0]= b;
+    if (two_norm(x) != zero) {
+	r_hat[0]-= A * x;
+	x0= x;
+	x= zero;
+    }
+
+    Vector  r0_tilde(r_hat[0]/two_norm(r_hat[0]));
+    y= solve(L, r_hat[0]);
+    r_hat[0]= y;
+    u_hat[0]= zero;
+
+    Scalar                      rho_0(one), rho_1(zero), alpha(zero), Gamma(zero), beta(zero), omega(one);
+    mtl::matrix::dense2D<Scalar>        tau(l+1, l+1);
+    mtl::vector::dense_vector<Scalar>   sigma(l+1), gamma(l+1), gamma_a(l+1), gamma_aa(l+1);
+
+    while (! iter.finished(r_hat[0])) {
+	++iter;
+	rho_0= -omega * rho_0;
+
+	for (Size j= 0; j < l; ++j) {
+	    rho_1= dot(r0_tilde, r_hat[j]);
+	    beta= alpha * rho_1/rho_0; rho_0= rho_1;
+
+	    for (Size i= 0; i <= j; ++i)
+		u_hat[i]= r_hat[i] - beta * u_hat[i];
+
+	    y= A * Vector(solve(R, u_hat[j]));
+	    u_hat[j+1]= solve(L, y);
+	    Gamma= dot(r0_tilde, u_hat[j+1]);
+	    alpha= rho_0 / Gamma;
+
+	    for (Size i= 0; i <= j; ++i)
+		r_hat[i]-= alpha * u_hat[i+1];
+
+	    if (iter.finished(r_hat[j])) {
+		x= solve(R, x);
+		x+= x0;
+		return iter;
+	    }
+
+	    r_hat[j+1]= solve(R, r_hat[j]);
+	    y= A * r_hat[j+1];
+	    r_hat[j+1]= solve(L, y);
+	    x+= alpha * u_hat[0];
+	}
+
+	// mod GS (MR part)
+	irange  i1m(1, imax);
+	mtl::vector::dense_vector<Vector>   r_hat_tail(r_hat[i1m]);
+	tau[i1m][i1m]= orthogonalize_factors(r_hat_tail);
+	for (Size j= 1; j <= l; ++j)
+	    gamma_a[j]= dot(r_hat[j], r_hat[0]) / tau[j][j];
+
+	gamma[l]= gamma_a[l]; omega= gamma[l];
+	if (omega == zero) return iter.fail(3, "bicg breakdown #2");
+
+	// is this something like a tri-solve?
+	for (Size j= l-1; j > 0; --j) {
+	    Scalar sum= zero;
+	    for (Size i=j+1;i<=l;++i)
+		sum += tau[j][i] * gamma[i];
+	    gamma[j] = gamma_a[j] - sum;
+	}
+
+	gamma_aa[irange(1, l)]= strict_upper(tau[irange(1, l)][irange(1, l)]) * gamma[irange(2, l+1)] + gamma[irange(2, l+1)];
+
+	x+= gamma[1] * r_hat[0];
+	r_hat[0]-= gamma_a[l] * r_hat[l];
+	u_hat[0]-= gamma[l] * u_hat[l];
+	for (Size j=1; j < l; ++j) {
+	    u_hat[0] -= gamma[j] * u_hat[j];
+	    x+= gamma_aa[j] * r_hat[j];
+	    r_hat[0] -= gamma_a[j] * r_hat[j];
+	}
+    }
+    x= solve(R, x); x+= x0; // convert to real solution and undo shift
+    return iter;
+}
+
+
+/// Solver class for BiCGStab(ell) method; right preconditioner ignored (prints warning if not identity)
+template < typename LinearOperator, typename Preconditioner,
+	   typename RightPreconditioner>
+class bicgstab_ell_solver
+{
+  public:
+    /// Construct solver from a linear operator; generate (left) preconditioner from it
+    explicit bicgstab_ell_solver(const LinearOperator& A, size_t l= 8) : A(A), l(l), L(A), R(A) {}
+
+    /// Construct solver from a linear operator and left preconditioner
+    bicgstab_ell_solver(const LinearOperator& A, size_t l, const Preconditioner& L) : A(A), l(l), L(L), R(A) {}
+
+    /// Construct solver from a linear operator and left preconditioner
+    bicgstab_ell_solver(const LinearOperator& A, size_t l, const Preconditioner& L, const RightPreconditioner& R)
+      : A(A), l(l), L(L), R(R) {}
+
+    /// Solve linear system approximately as specified by \p iter
+    template < typename HilbertSpaceB, typename HilbertSpaceX, typename Iteration >
+    int solve(const HilbertSpaceB& b, HilbertSpaceX& x, Iteration& iter) const
+    {
+	return bicgstab_ell(A, x, b, L, R, iter, l);
+    }
+
+    /// Perform one BiCGStab(ell) iteration on linear system
+    template < typename HilbertSpaceB, typename HilbertSpaceX >
+    int solve(const HilbertSpaceB& b, HilbertSpaceX& x) const
+    {
+	itl::basic_iteration<double> iter(x, 1, 0, 0);
+	return solve(b, x, iter);
+    }
+
+  private:
+    const LinearOperator& A;
+    size_t                l;
+    Preconditioner        L;
+    RightPreconditioner   R;
+};
+
+
+} // namespace itl
+
+#endif // ITL_BICGSTAB_ELL_INCLUDE

AMDiS/lib/mtl4/boost/numeric/itl/krylov/cg.hpp

+// Software License for MTL
+//
+// Copyright (c) 2007 The Trustees of Indiana University.
+//               2008 Dresden University of Technology and the Trustees of Indiana University.
+//               2010 SimuNova UG (haftungsbeschränkt), www.simunova.com.
+// All rights reserved.
+// Authors: Peter Gottschling and Andrew Lumsdaine
+//
+// This file is part of the Matrix Template Library
+//
+// See also license.mtl.txt in the distribution.
+
+#ifndef ITL_CG_INCLUDE
+#define ITL_CG_INCLUDE
+
+#include <cmath>
+#include <cassert>
+#include <iostream>
+#include <boost/mpl/bool.hpp>
+
+#include <boost/numeric/mtl/concept/collection.hpp>
+#include <boost/numeric/itl/itl_fwd.hpp>
+#include <boost/numeric/itl/iteration/basic_iteration.hpp>
+#include <boost/numeric/itl/pc/identity.hpp>
+#include <boost/numeric/itl/pc/is_identity.hpp>
+#include <boost/numeric/mtl/operation/dot.hpp>
+#include <boost/numeric/mtl/operation/unary_dot.hpp>
+#include <boost/numeric/mtl/operation/conj.hpp>
+#include <boost/numeric/mtl/operation/resource.hpp>
+#include <boost/numeric/mtl/operation/lazy.hpp>
+#include <boost/numeric/mtl/interface/vpt.hpp>
+
+namespace itl {
+
+/// Conjugate Gradients without preconditioning
+template < typename LinearOperator, typename HilbertSpaceX, typename HilbertSpaceB,
+	   typename Iteration >
+int cg(const LinearOperator& A, HilbertSpaceX& x, const HilbertSpaceB& b,
+       Iteration& iter)
+{
+    mtl::vampir_trace<7001> tracer;
+    using std::abs; using mtl::conj; using mtl::lazy;
+    typedef HilbertSpaceX Vector;
+    typedef typename mtl::Collection<HilbertSpaceX>::value_type Scalar;
+    typedef typename Iteration::real                            Real;
+
+    Scalar rho(0), rho_1(0), alpha(0), alpha_1(0);
+    Vector p(resource(x)), q(resource(x)), r(resource(x)), z(resource(x));
+
+    r = b - A*x;
+    rho = dot(r, r);
+    while (! iter.finished(Real(sqrt(abs(rho))))) {
+	++iter;
+	if (iter.first())
+	    p = r;
+	else
+	    p = r + (rho / rho_1) * p;
+
+	// q = A * p; alpha = rho / dot(p, q);
+	(lazy(q)= A * p) || (lazy(alpha_1)= lazy_dot(p, q));
+	alpha= rho / alpha_1;
+
+	x += alpha * p;
+	rho_1 = rho;
+	(lazy(r) -= alpha * q) || (lazy(rho) = lazy_unary_dot(r));
+    }
+
+    return iter;
+}
+
+/// Conjugate Gradients
+template < typename LinearOperator, typename HilbertSpaceX, typename HilbertSpaceB,
+	   typename Preconditioner, typename Iteration >
+int cg(const LinearOperator& A, HilbertSpaceX& x, const HilbertSpaceB& b,
+       const Preconditioner& L, Iteration& iter)
+{
+    using pc::is_identity;
+    if (is_identity(L))
+	return cg(A, x, b, iter);
+
+    mtl::vampir_trace<7002> tracer;
+    using std::abs; using mtl::conj; using mtl::lazy;
+    typedef HilbertSpaceX Vector;
+    typedef typename mtl::Collection<HilbertSpaceX>::value_type Scalar;
+    typedef typename Iteration::real                            Real;
+
+    Scalar rho(0), rho_1(0), rr, alpha(0), alpha_1;
+    Vector p(resource(x)), q(resource(x)), r(resource(x)), z(resource(x));
+
+    r = b - A*x;
+    rr = dot(r, r);
+    while (! iter.finished(Real(sqrt(abs(rr))))) {
+	++iter;
+	(lazy(z)= solve(L, r)) || (lazy(rho)= lazy_dot(r, z));
+
+	if (iter.first())
+	    p = z;
+	else
+	    p = z + (rho / rho_1) * p;
+
+	(lazy(q)= A * p) || (lazy(alpha_1)= lazy_dot(p, q));
+	alpha= rho / alpha_1;
+
+	x += alpha * p;
+	rho_1 = rho;
+	(lazy(r) -= alpha * q) || (lazy(rr) = lazy_unary_dot(r));
+    }
+    return iter;
+}
+
+/// Conjugate Gradients with ignored right preconditioner to unify interface
+template < typename LinearOperator, typename HilbertSpaceX, typename HilbertSpaceB,
+	   typename Preconditioner, typename RightPreconditioner, typename Iteration >
+int cg(const LinearOperator& A, HilbertSpaceX& x, const HilbertSpaceB& b,
+       const Preconditioner& L, const RightPreconditioner&, Iteration& iter)
+{
+    return cg(A, x, b, L, iter);
+}
+
+/// Solver class for CG method; right preconditioner ignored (prints warning if not identity)
+template < typename LinearOperator, typename Preconditioner,
+	   typename RightPreconditioner>
+class cg_solver
+{
+  public:
+    /// Construct solver from a linear operator; generate (left) preconditioner from it
+    explicit cg_solver(const LinearOperator& A) : A(A), L(A)
+    {
+	if (!pc::static_is_identity<RightPreconditioner>::value)
+	    std::cerr << "Right Preconditioner ignored!" << std::endl;
+    }
+
+    /// Construct solver from a linear operator and (left) preconditioner
+    cg_solver(const LinearOperator& A, const Preconditioner& L) : A(A), L(L)
+    {
+	if (!pc::static_is_identity<RightPreconditioner>::value)
+	    std::cerr << "Right Preconditioner ignored!" << std::endl;
+    }
+
+    /// Solve linear system approximately as specified by \p iter
+    template < typename HilbertSpaceB, typename HilbertSpaceX, typename Iteration >
+    int solve(const HilbertSpaceB& b, HilbertSpaceX& x, Iteration& iter) const
+    {
+	return cg(A, x, b, L, iter);
+    }
+
+    /// Perform one CG iteration on linear system
+    template < typename HilbertSpaceB, typename HilbertSpaceX >
+    int solve(const HilbertSpaceB& b, HilbertSpaceX& x) const
+    {
+	itl::basic_iteration<double> iter(x, 1, 0, 0);
+	return solve(b, x, iter);
+    }
+
+  private:
+    const LinearOperator& A;
+    Preconditioner        L;
+};
+
+
+} // namespace itl
+
+#endif // ITL_CG_INCLUDE

AMDiS/lib/mtl4/boost/numeric/itl/krylov/cgs.hpp

+// Software License for MTL
+//
+// Copyright (c) 2007 The Trustees of Indiana University.
+//               2008 Dresden University of Technology and the Trustees of Indiana University.
+//               2010 SimuNova UG (haftungsbeschränkt), www.simunova.com.
+// All rights reserved.
+// Authors: Peter Gottschling and Andrew Lumsdaine
+//
+// This file is part of the Matrix Template Library
+//
+// See also license.mtl.txt in the distribution.
+
+#ifndef ITL_CGS_INCLUDE
+#define ITL_CGS_INCLUDE
+
+#include <boost/numeric/mtl/concept/collection.hpp>
+#include <boost/numeric/mtl/operation/resource.hpp>
+#include <boost/numeric/mtl/operation/dot.hpp>
+#include <boost/numeric/mtl/interface/vpt.hpp>
+
+namespace itl {
+
+/// Conjugate Gradient Squared
+template < typename LinearOperator, typename Vector,
+	   typename Preconditioner, typename Iteration >
+int cgs(const LinearOperator &A, Vector &x, const Vector &b,
+	const Preconditioner &M, Iteration& iter)
+{
+    mtl::vampir_trace<7007> tracer;
+    typedef typename mtl::Collection<Vector>::value_type Scalar;
+    Scalar     rho_1(0), rho_2(0), alpha(0), beta(0);
+    Vector     p(resource(x)), phat(resource(x)), q(resource(x)), qhat(resource(x)), vhat(resource(x)),
+	       u(resource(x)), uhat(resource(x)), r(b - A * x), rtilde= r;
+
+    while (! iter.finished(r)) {
+	++iter;
+	rho_1= dot(rtilde, r);
+
+	if (rho_1 == 0.) iter.fail(2, "cgs breakdown");
+
+	if (iter.first())
+	    p= u= r;
+	else {
+	    beta = rho_1 / rho_2;
+	    u= r + beta * q;
+	    p= u + beta * (q + beta * p);
+	}
+
+        vhat= A * Vector(solve(M, p));
+	alpha = rho_1 / dot(rtilde, vhat);
+	q= u - alpha * vhat;
+
+	u+= q;
+	uhat= solve(M, u);
+
+	x+= alpha * uhat;
+	qhat= A * uhat;
+	r-= alpha * qhat;
+
+	rho_2= rho_1;
+    }
+    return iter;
+}
+
+/// Solver class for CGS method; right preconditioner ignored (prints warning if not identity)
+template < typename LinearOperator, typename Preconditioner= pc::identity<LinearOperator>,
+	   typename RightPreconditioner= pc::identity<LinearOperator> >
+class cgs_solver
+{
+  public:
+    /// Construct solver from a linear operator; generate (left) preconditioner from it
+    explicit cgs_solver(const LinearOperator& A) : A(A), L(A)
+    {
+	if (!pc::static_is_identity<RightPreconditioner>::value)
+	    std::cerr << "Right Preconditioner ignored!" << std::endl;
+    }
+
+    /// Construct solver from a linear operator and (left) preconditioner
+    cgs_solver(const LinearOperator& A, const Preconditioner& L) : A(A), L(L)
+    {
+	if (!pc::static_is_identity<RightPreconditioner>::value)
+	    std::cerr << "Right Preconditioner ignored!" << std::endl;
+    }
+
+    /// Solve linear system approximately as specified by \p iter
+    template < typename HilbertSpaceB, typename HilbertSpaceX, typename Iteration >
+    int solve(const HilbertSpaceB& b, HilbertSpaceX& x, Iteration& iter) const
+    {
+	return cgs(A, x, b, L, iter);
+    }
+
+    /// Perform one CGS iteration on linear system
+    template < typename HilbertSpaceB, typename HilbertSpaceX >
+    int solve(const HilbertSpaceB& b, HilbertSpaceX& x) const
+    {
+	itl::basic_iteration<double> iter(x, 1, 0, 0);
+	return solve(b, x, iter);
+    }
+
+  private:
+    const LinearOperator& A;
+    Preconditioner        L;
+};
+
+} // namespace itl
+
+#endif // ITL_CGS_INCLUDE
+
+
+

AMDiS/lib/mtl4/boost/numeric/itl/krylov/fsm.hpp

+// Software License for MTL
+//
+// Copyright (c) 2007 The Trustees of Indiana University.
+//               2008 Dresden University of Technology and the Trustees of Indiana University.
+//               2010 SimuNova UG (haftungsbeschränkt), www.simunova.com.
+// All rights reserved.
+// Authors: Peter Gottschling and Andrew Lumsdaine
+//
+// This file is part of the Matrix Template Library
+//
+// See also license.mtl.txt in the distribution.
+
+#ifndef ITL_FSM_INCLUDE
+#define ITL_FSM_INCLUDE
+
+#include <boost/numeric/mtl/operation/two_norm.hpp>
+
+namespace itl {
+
+/// Folded spectrum method
+/** Computed and named as in http://en.wikipedia.org/wiki/Folded_spectrum_method **/
+template < typename LinearOperator, typename VectorSpace, typename EigenValue,
+	   typename Damping, typename Iteration >
+int fsm(const LinearOperator& H, VectorSpace& phi, EigenValue eps, Damping alpha, Iteration& iter)
+{
+    VectorSpace v1(H * phi - eps * phi);
+    for (; !iter.finished(v1); ++iter) {
+	VectorSpace v2(H * v1 - eps * v1);
+	phi-= alpha * v2;
+	phi/= two_norm(phi);
+	v1= H * phi - eps * phi;
+    }
+    return iter;
+}
+
+
+} // namespace itl
+
+#endif // ITL_FSM_INCLUDE

AMDiS/lib/mtl4/boost/numeric/itl/krylov/gmres.hpp

+// Software License for MTL
+//
+// Copyright (c) 2007 The Trustees of Indiana University.
+//               2008 Dresden University of Technology and the Trustees of Indiana University.
+//               2010 SimuNova UG (haftungsbeschränkt), www.simunova.com.
+// All rights reserved.
+// Authors: Peter Gottschling and Andrew Lumsdaine
+//
+// This file is part of the Matrix Template Library
+//
+// See also license.mtl.txt in the distribution.
+
+// Written by Cornelius Steinhardt
+
+
+#ifndef ITL_GMRES_INCLUDE
+#define ITL_GMRES_INCLUDE
+
+#include <algorithm>
+#include <boost/numeric/mtl/concept/collection.hpp>
+#include <boost/numeric/mtl/vector/dense_vector.hpp>
+#include <boost/numeric/mtl/matrix/dense2D.hpp>
+#include <boost/numeric/mtl/matrix/multi_vector.hpp>
+#include <boost/numeric/mtl/operation/givens.hpp>
+#include <boost/numeric/mtl/operation/two_norm.hpp>
+#include <boost/numeric/mtl/utility/exception.hpp>
+#include <boost/numeric/mtl/utility/irange.hpp>
+
+namespace itl {
+
+/// Generalized Minimal Residual method (without restart)
+/** It computes at most kmax_in iterations (or size(x) depending on what is smaller)
+    regardless on whether the termination criterion is reached or not.   **/
+template < typename Matrix, typename Vector, typename LeftPreconditioner, typename RightPreconditioner, typename Iteration >
+int gmres_full(const Matrix &A, Vector &x, const Vector &b,
+               LeftPreconditioner &L, RightPreconditioner &R, Iteration& iter)
+{
+    using mtl::size; using mtl::irange; using mtl::iall; using std::abs; using std::sqrt;
+    typedef typename mtl::Collection<Vector>::value_type Scalar;
+    typedef typename mtl::Collection<Vector>::size_type  Size;
+
+    if (size(b) == 0) throw mtl::logic_error("empty rhs vector");
+
+    const Scalar                zero= math::zero(Scalar());
+    Scalar                      rho, nu, hr;
+    Size                        k, kmax(std::min(size(x), Size(iter.max_iterations() - iter.iterations())));
+    Vector                      r0(b - A *x), r(solve(L,r0)), va(resource(x)), va0(resource(x)), va00(resource(x));
+    mtl::matrix::multi_vector<Vector>   V(Vector(resource(x), zero), kmax+1);
+    mtl::vector::dense_vector<Scalar>   s(kmax+1, zero), c(kmax+1, zero), g(kmax+1, zero), y(kmax, zero);  // replicated in distributed solvers
+    mtl::matrix::dense2D<Scalar>        H(kmax+1, kmax);                                             // dito
+    H= 0;
+
+    rho= g[0]= two_norm(r);
+    if (iter.finished(rho))
+	return iter;
+    V.vector(0)= r / rho;
+    H= zero;
+
+    // GMRES iteration
+    for (k= 0; k < kmax ; ++k, ++iter) {
+        va0= A * Vector(solve(R, V.vector(k)));
+        V.vector(k+1)= va= solve(L,va0);
+	// orth(V, V[k+1], false);
+        // modified Gram Schmidt method
+        for (Size j= 0; j < k+1; j++) {
+	    H[j][k]= dot(V.vector(j), V.vector(k+1));
+	    V.vector(k+1)-= H[j][k] * V.vector(j);
+        }
+        H[k+1][k]= two_norm(V.vector(k+1));
+        //reorthogonalize
+        for(Size j= 0; j < k+1; j++) {
+	    hr= dot(V.vector(k+1), V.vector(j));
+            H[j][k]+= hr;
+            V.vector(k+1)-= hr * V.vector(j);
+        }
+        H[k+1][k]= two_norm(V.vector(k+1));
+	if (H[k+1][k] != zero)                // watch for breakdown
+            V.vector(k+1)*= 1. / H[k+1][k];
+
+        // k Given's rotations
+	for(Size i= 0; i < k; i++)
+	    mtl::matrix::givens<mtl::matrix::dense2D<Scalar> >(H, H[i][k-1], H[i+1][k-1]).trafo(i);
+
+       nu= sqrt(H[k][k]*H[k][k]+H[k+1][k]*H[k+1][k]);
+       if(nu != zero){
+            c[k]=  H[k][k]/nu;
+            s[k]= -H[k+1][k]/nu;
+            H[k][k]=c[k]*H[k][k]-s[k]*H[k+1][k];
+            H[k+1][k]=0;
+ 	    mtl::vector::givens<mtl::vector::dense_vector<Scalar> >(g, c[k], s[k]).trafo(k);
+        }
+	rho= abs(g[k+1]);
+    }
+
+    //reduce k, to get regular matrix
+    while (k > 0 && abs(g[k-1]<= iter.atol())) k--;
+
+    // iteration is finished -> compute x: solve H*y=g as far as rank of H allows
+    irange                  range(k);
+    for (; !range.empty(); --range) {
+	try {
+	    y[range]= lu_solve(H[range][range], g[range]);
+	} catch (mtl::matrix_singular) { continue; } // if singular then try with sub-matrix
+	break;
+    }
+
+    if (range.finish() < k)
+  	std::cerr << "GMRES orhogonalized with " << k << " vectors but matrix singular, can only use "
+		  << range.finish() << " vectors!\n";
+    if (range.empty())
+        return iter.fail(2, "GMRES did not find any direction to correct x");
+    x+= Vector(solve(R, Vector(V.vector(range)*y[range])));
+
+    r= b - A*x;
+    return iter.terminate(r);
+}
+
+/// Generalized Minimal Residual method with restart
+template < typename Matrix, typename Vector, typename LeftPreconditioner,
+           typename RightPreconditioner, typename Iteration >
+int gmres(const Matrix &A, Vector &x, const Vector &b,
+          LeftPreconditioner &L, RightPreconditioner &R,
+	  Iteration& iter, typename mtl::Collection<Vector>::size_type restart)
+{
+     do {
+	 Iteration inner(iter);
+	 inner.set_max_iterations(std::min(int(iter.iterations()+restart), iter.max_iterations()));
+	 inner.suppress_resume(true);
+	 gmres_full(A, x, b, L, R, inner);
+	 iter.update_progress(inner);
+     } while (!iter.finished());
+
+     return iter;
+}
+
+/// Solver class for GMRES; right preconditioner ignored (prints warning if not identity)
+template < typename LinearOperator, typename Preconditioner= pc::identity<LinearOperator>,
+	   typename RightPreconditioner= pc::identity<LinearOperator> >
+class gmres_solver
+{
+  public:
+    /// Construct solver from a linear operator; generate (left) preconditioner from it
+    explicit gmres_solver(const LinearOperator& A, size_t restart= 8)
+      : A(A), restart(restart), L(A), R(A) {}
+
+    /// Construct solver from a linear operator and left preconditioner
+    gmres_solver(const LinearOperator& A, size_t restart, const Preconditioner& L)
+      : A(A), restart(restart), L(L), R(A) {}
+
+    /// Construct solver from a linear operator and left preconditioner
+    gmres_solver(const LinearOperator& A, size_t restart, const Preconditioner& L, const RightPreconditioner& R)
+      : A(A), restart(restart), L(L), R(R) {}
+
+    /// Solve linear system approximately as specified by \p iter
+    template < typename HilbertSpaceB, typename HilbertSpaceX, typename Iteration >
+    int solve(const HilbertSpaceB& b, HilbertSpaceX& x, Iteration& iter) const
+    {
+	return gmres(A, x, b, L, R, iter, restart);
+    }
+
+    /// Perform one GMRES iteration on linear system
+    template < typename HilbertSpaceB, typename HilbertSpaceX >
+    int solve(const HilbertSpaceB& b, HilbertSpaceX& x) const
+    {
+	itl::basic_iteration<double> iter(x, 1, 0, 0);
+	return solve(b, x, iter);
+    }
+
+  private:
+    const LinearOperator& A;
+    size_t                restart;
+    Preconditioner        L;
+    RightPreconditioner   R;
+};
+
+
+} // namespace itl
+
+#endif // ITL_GMRES_INCLUDE
+
+

AMDiS/lib/mtl4/boost/numeric/itl/krylov/idr_s.hpp

+// Software License for MTL
+//
+// Copyright (c) 2007 The Trustees of Indiana University.
+//               2008 Dresden University of Technology and the Trustees of Indiana University.
+//               2010 SimuNova UG (haftungsbeschränkt), www.simunova.com.
+// All rights reserved.
+// Authors: Peter Gottschling and Andrew Lumsdaine
+//
+// This file is part of the Matrix Template Library
+//
+// See also license.mtl.txt in the distribution.
+
+// Peter Sonneveld and Martin B. van Gijzen, IDR(s): a family of simple and fast algorithms for solving large nonsymmetric linear systems.
+// SIAM J. Sci. Comput. Vol. 31, No. 2, pp. 1035-1062 (2008). (copyright SIAM)
+
+#ifndef ITL_IDR_S_INCLUDE
+#define ITL_IDR_S_INCLUDE
+
+#include <boost/numeric/mtl/concept/collection.hpp>
+#include <boost/numeric/mtl/vector/dense_vector.hpp>
+#include <boost/numeric/mtl/operation/random.hpp>
+#include <boost/numeric/mtl/operation/orth.hpp>
+#include <boost/numeric/mtl/operation/resource.hpp>
+#include <boost/numeric/mtl/matrix/strict_upper.hpp>
+#include <boost/numeric/mtl/utility/exception.hpp>
+#include <boost/numeric/mtl/utility/irange.hpp>
+#include <boost/numeric/linear_algebra/identity.hpp>
+#include <boost/numeric/mtl/interface/vpt.hpp>
+
+namespace itl {
+
+/// Induced Dimension Reduction on s dimensions (IDR(s))
+template < typename LinearOperator, typename Vector,
+	   typename LeftPreconditioner, typename RightPreconditioner,
+	   typename Iteration >
+int idr_s(const LinearOperator &A, Vector &x, const Vector &b,
+	  const LeftPreconditioner &, const RightPreconditioner &,
+	  Iteration& iter, size_t s)
+{
+    mtl::vampir_trace<7010> tracer;
+    using mtl::size; using mtl::iall; using mtl::matrix::strict_upper;
+    typedef typename mtl::Collection<Vector>::value_type Scalar;
+    typedef typename mtl::Collection<Vector>::size_type  Size;
+
+    if (size(b) == 0) throw mtl::logic_error("empty rhs vector");
+    if (s < 1) s= 1;
+
+    const Scalar                zero= math::zero(Scalar());
+    Scalar                      omega(zero);
+    Vector                      x0(x), y(resource(x)), v(resource(x)), t(resource(x)), q(resource(x)), r(b - A * x);
+    mtl::matrix::multi_vector<Vector>   dR(Vector(resource(x), zero), s), dX(Vector(resource(x), zero), s), P(Vector(resource(x), zero), s);
+    mtl::vector::dense_vector<Scalar>   m(s), c(s), dm(s);   // replicated in distributed solvers
+    mtl::matrix::dense2D<Scalar>        M(s, s);             // dito
+
+    random(P);
+    P.vector(0)= r;
+    orth(P);
+
+    for (size_t k= 0; k < s; k++) {
+	v= A * r;
+	omega= dot(v, r) / dot(v, v);
+	dX.vector(k)= omega * r;
+	dR.vector(k)= -omega * v;
+	x+= dX.vector(k);
+	r+= dR.vector(k);
+	if ((++iter).finished(r)) return iter;
+	M[iall][k]= trans(P) * dR.vector(k);
+    }
+
+    Size oldest= 0;
+    m= trans(P) * r;
+
+    while (! iter.finished(r)) {
+
+	for (size_t k= 0; k < s; k++) {
+	    c= lu_solve(M, m);
+	    q= dR * -c;
+	    v= r + q;
+	    if (k == 0) {
+		t= A * v;
+		omega= dot(t, v) / dot(t, t);
+		dR.vector(oldest)= q - omega * t;
+		dX.vector(oldest)= omega * v - dX * c;
+	    } else {
+		dX.vector(oldest)= omega * v - dX * c;
+		dR.vector(oldest)= A * -dX.vector(oldest);
+	    }
+	    r+= dR.vector(oldest);
+	    x+= dX.vector(oldest);
+
+	    if ((++iter).finished(r))
+		return iter;
+
+	    dm= trans(P) * dR.vector(oldest);
+	    M[iall][oldest]= dm;
+	    m+= dm;
+	    oldest= (oldest + 1) % s;
+	}
+    }
+    return iter;
+}
+
+/// Solver class for IDR(s) method; right preconditioner ignored (prints warning if not identity)
+template < typename LinearOperator, typename Preconditioner= pc::identity<LinearOperator>,
+	   typename RightPreconditioner= pc::identity<LinearOperator> >
+class idr_s_solver
+{
+  public:
+    /// Construct solver from a linear operator; generate (left) preconditioner from it
+    explicit idr_s_solver(const LinearOperator& A, size_t s= 8) : A(A), s(s), L(A), R(A) {}
+
+    /// Construct solver from a linear operator and left preconditioner
+    idr_s_solver(const LinearOperator& A, size_t s, const Preconditioner& L) : A(A), s(s), L(L), R(A) {}
+
+    /// Construct solver from a linear operator and left preconditioner
+    idr_s_solver(const LinearOperator& A, size_t s, const Preconditioner& L, const RightPreconditioner& R)
+      : A(A), s(s), L(L), R(R) {}
+
+    /// Solve linear system approximately as specified by \p iter
+    template < typename HilbertSpaceB, typename HilbertSpaceX, typename Iteration >
+    int solve(const HilbertSpaceB& b, HilbertSpaceX& x, Iteration& iter) const
+    {
+	return idr_s(A, x, b, L, R, iter, s);
+    }
+
+    /// Perform one IDR(s) iteration on linear system
+    template < typename HilbertSpaceB, typename HilbertSpaceX >
+    int solve(const HilbertSpaceB& b, HilbertSpaceX& x) const
+    {
+	itl::basic_iteration<double> iter(x, 1, 0, 0);
+	return solve(b, x, iter);
+    }
+
+  private:
+    const LinearOperator& A;
+    size_t                s;
+    Preconditioner        L;
+    RightPreconditioner   R;
+};
+
+
+} // namespace itl
+
+#endif // ITL_IDR_S_INCLUDE