[ACM Press the 36th international symposium - San Jose, California, USA (2011.06.08-2011.06.11)] Proceedings of the 36th international symposium on Symbolic and algebraic computation - ISSAC '11 - Fast algorithm for change of ordering of zero-dimensional Gröbner bases with sparse multiplication matrices

[ACM Press the 36th international sympos

✍ Faugère, Jean-Charles; Mou, Chenqi 📂 Article 📅 2011 🏛 ACM Press 🌐 English ⚖ 433 KB

Let I ⊂ K[x 1 ,...,x n ] be a 0-dimensional ideal of degree D where K is a field. It is well-known that obtaining efficient algorithms for change of ordering of Gröbner bases of I is crucial in polynomial system solving. Through the algorithm FGLM, this task is classically tackled by linear algebra

[ACM Press the 36th international sympos

[ACM Press the 36th international symposium - San Jose, California, USA (2011.06.08-2011.06.11)] Proceedings of the 36th international symposium on Symbolic and algebraic computation - ISSAC '11 - A simple but exact and efficient algorithm for complex root isolation

✍ Yap, Chee K.; Sagraloff, Michael 📂 Article 📅 2011 🏛 ACM Press ⚖ 488 KB

[ACM Press the 36th international sympos

[ACM Press the 36th international symposium - San Jose, California, USA (2011.06.08-2011.06.11)] Proceedings of the 36th international symposium on Symbolic and algebraic computation - ISSAC '11 - The minimum-rank gram matrix completion via modified fixed point continuation method

✍ Ma, Yue; Zhi, Lihong 📂 Article 📅 2011 🏛 ACM Press ⚖ 479 KB

[ACM Press the 36th international sympos

[ACM Press the 36th international symposium - San Jose, California, USA (2011.06.08-2011.06.11)] Proceedings of the 36th international symposium on Symbolic and algebraic computation - ISSAC '11 - The minimum-rank gram matrix completion via modified fixed point continuation method

✍ Ma, Yue; Zhi, Lihong 📂 Article 📅 2011 🏛 ACM Press 🌐 English ⚖ 479 KB

The problem of computing a representation for a real polynomial as a sum of minimum number of squares of polynomials can be casted as finding a symmetric positive semidefinite real matrix of minimum rank subject to linear equality constraints. In this paper, we propose algorithms for solving the min

[ACM Press the 20th international sympos

[ACM Press the 20th international symposium - San Jose, California, USA (2011.06.08-2011.06.11)] Proceedings of the 20th international symposium on High performance distributed computing - HPDC '11 - Algorithm-based recovery for iterative methods without checkpointing

✍ Chen, Zizhong 📂 Article 📅 2011 🏛 ACM Press ⚖ 779 KB

[ACM Press the 20th international sympos

[ACM Press the 20th international symposium - San Jose, California, USA (2011.06.08-2011.06.11)] Proceedings of the 20th international symposium on High performance distributed computing - HPDC '11 - Algorithm-based recovery for iterative methods without checkpointing

✍ Chen, Zizhong 📂 Article 📅 2011 🏛 ACM Press ⚖ 779 KB

In today's high performance computing practice, fail-stop failures are often tolerated by checkpointing. While checkpointing is a very general technique and can often be applied to a wide range of applications, it often introduces a considerable overhead especially when computations reach petascale