{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T13:40:20Z","timestamp":1776865220785,"version":"3.51.2"},"reference-count":26,"publisher":"American Mathematical Society (AMS)","issue":"298","license":[{"start":{"date-parts":[[2016,6,24]],"date-time":"2016-06-24T00:00:00Z","timestamp":1466726400000},"content-version":"am","delay-in-days":366,"URL":"https:\/\/www.ams.org\/publications\/copyright-and-permissions"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Comp."],"abstract":"<p>Condition numbers of random polynomial systems have been widely studied in the literature under certain coefficient ensembles of invariant type. In this note we introduce a method that allows us to study these numbers for a broad family of probability distributions. Our work also extends to certain perturbed systems.<\/p>","DOI":"10.1090\/mcom\/2993","type":"journal-article","created":{"date-parts":[[2015,6,24]],"date-time":"2015-06-24T13:29:46Z","timestamp":1435152586000},"page":"737-757","source":"Crossref","is-referenced-by-count":4,"title":["On a condition number of general random polynomial systems"],"prefix":"10.1090","volume":"85","author":[{"given":"Hoi","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"14","published-online":{"date-parts":[[2015,6,24]]},"reference":[{"key":"1","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0701-6","volume-title":"Complexity and real computation","author":"Blum, Lenore","year":"1998","ISBN":"https:\/\/id.crossref.org\/isbn\/0387982817"},{"key":"2","series-title":"Grundlehren der mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38896-5","volume-title":"Condition","volume":"349","author":"B\u00fcrgisser, Peter","year":"2013","ISBN":"https:\/\/id.crossref.org\/isbn\/9783642388958"},{"issue":"5-6","key":"3","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1016\/j.jco.2008.03.001","article-title":"A numerical algorithm for zero counting. I. Complexity and accuracy","volume":"24","author":"Cucker, Felipe","year":"2008","journal-title":"J. Complexity","ISSN":"https:\/\/id.crossref.org\/issn\/0885-064X","issn-type":"print"},{"issue":"2","key":"4","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s11784-009-0127-4","article-title":"A numerical algorithm for zero counting. II. Distance to ill-posedness and smoothed analysis","volume":"6","author":"Cucker, Felipe","year":"2009","journal-title":"J. Fixed Point Theory Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/1661-7738","issn-type":"print"},{"issue":"1","key":"5","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.aam.2011.07.001","article-title":"A numerical algorithm for zero counting. III: Randomization and condition","volume":"48","author":"Cucker, Felipe","year":"2012","journal-title":"Adv. in Appl. Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0196-8858","issn-type":"print"},{"issue":"4","key":"6","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1137\/0609045","article-title":"Eigenvalues and condition numbers of random matrices","volume":"9","author":"Edelman, Alan","year":"1988","journal-title":"SIAM J. Matrix Anal. Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/0895-4798","issn-type":"print"},{"key":"7","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1090\/S0002-9904-1947-08909-6","article-title":"Numerical inverting of matrices of high order","volume":"53","author":"von Neumann, John","year":"1947","journal-title":"Bull. Amer. Math. Soc.","ISSN":"https:\/\/id.crossref.org\/issn\/0002-9904","issn-type":"print"},{"issue":"1","key":"8","doi-asserted-by":"publisher","first-page":"223","DOI":"10.2307\/2152887","article-title":"On the probability that a random \u00b11-matrix is singular","volume":"8","author":"Kahn, Jeff","year":"1995","journal-title":"J. Amer. Math. Soc.","ISSN":"https:\/\/id.crossref.org\/issn\/0894-0347","issn-type":"print"},{"key":"9","unstructured":"E. Kostlan, Random polynomials and the statistical fundamental theorem of algebra, unpublished (1987)."},{"key":"10","series-title":"Lecture Notes in Mathematics","isbn-type":"print","volume-title":"Asymptotic theory of finite-dimensional normed spaces","volume":"1200","author":"Milman, Vitali D.","year":"1986","ISBN":"https:\/\/id.crossref.org\/isbn\/3540167692"},{"key":"11","isbn-type":"print","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-642-39286-3_16","article-title":"Small ball probability, inverse theorems, and applications","author":"Nguyen, Hoi H.","year":"2013","ISBN":"https:\/\/id.crossref.org\/isbn\/9789639453180"},{"key":"12","unstructured":"H. Nguyen, O. Nguyen and V. Vu, On the number of real roots of random polynomials, submitted."},{"issue":"2","key":"13","doi-asserted-by":"publisher","first-page":"575","DOI":"10.4007\/annals.2008.168.575","article-title":"Invertibility of random matrices: norm of the inverse","volume":"168","author":"Rudelson, Mark","year":"2008","journal-title":"Ann. of Math. (2)","ISSN":"https:\/\/id.crossref.org\/issn\/0003-486X","issn-type":"print"},{"issue":"2","key":"14","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1016\/j.aim.2008.01.010","article-title":"The Littlewood-Offord problem and invertibility of random matrices","volume":"218","author":"Rudelson, Mark","year":"2008","journal-title":"Adv. Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0001-8708","issn-type":"print"},{"issue":"12","key":"15","doi-asserted-by":"publisher","first-page":"1707","DOI":"10.1002\/cpa.20294","article-title":"Smallest singular value of a random rectangular matrix","volume":"62","author":"Rudelson, Mark","year":"2009","journal-title":"Comm. Pure Appl. Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0010-3640","issn-type":"print"},{"issue":"2","key":"16","doi-asserted-by":"publisher","first-page":"459","DOI":"10.2307\/2152805","article-title":"Complexity of B\u00e9zout\u2019s theorem. I. Geometric aspects","volume":"6","author":"Shub, Michael","year":"1993","journal-title":"J. Amer. Math. Soc.","ISSN":"https:\/\/id.crossref.org\/issn\/0894-0347","issn-type":"print"},{"key":"17","isbn-type":"print","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-1-4612-2752-6_19","article-title":"Complexity of Bezout\u2019s theorem. II. Volumes and probabilities","author":"Shub, M.","year":"1993","ISBN":"https:\/\/id.crossref.org\/isbn\/0817636781"},{"issue":"1","key":"18","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1006\/jcom.1993.1002","article-title":"Complexity of Bezout\u2019s theorem. III. Condition number and packing","volume":"9","author":"Shub, Michael","year":"1993","journal-title":"J. Complexity","ISSN":"https:\/\/id.crossref.org\/issn\/0885-064X","issn-type":"print"},{"issue":"1","key":"19","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0304-3975(94)90122-8","article-title":"Complexity of Bezout\u2019s theorem. V. Polynomial time","volume":"133","author":"Shub, M.","year":"1994","journal-title":"Theoret. Comput. Sci.","ISSN":"https:\/\/id.crossref.org\/issn\/0304-3975","issn-type":"print"},{"issue":"1","key":"20","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1137\/0733008","article-title":"Complexity of Bezout\u2019s theorem. IV. Probability of success; extensions","volume":"33","author":"Shub, Michael","year":"1996","journal-title":"SIAM J. Numer. Anal.","ISSN":"https:\/\/id.crossref.org\/issn\/0036-1429","issn-type":"print"},{"key":"21","isbn-type":"print","first-page":"597","article-title":"Smoothed analysis of algorithms","author":"Spielman, Daniel A.","year":"2002","ISBN":"https:\/\/id.crossref.org\/isbn\/7040086905"},{"issue":"3","key":"22","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1145\/990308.990310","article-title":"Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time","volume":"51","author":"Spielman, Daniel A.","year":"2004","journal-title":"J. ACM","ISSN":"https:\/\/id.crossref.org\/issn\/0004-5411","issn-type":"print"},{"issue":"2","key":"23","doi-asserted-by":"publisher","first-page":"595","DOI":"10.4007\/annals.2009.169.595","article-title":"Inverse Littlewood-Offord theorems and the condition number of random discrete matrices","volume":"169","author":"Tao, Terence","year":"2009","journal-title":"Ann. of Math. (2)","ISSN":"https:\/\/id.crossref.org\/issn\/0003-486X","issn-type":"print"},{"issue":"272","key":"24","doi-asserted-by":"publisher","first-page":"2333","DOI":"10.1090\/S0025-5718-2010-02396-8","article-title":"Smooth analysis of the condition number and the least singular value","volume":"79","author":"Tao, Terence","year":"2010","journal-title":"Math. Comp.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5718","issn-type":"print"},{"issue":"1","key":"25","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/s00039-010-0057-8","article-title":"Random matrices: the distribution of the smallest singular values","volume":"20","author":"Tao, Terence","year":"2010","journal-title":"Geom. Funct. Anal.","ISSN":"https:\/\/id.crossref.org\/issn\/1016-443X","issn-type":"print"},{"issue":"1","key":"26","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.jco.2003.09.003","article-title":"Smoothed analysis of \ud835\udf05(\ud835\udc34)","volume":"20","author":"Wschebor, Mario","year":"2004","journal-title":"J. Complexity","ISSN":"https:\/\/id.crossref.org\/issn\/0885-064X","issn-type":"print"}],"container-title":["Mathematics of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.ams.org\/mcom\/2016-85-298\/S0025-5718-2015-02993-7\/S0025-5718-2015-02993-7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/www.ams.org\/mcom\/2016-85-298\/S0025-5718-2015-02993-7\/S0025-5718-2015-02993-7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T18:42:03Z","timestamp":1776796923000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ams.org\/mcom\/2016-85-298\/S0025-5718-2015-02993-7\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,24]]},"references-count":26,"journal-issue":{"issue":"298","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["S0025-5718-2015-02993-7"],"URL":"https:\/\/doi.org\/10.1090\/mcom\/2993","archive":["CLOCKSS","Portico"],"relation":{},"ISSN":["1088-6842","0025-5718"],"issn-type":[{"value":"1088-6842","type":"electronic"},{"value":"0025-5718","type":"print"}],"subject":[],"published":{"date-parts":[[2015,6,24]]}}}