ICFS

 The NEOS Server offers ICFS for the solution of large-scale trust region subproblems and positive definite systems of linear equations. It provides a useful preconditioner for the conjugate gradient method, an iterative procedure for solving linear system.

ICFS was developed by Chih-Jen Lin and Jorge Moré For additional information on this approach, see Incomplete Cholesky factorizations with limited memory, Preprint ANL/MCS-P682-0897, August 1997, to appear in the SIAM Journal on Scientific Computing. Postscript version.

Using the NEOS Server for ICFS

The user needs to provide a data file in matrix market file format which include the left hand side of the matrix.

Interfaces to ICFS

You can submit ICFS jobs by any of the following interfaces:

Or just try sending an sample job:


[Testneos Server]