Lybniz is an easy to use mathematical function graph plotter
using pyGTK.
KmPlot is a program to draw graphs, their integrals or derivatives. It
supports different systems of coordinates like the cartesian or the
polar coordinate system. The graphs can be colorized and the view is
scalable, so that you are able to zoom to the level you need.
Features:
- Powerful mathematical parser.
- Precise metric printing.
- Different plot types: cartesian, parametric, polar, implicit,
differential.
- Highly configurable visual settings (plot line, axes, grid).
- Export to bitmap format (BMP and PNG) and scalable vector graphics
(SVG).
- Save/load complete session in readable XML format.
- Trace mode: cross hair following plot, coordinates shown in the
status bar.
- Supports zooming.
- Ability to draw the 1st and 2nd derivative and the integral of a
plot function.
- Supports user defined constants and parameter values.
- Various tools for plot functions:
- Find minimum/maximum point.
- Get y-value and draw the area between the function and the y-axis.
LTL is a C++ class template library for scientific computing which provides
high performance via SSE3 floating point support for vector operations.
Useful for array processing, image processing, FITS and ASCII I/O, and linear
algebra (astronomical and scientific computing, in short). LTL provides
dynamic arrays of up to 5-dimensions, subarrays and slicing, support for fixed
size vectors and matrices including basic linear algebra operations, expression
templates based evaluation, and I/O facilities for ascii and FITS format files.
Users of the boost and blitz++ library may find the cross-pollination of these
unique features to be fruitful.
KKTDirect implements an ordering method and accompanying factorization for
the direct solution of saddle-point matrices (also known as KKT or equilibrium
matrices). A simple constraint on ordering together with an assumption on
the rank of parts of the matrix are sufficient to guarantee the existence of
the LDL^T factorization, stability concerns aside. In fact, D may be taken
to be a diagonal matrix with +/-1 along the diagonal, and be fully determined
prior to factorization, giving rise to a "signed Cholesky" factorization. A
modified minimum-degree-like algorithm which incorporates this constraint is
used, along with a simple algorithm to modify an existing fill-reducing
ordering to respect the constraint. While a stability analysis is lacking,
numerical experiments indicate that this is generally sufficient to avoid the
need for numerical pivoting during factorization, with clear possible benefits
for performance.
Note this is only alpha-quality proof-of-concept code: for example,
out-of-memory errors are not handled gracefully, and the provided Minimum
Degree routine is not yet competitive with other packages.
Estimation and inference methods for models of conditional quantiles:
Linear and nonlinear parametric and non-parametric (total variation
penalized) models for conditional quantiles of a univariate response
and several methods for handling censored survival data. Portfolio
selection methods based on expected shortfall risk are also included.
Lambda is a lambda calculus interpreter. It also will convert lambda expression
into the combinators S, K, and I.
Current features:
* Load predefined lambda expression
* Many definitions provided: numbers Y fact map iszero list 1st 2nd 3rd
ADD MUL EXP list suc pred . . .
* Automatic number definitions.
* Interpret lambda expressions.
* Single step interpretation.
* Normal or application order reductions.
* Variable extraction (Conversion to S K I)
* List definitions.
* Some lambda calculus theory.
METIS is a software package for partitioning unstructured graphs,
partitioning meshes, and computing fill-reducing orderings of sparse
matrices.
Important note: this is not the original METIS, it has been specially
patched by EDF to be used by Code_Aster.
LAPACK++ (Linear Algebra PACKage in C++) is a software library for numerical
linear algebra that solves systems of linear equations and eigenvalue
problems on high performance computer architectures.
Computational support is provided for supports various matrix classes for
vectors, non-symmetric matrices, SPD matrices, symmetric matrices, banded,
triangular, and tridiagonal matrices; however, it does not include all
of the capabilities of original f77 LAPACK. Emphasis is given to routines
for solving linear systems consisting of non-symmetric matrices,
symmetric positive definite systems, and solving linear least-square systems.
LAPACK is a library of Fortran 77 subroutines for solving
the most commonly occurring problems in numerical linear algebra.
It is freely-available software, and is copyrighted.
We recommend that you run the testing and timing programs.
To view an HTML version of the Users' Guide please refer to the URL:
http://www.netlib.org/lapack/lug/
LAPACK95 is a Fortran 95 interface to the Fortran 77 LAPACK library.
It improves upon the original user-interface to the LAPACK package,
taking advantage of the considerable simplifications which
Fortran 95 allows. The design of LAPACK95 exploits assumed-shape arrays,
optional arguments, and generic interfaces. The Fortran 95 interface
has been implemented by writing Fortran 95 ``wrappers'' to call
existing routines from the LAPACK package. This interface can persist
unchanged even if the underlying Fortran 77 LAPACK code is rewritten to
take advantage of the new features of Fortran 95.