| Index | index by Group | index by Distribution | index by Vendor | index by creation date | index by Name | Mirrors | Help |
The search service can find package by either name (apache), provides(webserver), absolute file names (/usr/bin/apache), binaries (gprof) or shared libraries (libXm.so.2) in standard path. It does not support multiple arguments yet...
The System and Arch are optional added filters, for example System could be "redhat", "redhat-7.2", "mandrake" or "gnome", Arch could be "i386" or "src", etc. depending on your system.
The CCOLAMD column approximate minimum degree ordering algorithm computes a permutation vector P such that the LU factorization of A (:,P) tends to be sparser than that of A. The Cholesky factorization of (A (:,P))'*(A (:,P)) will also tend to be sparser than that of A'*A.
| Package | Summary | Distribution | Download |
| libccolamd4-5.13.0-2.mga9.armv7hl.html | Routines for computing column approximate minimum degree ordering | Mageia Cauldron for armv7hl | libccolamd4-5.13.0-2.mga9.armv7hl.rpm |
| libccolamd4-5.13.0-2.mga9.armv7hl.html | Routines for computing column approximate minimum degree ordering | Mageia 9 for armv7hl | libccolamd4-5.13.0-2.mga9.armv7hl.rpm |
| libccolamd4-5.13.0-2.mga9.i586.html | Routines for computing column approximate minimum degree ordering | Mageia 9 for i586 | libccolamd4-5.13.0-2.mga9.i586.rpm |
| libccolamd4-5.13.0-2.mga9.i586.html | Routines for computing column approximate minimum degree ordering | Mageia Cauldron for i686 | libccolamd4-5.13.0-2.mga9.i586.rpm |
Generated by rpm2html 1.6