p_SPARSE is an extremely reliable and efficient Iterative Solver Toolkit for solving large linear systems having a sparse, block, unstructured, symmetric, positive definite coefficient matrix A and a Right Hand Side vector b.
Such matrices will normally originate from hierarchical p-versions of the finite element method applied to 3-D computational mechanics problems. When using p-SPARSE, the serial arithmetic complexity for solving a linear system grows linearly with p, even when solving linear systems having highly ill-conditioned coefficient matrices. Moreover, p_SPARSE's memory requirements, measured in terms of the size-equivalent number of floating point words required to store the coefficient matrix, will remain almost constant as p grows.
Russell Sabora
President
Elegant Mathematics, Inc.
12142 NE 166th Place
Bothell, WA 98011
USA
206-488-2061
206-488-7395 (fax)
solvers@elegant-math.com
For applications in related solution areas, see the following indices: Algebraic Computation, Industrial R&D, Mathematics, Numerical Analysis, Operations Research, Science and Mathematics, the developer index for Elegant Mathematics, Inc. and the market segment index for Math, Physics, Other Sciences.
