Advanced Search

Question: sparse linear algebra

Question:sparse linear algebra

roman_pearce 1688
April 27 2007
0
Maple needs proper sparse linear algebra. That means a data structure where row or column operations (good luck getting both) can be done in linear time and algorithms such as structured Gaussian elimination or iterative methods run in O(A) time, where A is the number of non-zero elements in the matrix. I am aware of the NAG sparse solvers that work in double precision floating point, however I am interested in: 1) exact coefficients 2) rectangular underdetermined systems 3) software floats with high precision I think Maple should handle rational numbers via a modular method or a numeric method such as this one, and mod p coefficients for hardware sized primes (as in LinearAlgebra:-Modular). It is possible to write Maple code that actually does all of this, but I think in order for it to be good the data structure and basic operations (row operations, dot product) need to be compiled.
Please Wait...