Computing monodromy via continuation methods on random Riemann surfaces

An efficient computational method for ch

An efficient computational method for characterizing the effects of random surface errors on the average power pattern of reflectors

✍ Rahmat-Samii, Y. 📂 Article 📅 1983 🏛 IEEE 🌐 English ⚖ 508 KB

Erratum to “NIMROD: A program for infere

Erratum to “NIMROD: A program for inference via normal approximation of the posterior in models with random effects based on ordinary differential equations” [Comput. Methods Programs Biomed. 111 (2) (2013) 447-458]

✍ Prague, Mélanie; Commenges, Daniel; Guedj, Jérémie; Drylewicz, Julia; Thiébaut, 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 211 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