I have checked the reference documentation to IT++, and I can't find any linear equation solver for very large sparse matrixes.
Basically, what I'm looking for is the Matlab equivalent of the functions such as:
x=bicg(A,b) - BiConjugate Gradients method
x=bicgstab(A,b) - BiConjugate Gradients Stabilized method
x=cgs(A,b) - Conjugate Gradients Squared method
(or other similar functions).
If these are not implemented:
(1) Is there any way IT++ can solve a system such as Ax=b with A very large and sparse (using an appropriate method of course)?
(2) Or are there any plans to implement any functions similar to those listed above in future releases?
If you would like to refer to this comment somewhere else in this project, copy and paste the following link:
I have checked the reference documentation to IT++, and I can't find any linear equation solver for very large sparse matrixes.
Basically, what I'm looking for is the Matlab equivalent of the functions such as:
x=bicg(A,b) - BiConjugate Gradients method
x=bicgstab(A,b) - BiConjugate Gradients Stabilized method
x=cgs(A,b) - Conjugate Gradients Squared method
(or other similar functions).
If these are not implemented:
(1) Is there any way IT++ can solve a system such as Ax=b with A very large and sparse (using an appropriate method of course)?
(2) Or are there any plans to implement any functions similar to those listed above in future releases?