541 search results - page 3 / 109 » Factoring Solution Sets of Polynomial Systems in Parallel |
IPPS
2003
IEEE
13 years 11 months ago
2003
IEEE
The efficient solution of large systems of linear equations represented by sparse matrices appears in many tasks. LU factorization followed by backward and forward substitutions i...
PC
2010
13 years 16 days ago
2010
We study the forward and backward substitution phases of a sparse multifrontal factorization. These phases are often neglected in papers on sparse direct factorization but, in man...
APPML
2006
13 years 5 months ago
2006
For when the Sylvester matrix equation has a unique solution, this work provides a closed form solution, which is expressed as a polynomial of known matrices. In the case of non-u...
IWPEC
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. Inclusion/exclusion branching is a way to branch on requirements imposed on problems, in contrast to the classical branching on parts of the solution. The technique turne...
AMC
2006
13 years 5 months ago
2006
A parallel algorithm based on the multidimensional minimization of the Rayleigh quotient is proposed to evaluate the leftmost eigenpairs of the generalized symmetric positive defi...