|
|
|
|
|
|
|
|
|
|
|
|
Example: how to use CMA-LS-SPARSE for obtaining solutions of Least Squares problems.
|
|
|
|
|
It must be emphasized that CMA-LS-SPARSE
is a very efficient solver of large-scale least squares problems, up to several millions of equations.
Solely for the purpose to demonstrate how to use this product in pratice, we provide a simple example, together
with the code of main() procedure containing all function calls. Regardless of the size of the problem,
the function calls are always the same.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
The program treats the
example as a general-case (doesn't matter dense or sparse) matrix, i.e.
the program just receives
the matrix non-zero elements and their indexes one-by-one.
|
|
|
CMA-LS-SPARSE is capable of solving
very large (up to several million equations) sparse linear systems with general-case matrices,
including over-determined systems.
|
|
|
|
|
We invite you to consider using CMA-LS-SPARSE for
your research, development and commercial purposes. You are welcome to
contact us at any time, preferably by e-mail. Our full contact details are provided
here .
|
|
|
|
|
CMA-LS-SPARSE is available with
complete source codes and with full commercial lisence allowing easy
incorporation into your own applications.
CMA-LS-SPARSE codes are written in standard C and will compile and run on all UNIX
and Windows platforms without changes. They are also fully commented,
allowing easy modification at user's discretion.
CMA-LS-SPARSE is available on no-royalties and
no-annual-renewals basis: there is a one-off price for an
unlimited commercial lisence.
The product distribution kit includes:
- fully-commented source codes in C;
- and the product's User Instructions containing decriptions of the functions and examples.
To learn more about the full range of our products please follow this
link.
We also invite you to contact us with any questions, preferably by e-mail
on comecau@ozemail.com.au
or
comecauinfo@gmail.com.
|
|
|
