Project Summary
LAPACK provides routines for solving systems of simultaneous linear equations, least-squares solutions of linear systems of equations, eigenvalue problems, and singular value problems. The associated matrix factorizations (LU, Cholesky, QR, SVD, Schur, generalized Schur) are also provided, as are related computations such as reordering of the Schur factorizations and estimating condition numbers. Dense and banded matrices are handled, but not general sparse matrices. In all areas, similar functionality is provided for real and complex matrices, in both single and double precision.
Note: Ohloh's statistics are not accurate. LAPACK has dozens of major contributors, but most do not use any form of source control. Contributions are merged by only a few people, and then only in bursts.
In a Nutshell, LAPACK...
- ...
- ...
-
...
has a well established, mature codebase
maintained by by an unknown number of developers
with increasing Y-O-Y commits -
...
took an estimated 897 years of effort (COCOMO model)
starting with its first commit in May, 2005
ending with its most recent commit over 2 years ago
Activity
30 Day Summary not available |
12 Month Summary not available |
Community
Copyright
©
2013
Black Duck Software, Inc.
and its contributors, Some Rights Reserved. Unless otherwise marked, this work is licensed under a
Creative Commons Attribution 3.0 Unported License
. Ohloh
®
and the Ohloh logo are trademarks of
Black Duck Software, Inc.
in the United States and/or other jurisdictions. All other trademarks are the property of their respective holders.