Revert pkglint-induced nonsense.diff -r1.2 -r1.3 pkgsrc/biology/mpqc/DESCR
(asau)
@@ -1,24 +1,28 @@ | @@ -1,24 +1,28 @@ | |||
1 | MPQC is the Massively Parallel Quantum Chemistry Program. It computes properties | 1 | MPQC is the Massively Parallel Quantum Chemistry Program. | |
2 | of atoms and molecules from first principles using the time independent | 2 | It computes properties of atoms and molecules from first | |
3 | Schroedinger equation. It runs on a wide range of architectures ranging from | 3 | principles using the time independent Schroedinger equation. | |
4 | single many-core computers to massively parallel computers. Its design is object | 4 | It runs on a wide range of architectures ranging from single | |
5 | oriented, using the C++ programming language. | 5 | many-core computers to massively parallel computers. Its design | |
6 | is object oriented, using the C++ programming language. | |||
6 | 7 | |||
7 | Capabilities: | 8 | Capabilities | |
8 | 9 | |||
9 | * Closed shell, unrestricted and general restricted open shell Hartree-Fock | 10 | * Closed shell, unrestricted and general restricted open shell | |
10 | energies and gradients | 11 | Hartree-Fock energies and gradients | |
11 | * Closed shell, unrestricted and general restricted open shell density | 12 | * Closed shell, unrestricted and general restricted open shell | |
12 | functional theory energies and gradients | 13 | density functional theory energies and gradients | |
13 | * Second order open shell perturbation theory (OPT2[2]) and Z-averaged | 14 | * Second order open shell perturbation theory (OPT2[2]) and | |
14 | perturbation theory (ZAPT2) energies. | 15 | Z-averaged perturbation theory (ZAPT2) energies. | |
15 | * Second order closed shell Moller-Plesset perturbation theory energies and | 16 | * Second order closed shell Moller-Plesset perturbation | |
16 | gradients. | 17 | theory energies and gradients. | |
17 | * Second order Moller-Plesset perturbation theory including an R12/F12 | 18 | * Second order Moller-Plesset perturbation theory | |
18 | correlation factor. Energies of closed- and open-shell systems are supported. | 19 | including an R12/F12 correlation factor. Energies of closed- | |
19 | * Explicitly-correlated R12/F12 coupled-cluster methods via interface to Psi3 | 20 | and open-shell systems are supported. | |
20 | code and via native (experimental) implementation. | 21 | * Explicitly-correlated R12/F12 coupled-cluster methods via | |
21 | * Explicitly-correlated multireference methods (MRCI, CASPT2) via interfaces to GAMESS and MOLCAS codes. | 22 | interface to Psi3 code and via native (experimental) | |
22 | * Robust internal coordinate geometry optimizer that efficiently optimizes | 23 | implementation. | |
23 | molecules with many degrees of freedom. Nearly arbitrary internal coordinate | 24 | * Explicitly-correlated multireference methods (MRCI, CASPT2) | |
24 | constraints can be handled. | 25 | via interfaces to GAMESS and MOLCAS codes. | |
26 | * Robust internal coordinate geometry optimizer that efficiently | |||
27 | optimizes molecules with many degrees of freedom. Nearly | |||
28 | arbitrary internal coordinate constraints can be handled. |
@@ -1,15 +1,17 @@ | @@ -1,15 +1,17 @@ | |||
1 | phpPgAdmin is a web-based administration tool for PostgreSQL. It is perfect for | 1 | phpPgAdmin is a web-based administration tool for PostgreSQL. It is perfect | |
2 | PostgreSQL DBAs, newbies and hosting services. Features include: | 2 | for PostgreSQL DBAs, newbies and hosting services. | |
3 | ||||
4 | Features include: | |||
3 | - Administer multiple servers | 5 | - Administer multiple servers | |
4 | - Support for PostgreSQL 7.4.x, 8.0.x, 8.1.x, 8.2.x, 8.3.x, 8.4.x, 9.0.x | 6 | - Support for PostgreSQL 7.4.x, 8.0.x, 8.1.x, 8.2.x, 8.3.x, 8.4.x, 9.0.x | |
5 | - Manage all aspects of: | 7 | - Manage all aspects of: | |
6 | * Users & groups | 8 | * Users & groups | |
7 | * Databases | 9 | * Databases | |
8 | * Schemas | 10 | * Schemas | |
9 | * Tables, indexes, constraints, triggers, rules & privileges, | 11 | * Tables, indexes, constraints, triggers, rules & privileges, | |
10 | * Views, sequences & functions | 12 | * Views, sequences & functions | |
11 | * Advanced objects | 13 | * Advanced objects | |
12 | * Reports | 14 | * Reports | |
13 | - Easy data manipulation: | 15 | - Easy data manipulation: | |
14 | * Browse tables, views & reports | 16 | * Browse tables, views & reports | |
15 | * Execute arbitrary SQL | 17 | * Execute arbitrary SQL |
@@ -1,24 +1,43 @@ | @@ -1,24 +1,43 @@ | |||
1 | This package provides the following PostgreSQL modules: citext, hstore, | 1 | This package provides the following PostgreSQL modules: | |
2 | intarray, isn, ltree, lo, uuid-ossp, and unaccent. The "citext" module provides | 2 | - citext | |
3 | a case-insensitive character string type, citext. | 3 | - hstore | |
4 | - intarray | |||
5 | - isn | |||
6 | - ltree | |||
7 | - lo | |||
8 | - uuid-ossp | |||
9 | - unaccent | |||
10 | ||||
11 | The "citext" module provides a case-insensitive character string type, | |||
12 | citext. Essentially, it internally calls lower when comparing values. | |||
13 | Otherwise, it behaves almost exactly like text. | |||
14 | ||||
15 | The "hstore" module implements the "hstore" data type for storing sets | |||
16 | of key/value pairs within a single PostgreSQL value. This can be useful | |||
17 | in various scenarios, such as rows with many attributes that are rarely | |||
18 | examined, or semi-structured data. Keys and values are simply text strings. | |||
19 | ||||
20 | The "intarray" module provides a number of useful functions and operators | |||
21 | for manipulating one-dimensional arrays of integers. There is also support | |||
22 | for indexed searches using some of the operators. | |||
23 | ||||
24 | The "isn" module provides data types for the following international | |||
25 | product numbering standards: EAN13, UPC, ISBN (books), ISMN (music), | |||
26 | and ISSN (serials). Numbers are validated on input, and correctly | |||
27 | hyphenated on output. | |||
28 | ||||
29 | The "ltree" module implements a data type ltree for representing | |||
30 | labels of data stored in a hierarchical tree-like structure. | |||
31 | Extensive facilities for searching through label trees are provided. | |||
4 | 32 | |||
5 | The "hstore" module implements the "hstore" data type for storing sets of | 33 | The "lo" module provides support for managing Large Objects (also called | |
6 | key/value pairs within a single PostgreSQL value. | 34 | LOs or BLOBs). This includes a data type "lo" and a trigger "lo_manage." | |
7 | ||||
8 | The "intarray" module provides a number of useful functions and operators for | |||
9 | manipulating one-dimensional arrays of integers. | |||
10 | ||||
11 | The "isn" module provides data types for the following international product | |||
12 | numbering standards: EAN13, UPC, ISBN (books), ISMN (music), and ISSN (serials). | |||
13 | ||||
14 | The "ltree" module implements a data type ltree for representing labels of data | |||
15 | stored in a hierarchical tree-like structure. | |||
16 | ||||
17 | The "lo" module provides support for managing Large Objects (also called LOs or | |||
18 | BLOBs). This includes a data type "lo" and a trigger "lo_manage." | |||
19 | 35 | |||
20 | The "uuid-ossp" module provides functions to generate universally unique | 36 | The "uuid-ossp" module provides functions to generate universally unique | |
21 | identifiers (UUIDs) using one of several standard algorithms. | 37 | identifiers (UUIDs) using one of several standard algorithms. There are | |
38 | also functions to produce certain special UUID constants. | |||
22 | 39 | |||
23 | "unaccent" is a text search dictionary that removes accents (diacritic signs) | 40 | "unaccent" is a text search dictionary that removes accents (diacritic signs) | |
24 | from lexemes. | 41 | from lexemes. It's a filtering dictionary, which means its output is always | |
42 | passed to the next dictionary (if any), unlike the normal behavior of | |||
43 | dictionaries. This allows accent-insensitive processing for full text search. |
@@ -1,24 +1,43 @@ | @@ -1,24 +1,43 @@ | |||
1 | This package provides the following PostgreSQL modules: citext, hstore, | 1 | This package provides the following PostgreSQL modules: | |
2 | intarray, isn, ltree, lo, uuid-ossp, and unaccent. The "citext" module provides | 2 | - citext | |
3 | a case-insensitive character string type, citext. | 3 | - hstore | |
4 | - intarray | |||
5 | - isn | |||
6 | - ltree | |||
7 | - lo | |||
8 | - uuid-ossp | |||
9 | - unaccent | |||
10 | ||||
11 | The "citext" module provides a case-insensitive character string type, | |||
12 | citext. Essentially, it internally calls lower when comparing values. | |||
13 | Otherwise, it behaves almost exactly like text. | |||
14 | ||||
15 | The "hstore" module implements the "hstore" data type for storing sets | |||
16 | of key/value pairs within a single PostgreSQL value. This can be useful | |||
17 | in various scenarios, such as rows with many attributes that are rarely | |||
18 | examined, or semi-structured data. Keys and values are simply text strings. | |||
19 | ||||
20 | The "intarray" module provides a number of useful functions and operators | |||
21 | for manipulating one-dimensional arrays of integers. There is also support | |||
22 | for indexed searches using some of the operators. | |||
23 | ||||
24 | The "isn" module provides data types for the following international | |||
25 | product numbering standards: EAN13, UPC, ISBN (books), ISMN (music), | |||
26 | and ISSN (serials). Numbers are validated on input, and correctly | |||
27 | hyphenated on output. | |||
28 | ||||
29 | The "ltree" module implements a data type ltree for representing | |||
30 | labels of data stored in a hierarchical tree-like structure. | |||
31 | Extensive facilities for searching through label trees are provided. | |||
4 | 32 | |||
5 | The "hstore" module implements the "hstore" data type for storing sets of | 33 | The "lo" module provides support for managing Large Objects (also called | |
6 | key/value pairs within a single PostgreSQL value. | 34 | LOs or BLOBs). This includes a data type "lo" and a trigger "lo_manage." | |
7 | ||||
8 | The "intarray" module provides a number of useful functions and operators for | |||
9 | manipulating one-dimensional arrays of integers. | |||
10 | ||||
11 | The "isn" module provides data types for the following international product | |||
12 | numbering standards: EAN13, UPC, ISBN (books), ISMN (music), and ISSN (serials). | |||
13 | ||||
14 | The "ltree" module implements a data type ltree for representing labels of data | |||
15 | stored in a hierarchical tree-like structure. | |||
16 | ||||
17 | The "lo" module provides support for managing Large Objects (also called LOs or | |||
18 | BLOBs). This includes a data type "lo" and a trigger "lo_manage." | |||
19 | 35 | |||
20 | The "uuid-ossp" module provides functions to generate universally unique | 36 | The "uuid-ossp" module provides functions to generate universally unique | |
21 | identifiers (UUIDs) using one of several standard algorithms. | 37 | identifiers (UUIDs) using one of several standard algorithms. There are | |
38 | also functions to produce certain special UUID constants. | |||
22 | 39 | |||
23 | "unaccent" is a text search dictionary that removes accents (diacritic signs) | 40 | "unaccent" is a text search dictionary that removes accents (diacritic signs) | |
24 | from lexemes. | 41 | from lexemes. It's a filtering dictionary, which means its output is always | |
42 | passed to the next dictionary (if any), unlike the normal behavior of | |||
43 | dictionaries. This allows accent-insensitive processing for full text search. |
@@ -1,24 +1,43 @@ | @@ -1,24 +1,43 @@ | |||
1 | This package provides the following PostgreSQL modules: citext, hstore, | 1 | This package provides the following PostgreSQL modules: | |
2 | intarray, isn, ltree, lo, uuid-ossp, and unaccent. The "citext" module provides | 2 | - citext | |
3 | a case-insensitive character string type, citext. | 3 | - hstore | |
4 | - intarray | |||
5 | - isn | |||
6 | - ltree | |||
7 | - lo | |||
8 | - uuid-ossp | |||
9 | - unaccent | |||
10 | ||||
11 | The "citext" module provides a case-insensitive character string type, | |||
12 | citext. Essentially, it internally calls lower when comparing values. | |||
13 | Otherwise, it behaves almost exactly like text. | |||
14 | ||||
15 | The "hstore" module implements the "hstore" data type for storing sets | |||
16 | of key/value pairs within a single PostgreSQL value. This can be useful | |||
17 | in various scenarios, such as rows with many attributes that are rarely | |||
18 | examined, or semi-structured data. Keys and values are simply text strings. | |||
19 | ||||
20 | The "intarray" module provides a number of useful functions and operators | |||
21 | for manipulating one-dimensional arrays of integers. There is also support | |||
22 | for indexed searches using some of the operators. | |||
23 | ||||
24 | The "isn" module provides data types for the following international | |||
25 | product numbering standards: EAN13, UPC, ISBN (books), ISMN (music), | |||
26 | and ISSN (serials). Numbers are validated on input, and correctly | |||
27 | hyphenated on output. | |||
28 | ||||
29 | The "ltree" module implements a data type ltree for representing | |||
30 | labels of data stored in a hierarchical tree-like structure. | |||
31 | Extensive facilities for searching through label trees are provided. | |||
4 | 32 | |||
5 | The "hstore" module implements the "hstore" data type for storing sets of | 33 | The "lo" module provides support for managing Large Objects (also called | |
6 | key/value pairs within a single PostgreSQL value. | 34 | LOs or BLOBs). This includes a data type "lo" and a trigger "lo_manage." | |
7 | ||||
8 | The "intarray" module provides a number of useful functions and operators for | |||
9 | manipulating one-dimensional arrays of integers. | |||
10 | ||||
11 | The "isn" module provides data types for the following international product | |||
12 | numbering standards: EAN13, UPC, ISBN (books), ISMN (music), and ISSN (serials). | |||
13 | ||||
14 | The "ltree" module implements a data type ltree for representing labels of data | |||
15 | stored in a hierarchical tree-like structure. | |||
16 | ||||
17 | The "lo" module provides support for managing Large Objects (also called LOs or | |||
18 | BLOBs). This includes a data type "lo" and a trigger "lo_manage." | |||
19 | 35 | |||
20 | The "uuid-ossp" module provides functions to generate universally unique | 36 | The "uuid-ossp" module provides functions to generate universally unique | |
21 | identifiers (UUIDs) using one of several standard algorithms. | 37 | identifiers (UUIDs) using one of several standard algorithms. There are | |
38 | also functions to produce certain special UUID constants. | |||
22 | 39 | |||
23 | "unaccent" is a text search dictionary that removes accents (diacritic signs) | 40 | "unaccent" is a text search dictionary that removes accents (diacritic signs) | |
24 | from lexemes. | 41 | from lexemes. It's a filtering dictionary, which means its output is always | |
42 | passed to the next dictionary (if any), unlike the normal behavior of | |||
43 | dictionaries. This allows accent-insensitive processing for full text search. |
@@ -1,23 +1,44 @@ | @@ -1,23 +1,44 @@ | |||
1 | There are plenty of open-source version control systems available on the | 1 | There are plenty of open-source version control systems available | |
2 | Internet these days. What makes Fossil worthy of attention? | 2 | on the internet these days. What makes Fossil worthy of attention? | |
3 | 3 | |||
4 | 1. Bug Tracking And Wiki - In addition to doing distributed version control | 4 | 1. Bug Tracking And Wiki - In addition to doing distributed | |
5 | like Git and Mercurial, Fossil also supports distributed bug tracking and | 5 | version control like Git and Mercurial, Fossil also supports | |
6 | distributed wiki all in a single integrated package. | 6 | distributed bug tracking and distributed wiki all in a single | |
7 | 7 | integrated package. | ||
8 | 2. Web Interface - Fossil has a built-in and easy-to-use web interface that | 8 | ||
9 | simplifies project tracking and promotes situational awareness. Simply type | 9 | 2. Web Interface - Fossil has a built-in and easy-to-use web | |
10 | "fossil ui" from within any check-out and Fossil automatically opens your web | 10 | interface that simplifies project tracking and promotes situational | |
11 | browser in a page that gives detailed history and status information on that | 11 | awareness. Simply type "fossil ui" from within any check-out | |
12 | project. | 12 | and Fossil automatically opens your web browser in a page that | |
13 | 13 | gives detailed history and status information on that project. | ||
14 | 3. Autosync - Fossil supports "autosync" mode which helps to keep projects | 14 | ||
15 | moving forward by reducing the amount of needless forking and merging often | 15 | 3. Autosync - Fossil supports "autosync" mode which helps to | |
16 | associated distributed projects. | 16 | keep projects moving forward by reducing the amount of needless | |
17 | 17 | forking and merging often associated distributed projects. | ||
18 | 4. Self-Contained - Fossil is a single stand-alone executable that contains | 18 | ||
19 | everything needed to do configuration management. Installation is trivial: | 19 | 4. Self-Contained - Fossil is a single stand-alone executable | |
20 | simply download a precompiled binary for Linux, Mac, or Windows and put it on | 20 | that contains everything needed to do configuration management. | |
21 | your $PATH. Easy-to-compile source code is available for users on other | 21 | Installation is trivial: simply download a precompiled binary | |
22 | platforms. Fossil sources are also mostly self-contained, requiring only the | 22 | for Linux, Mac, or Windows and put it on your $PATH. Easy-to-compile | |
23 | "zlib" library and the standard C library to build. | 23 | source code is available for users on other platforms. Fossil | |
24 | sources are also mostly self-contained, requiring only the "zlib" | |||
25 | library and the standard C library to build. | |||
26 | ||||
27 | 5. Simple Networking - Fossil uses plain old HTTP (with proxy | |||
28 | support) for all network communications, meaning that it works | |||
29 | fine from behind restrictive firewalls. The protocol is bandwidth | |||
30 | efficient to the point that Fossil can be used comfortably over | |||
31 | a dial-up internet connection. | |||
32 | ||||
33 | 6. CGI Enabled - No server is required to use fossil. But a | |||
34 | server does make collaboration easier. Fossil supports three | |||
35 | different yet simple server configurations. The most popular is | |||
36 | a 2-line CGI script. This is the approach used by the self-hosting | |||
37 | fossil repositories. | |||
38 | ||||
39 | 7. Robust & Reliable - Fossil stores content in an SQLite database | |||
40 | so that transactions are atomic even if interrupted by a power | |||
41 | loss or system crash. Furthermore, automatic self-checks verify | |||
42 | that all aspects of the repository are consistent prior to each | |||
43 | commit. In over two years of operation, no work has ever been | |||
44 | lost after having been committed to a Fossil repository. |
@@ -1,17 +1,19 @@ | @@ -1,17 +1,19 @@ | |||
1 | Texmaker is a free LaTeX editor, that integrates many tools needed to develop | 1 | Texmaker is a free LaTeX editor, that integrates many tools needed to develop | |
2 | documents with LaTeX, in just one application. Texmaker runs on UNIX, MacOS X | 2 | documents with LaTeX, in just one application. Texmaker runs on UNIX, MacOS X | |
3 | and Windows systems and is released under the GPL license. Features: | 3 | and Windows systems and is released under the GPL license. | |
4 | * a unicode editor to write your LaTeX source files (syntax highlighting, | 4 | ||
5 | Features: | |||
6 | * an unicode editor to write your LaTeX source files (syntax highlighting, | |||
5 | undo-redo, search-replace, spell checker...) | 7 | undo-redo, search-replace, spell checker...) | |
6 | * the principal LaTex tags can be inserted directly with the "LaTeX" and "Math" | 8 | * the principal LaTex tags can be inserted directly with the "LaTeX" and "Math" | |
7 | menus | 9 | menus | |
8 | * 370 mathematical symbols can be inserted in just one click | 10 | * 370 mathematical symbols can be inserted in just one click | |
9 | * wizards to generate code ('Quick document', 'Quick letter', tabular, tabbing | 11 | * wizards to generate code ('Quick document', 'Quick letter', tabular, tabbing | |
10 | and array environments) | 12 | and array environments) | |
11 | * LaTeX-related programs can be launched via the "Tools" menu | 13 | * LaTeX-related programs can be launched via the "Tools" menu | |
12 | * the standard Bibtex entry types can be inserted in the ".bib" file with the | 14 | * the standard Bibtex entry types can be inserted in the ".bib" file with the | |
13 | "Bibliography" menu | 15 | "Bibliography" menu | |
14 | * a "structure view" of the document for easier navigation of a document (by | 16 | * a "structure view" of the document for easier navigation of a document (by | |
15 | clicking on an item in the "Structure" frame, you can jump directly to the | 17 | clicking on an item in the "Structure" frame, you can jump directly to the | |
16 | corresponding part of your document | 18 | corresponding part of your document | |
17 | * extensive LaTeX documentation | 19 | * extensive LaTeX documentation |
@@ -1,22 +1,25 @@ | @@ -1,22 +1,25 @@ | |||
1 | Most of the GNU Emacs text editor is written in the programming language called | 1 | Most of the GNU Emacs text editor is written in the programming | |
2 | Emacs Lisp. You can write new code in Emacs Lisp and install it as an extension | 2 | language called Emacs Lisp. You can write new code in Emacs Lisp and | |
3 | to the editor. However, Emacs Lisp is more than a mere "extension language"; it | 3 | install it as an extension to the editor. However, Emacs Lisp is more | |
4 | is a full computer programming language in its own right. You can use it as you | 4 | than a mere ``extension language''; it is a full computer programming | |
5 | would any other programming language. | 5 | language in its own right. You can use it as you would any other | |
6 | programming language. | |||
6 | 7 | |||
7 | Because Emacs Lisp is designed for use in an editor, it has special features for | 8 | Because Emacs Lisp is designed for use in an editor, it has special | |
8 | scanning and parsing text as well as features for handling files, buffers, | 9 | features for scanning and parsing text as well as features for handling | |
9 | displays, subprocesses, and so on. Emacs Lisp is closely integrated with the | 10 | files, buffers, displays, subprocesses, and so on. Emacs Lisp is | |
10 | editing facilities; thus, editing commands are functions that can also | 11 | closely integrated with the editing facilities; thus, editing commands | |
11 | conveniently be called from Lisp programs, and parameters for customization are | 12 | are functions that can also conveniently be called from Lisp programs, | |
12 | ordinary Lisp variables. | 13 | and parameters for customization are ordinary Lisp variables. | |
13 | 14 | |||
14 | This manual attempts to be a full description of Emacs Lisp. For a beginner's | 15 | This manual attempts to be a full description of Emacs Lisp. For a | |
15 | introduction to Emacs Lisp, see "An Introduction to Emacs Lisp Programming," by | 16 | beginner's introduction to Emacs Lisp, see ``An Introduction to | |
16 | Bob Chassell, also published by the Free Software Foundation. This manual | 17 | Emacs Lisp Programming,'' by Bob Chassell, also published by the Free | |
17 | presumes considerable familiarity with the use of Emacs for editing; see "The | 18 | Software Foundation. This manual presumes considerable familiarity with | |
18 | GNU Emacs Manual" for this basic information. | 19 | the use of Emacs for editing; see ``The GNU Emacs Manual'' for this | |
20 | basic information. | |||
19 | 21 | |||
20 | Generally speaking, the earlier chapters describe features of Emacs Lisp that | 22 | Generally speaking, the earlier chapters describe features of Emacs | |
21 | have counterparts in many programming languages, and later chapters describe | 23 | Lisp that have counterparts in many programming languages, and later | |
22 | features that are peculiar to Emacs Lisp or relate specifically to editing. | 24 | chapters describe features that are peculiar to Emacs Lisp or relate | |
25 | specifically to editing. |
@@ -1,4 +1,4 @@ | @@ -1,4 +1,4 @@ | |||
1 | Scala is a general purpose programming language designed to express common | 1 | Scala is a general purpose programming language designed to express common | |
2 | programming patterns in a concise, elegant, and type-safe way. It smoothly | 2 | programming patterns in a concise, elegant, and type-safe way. It smoothly | |
3 | integrates features of object-oriented and functional languages, enabling Java | 3 | integrates features of object-oriented and functional languages, enabling | |
4 | and other programmers to be more productive. | 4 | Java and other programmers to be more productive. |
@@ -1,23 +1,35 @@ | @@ -1,23 +1,35 @@ | |||
1 | ARPACK is a collection of Fortran77 subroutines designed to solve large scale | 1 | ARPACK is a collection of Fortran77 subroutines designed to solve large | |
2 | eigenvalue problems. The package is designed to compute a few eigenvalues and | 2 | scale eigenvalue problems. | |
3 | corresponding eigenvectors of a general n by n matrix A. It is most appropriate | 3 | ||
4 | for large sparse or structured matrices A where structured means that a | 4 | The package is designed to compute a few eigenvalues and corresponding | |
5 | matrix-vector product w <- Av requires order n rather than the usual order n**2 | 5 | eigenvectors of a general n by n matrix A. It is most appropriate for large | |
6 | floating point operations. This software is based upon an algorithmic variant of | 6 | sparse or structured matrices A where structured means that a matrix-vector | |
7 | the Arnoldi process called the Implicitly Restarted Arnoldi Method (IRAM). When | 7 | product w <- Av requires order n rather than the usual order n**2 floating | |
8 | the matrix A is symmetric it reduces to a variant of the Lanczos process called | 8 | point operations. This software is based upon an algorithmic variant of the | |
9 | the Implicitly Restarted Lanczos Method (IRLM). These variants may be viewed as | 9 | Arnoldi process called the Implicitly Restarted Arnoldi Method (IRAM). When | |
10 | a synthesis of the Arnoldi/Lanczos process with the Implicitly Shifted QR | 10 | the matrix A is symmetric it reduces to a variant of the Lanczos process | |
11 | technique that is suitable for large scale problems. For many standard problems, | 11 | called the Implicitly Restarted Lanczos Method (IRLM). These variants may be | |
12 | a matrix factorization is not required. Only the action of the matrix on a | 12 | viewed as a synthesis of the Arnoldi/Lanczos process with the Implicitly | |
13 | vector is needed. ARPACK software is capable of solving large scale symmetric, | 13 | Shifted QR technique that is suitable for large scale problems. For many | |
14 | nonsymmetric, and generalized eigenproblems from significant application areas. | 14 | standard problems, a matrix factorization is not required. Only the action | |
15 | The software is designed to compute a few (k) eigenvalues with user specified | 15 | of the matrix on a vector is needed. ARPACK software is capable of solving | |
16 | features such as those of largest real part or largest magnitude. Storage | 16 | large scale symmetric, nonsymmetric, and generalized eigenproblems from | |
17 | requirements are on the order of n*k locations. No auxiliary storage is | 17 | significant application areas. The software is designed to compute a few (k) | |
18 | required. A set of Schur basis vectors for the desired k-dimensional eigen-space | 18 | eigenvalues with user specified features such as those of largest real part | |
19 | is computed which is numerically orthogonal to working precision. Numerically accurate eigenvectors are available on request. Important Features: | 19 | or largest magnitude. Storage requirements are on the order of n*k locations. | |
20 | o Reverse Communication Interface. | 20 | No auxiliary storage is required. A set of Schur basis vectors for the desired | |
21 | o Single and Double Precision Real Arithmetic Versions for Symmetric, | 21 | k-dimensional eigen-space is computed which is numerically orthogonal to working | |
22 | Non-symmetric, Standard or Generalized Problems. | 22 | precision. Numerically accurate eigenvectors are available on request. | |
23 | ...and more! | 23 | ||
24 | Important Features: | |||
25 | ||||
26 | o Reverse Communication Interface. | |||
27 | o Single and Double Precision Real Arithmetic Versions for Symmetric, | |||
28 | Non-symmetric, Standard or Generalized Problems. | |||
29 | o Single and Double Precision Complex Arithmetic Versions for Standard | |||
30 | or Generalized Problems. | |||
31 | o Routines for Banded Matrices - Standard or Generalized Problems. | |||
32 | o Routines for The Singular Value Decomposition. | |||
33 | o Example driver routines that may be used as templates to implement | |||
34 | numerous Shift-Invert strategies for all problem types, data types | |||
35 | and precision. |
@@ -1,24 +1,31 @@ | @@ -1,24 +1,31 @@ | |||
1 | Eigen 2 is a C++ template library for linear algebra: vectors, matrices, and | 1 | Eigen 2 is a C++ template library for linear algebra: vectors, matrices, and | |
2 | related algorithms. It is: | 2 | related algorithms. It is: | |
3 | * Versatile. Eigen handles, without code duplication, and in a completely | 3 | * Versatile. Eigen handles, without code duplication, and in a completely | |
4 | integrated way: | 4 | integrated way: | |
5 | o both fixed-size and dynamic-size matrices and vectors. | 5 | o both fixed-size and dynamic-size matrices and vectors. | |
6 | o both dense and sparse (the latter is still experimental) matrices and | 6 | o both dense and sparse (the latter is still experimental) matrices and | |
7 | vectors. | 7 | vectors. | |
8 | o both plain matrices/vectors and abstract expressions. | 8 | o both plain matrices/vectors and abstract expressions. | |
9 | o both column-major (the default) and row-major matrix storage. | 9 | o both column-major (the default) and row-major matrix storage. | |
10 | o both basic matrix/vector manipulation and many more advanced, specialized | 10 | o both basic matrix/vector manipulation and many more advanced, specialized | |
11 | modules providing algorithms for linear algebra, geometry, quaternions, or | 11 | modules providing algorithms for linear algebra, geometry, quaternions, | |
12 | advanced array manipulation. | 12 | or advanced array manipulation. | |
13 | * Fast. | 13 | * Fast. | |
14 | o Expression templates allow to intelligently remove temporaries and enable | 14 | o Expression templates allow to intelligently remove temporaries and enable | |
15 | lazy evaluation, when that is appropriate -- Eigen takes care of this | 15 | lazy evaluation, when that is appropriate -- Eigen takes care of this | |
16 | automatically and handles aliasing too in most cases. | 16 | automatically and handles aliasing too in most cases. | |
17 | o Explicit vectorization is performed for the SSE (2 and later) and AltiVec | 17 | o Explicit vectorization is performed for the SSE (2 and later) and AltiVec | |
18 | instruction sets, with graceful fallback to non-vectorized code. Expression | 18 | instruction sets, with graceful fallback to non-vectorized code. | |
19 | templates allow to perform these optimizations globally for whole | 19 | Expression templates allow to perform these optimizations globally for | |
20 | expressions. | 20 | whole expressions. | |
21 | o With fixed-size objects, dynamic memory allocation is avoided, and the | 21 | o With fixed-size objects, dynamic memory allocation is avoided, and the | |
22 | loops are unrolled when that makes sense. | 22 | loops are unrolled when that makes sense. | |
23 | o For large matrices, special attention is paid to cache-friendliness. | 23 | o For large matrices, special attention is paid to cache-friendliness. | |
24 | ...and more! | 24 | * Elegant. The API is extremely clean and expressive, thanks to expression | |
25 | templates. Implementing an algorithm on top of Eigen feels like just copying | |||
26 | pseudocode. You can use complex expressions and still rely on Eigen to | |||
27 | produce optimized code: there is no need for you to manually decompose | |||
28 | expressions into small steps. | |||
29 | * Compiler-friendy. Eigen has very reasonable compilation times at least with | |||
30 | GCC, compared to other C++ libraries based on expression templates and heavy | |||
31 | metaprogramming. Eigen is also standard C++ and supports various compilers. |
@@ -11,14 +11,21 @@ related algorithms. It is: | @@ -11,14 +11,21 @@ related algorithms. It is: | |||
11 | modules providing algorithms for linear algebra, geometry, quaternions, | 11 | modules providing algorithms for linear algebra, geometry, quaternions, | |
12 | or advanced array manipulation. | 12 | or advanced array manipulation. | |
13 | * Fast. | 13 | * Fast. | |
14 | o Expression templates allow to intelligently remove temporaries and enable | 14 | o Expression templates allow to intelligently remove temporaries and enable | |
15 | lazy evaluation, when that is appropriate -- Eigen takes care of this | 15 | lazy evaluation, when that is appropriate -- Eigen takes care of this | |
16 | automatically and handles aliasing too in most cases. | 16 | automatically and handles aliasing too in most cases. | |
17 | o Explicit vectorization is performed for the SSE (2 and later) and AltiVec | 17 | o Explicit vectorization is performed for the SSE (2 and later) and AltiVec | |
18 | instruction sets, with graceful fallback to non-vectorized code. | 18 | instruction sets, with graceful fallback to non-vectorized code. | |
19 | Expression templates allow to perform these optimizations globally for | 19 | Expression templates allow to perform these optimizations globally for | |
20 | whole expressions. | 20 | whole expressions. | |
21 | o With fixed-size objects, dynamic memory allocation is avoided, and the | 21 | o With fixed-size objects, dynamic memory allocation is avoided, and the | |
22 | loops are unrolled when that makes sense. | 22 | loops are unrolled when that makes sense. | |
23 | o For large matrices, special attention is paid to cache-friendliness. | 23 | o For large matrices, special attention is paid to cache-friendliness. | |
24 | ...and more! | 24 | * Elegant. The API is extremely clean and expressive, thanks to expression | |
25 | templates. Implementing an algorithm on top of Eigen feels like just copying | |||
26 | pseudocode. You can use complex expressions and still rely on Eigen to | |||
27 | produce optimized code: there is no need for you to manually decompose | |||
28 | expressions into small steps. | |||
29 | * Compiler-friendy. Eigen has very reasonable compilation times at least with | |||
30 | GCC, compared to other C++ libraries based on expression templates and heavy | |||
31 | metaprogramming. Eigen is also standard C++ and supports various compilers. |
@@ -1,20 +1,24 @@ | @@ -1,20 +1,24 @@ | |||
1 | The Open MPI Project is an open source MPI-2 implementation that is developed | 1 | The Open MPI Project is an open source MPI-2 implementation | |
2 | and maintained by a consortium of academic, research, and industry partners. | 2 | that is developed and maintained by a consortium of academic, | |
3 | Open MPI is therefore able to combine the expertise, technologies, and resources | 3 | research, and industry partners. Open MPI is therefore able to | |
4 | from all across the High Performance Computing community in order to build the | 4 | combine the expertise, technologies, and resources from all | |
5 | best MPI library available. Open MPI offers advantages for system and software | 5 | across the High Performance Computing community in order to | |
6 | vendors, application developers and computer science researchers. Features | 6 | build the best MPI library available. Open MPI offers advantages | |
7 | implemented or in short-term development for Open MPI include: | 7 | for system and software vendors, application developers and | |
8 | computer science researchers. | |||
9 | ||||
10 | Features implemented or in short-term development for Open MPI | |||
11 | include: | |||
8 | 12 | |||
9 | - Full MPI-2 standards conformance | 13 | - Full MPI-2 standards conformance | |
10 | - Thread safety and concurrency | 14 | - Thread safety and concurrency | |
11 | - Dynamic process spawning | 15 | - Dynamic process spawning | |
12 | - Network and process fault tolerance | 16 | - Network and process fault tolerance | |
13 | - Support network heterogeneity | 17 | - Support network heterogeneity | |
14 | - Single library supports all networks | 18 | - Single library supports all networks | |
15 | - Run-time instrumentation | 19 | - Run-time instrumentation | |
16 | - Many job schedulers supported | 20 | - Many job schedulers supported | |
17 | - Many OS's supported (32 and 64 bit) | 21 | - Many OS's supported (32 and 64 bit) | |
18 | - Production quality software | 22 | - Production quality software | |
19 | - High performance on all platforms | 23 | - High performance on all platforms | |
20 | - Portable and maintainable | 24 | - Portable and maintainable |
@@ -1,24 +1,31 @@ | @@ -1,24 +1,31 @@ | |||
1 | The biblatex package is a complete reimplementation of the bibliographic | 1 | The biblatex package is a complete reimplementation of the | |
2 | facilities provided by LaTeX in conjunction with BibTeX. It redesigns the way in | 2 | bibliographic facilities provided by LaTeX in conjunction with | |
3 | which LaTeX interacts with BibTeX at a fairly fundamental level. With biblatex, | 3 | BibTeX. It redesigns the way in which LaTeX interacts with | |
4 | BibTeX is only used (if it is used at all) to sort the bibliography and to | 4 | BibTeX at a fairly fundamental level. With biblatex, BibTeX is | |
5 | generate labels. Instead of being implemented in BibTeX's style files, the | 5 | only used (if it is used at all) to sort the bibliography and | |
6 | formatting of the bibliography is entirely controlled by TeX macros. Good | 6 | to generate labels. Instead of being implemented in BibTeX's | |
7 | working knowledge in LaTeX should be sufficient to design new bibliography and | 7 | style files, the formatting of the bibliography is entirely | |
8 | citation styles - there is no need to learn BibTeX's postfix stack language. | 8 | controlled by TeX macros. Good working knowledge in LaTeX | |
9 | Just like the bibliography styles, all citation commands may be freely | 9 | should be sufficient to design new bibliography and citation | |
10 | (re)defined. In fact, users need not remain bound to BibTeX for use with | 10 | styles -- there is no need to learn BibTeX's postfix stack | |
11 | biblatex: an alternative bibliography processor biblatex-biber is available. | 11 | language. Just like the bibliography styles, all citation | |
12 | Development of biblatex and biblatex-biber is closely coupled; the present | 12 | commands may be freely (re)defined. In fact, users need not | |
13 | release of biblatex is designed to work with biblatex-biber version 0.9.3. The | 13 | remain bound to BibTeX for use with biblatex: an alternative | |
14 | package needs e-TeX, and uses the author's etoolbox and logreq packages. For | 14 | bibliography processor biblatex-biber is available. Development | |
15 | users of biblatex-biber, version 0.9 is required (at least; refer to the notes | 15 | of biblatex and biblatex-biber is closely coupled; the present | |
16 | for the version of biblatex-biber that you are using). Apart from the features | 16 | release of biblatex is designed to work with biblatex-biber | |
17 | unique to biblatex, the package also incorporates core features of the following | 17 | version 0.9.3. The package needs e-TeX, and uses the author's | |
18 | packages: babelbib, bibtopic, bibunits, chapterbib, cite, inlinebib, mcite and | 18 | etoolbox and logreq packages. For users of biblatex-biber, | |
19 | mciteplus, mlbib, multibib, splitbib. There are also some conceptual parallels | 19 | version 0.9 is required (at least; refer to the notes for the | |
20 | to the natbib and amsrefs packages. The biblatex package supports split | 20 | version of biblatex-biber that you are using). Apart from the | |
21 | bibliographies, multiple bibliographies within one document, and separate lists | 21 | features unique to biblatex, the package also incorporates core | |
22 | of bibliographic shorthands. Bibliographies may be subdivided into parts (by | 22 | features of the following packages: babelbib, bibtopic, | |
23 | chapter, by section, etc.) and/or segmented by topics (by type, by keyword, | 23 | bibunits, chapterbib, cite, inlinebib, mcite and mciteplus, | |
24 | etc.). The package is fully localized and can interface with the babel package. | 24 | mlbib, multibib, splitbib. There are also some conceptual | |
25 | parallels to the natbib and amsrefs packages. The biblatex | |||
26 | package supports split bibliographies, multiple bibliographies | |||
27 | within one document, and separate lists of bibliographic | |||
28 | shorthands. Bibliographies may be subdivided into parts (by | |||
29 | chapter, by section, etc.) and/or segmented by topics (by type, | |||
30 | by keyword, etc.). The package is fully localized and can | |||
31 | interface with the babel package. |