Michael Shub - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 24 from 24

2018

Computing the Homology of Real Projective SetsFelipe Cucker, Teresa Krick, Michael Shub. focm, 18(4):929-970, 2018. [doi]

2016

Condition Length and Complexity for the Solution of Polynomial SystemsDiego Armentano, Carlos Beltrán, Peter Bürgisser, Felipe Cucker, Michael Shub. focm, 16(6):1401-1422, 2016. [doi]

2014

Erratum to: Smale's Fundamental Theorem of Algebra ReconsideredDiego Armentano, Michael Shub. focm, 14(4):861, 2014. [doi]

Smale's Fundamental Theorem of Algebra ReconsideredDiego Armentano, Michael Shub. focm, 14(1):85-114, 2014. [doi]

2012

On the Geometry and Topology of the Solution Variety for Polynomial System SolvingCarlos Beltrán, Michael Shub. focm, 12(6):719-763, 2012. [doi]

2010

A Note on the Finite Variance of the Averaging Function for Polynomial System SolvingCarlos BeltrÃ¡n, Michael Shub. focm, 10(1):115-125, 2010. [doi]

2009

Complexity of Bezout s Theorem VII: Distance Estimates in the Condition MetricCarlos Beltrán, Michael Shub. focm, 9(2):179-195, 2009. [doi]

Complexity of Bezout s Theorem VI: Geodesics in the Condition (Number) MetricMichael Shub. focm, 9(2):171-178, 2009. [doi]

2007

Morse-Smale systemsMichael Shub. scholarpedia, 2(3):1785, 2007. [doi]

Smale horseshoeSteve Smale, Michael Shub. scholarpedia, 2(11):3012, 2007. [doi]

2005

ForewordLenore Blum, Felipe Cucker, Tomaso Poggio, James Renegar, Michael Shub. focm, 5(4):349, 2005. [doi]

2003

PrefaceBrenda Dietrich, Michael Shub. ibmrd, 47(1):3-4, 2003. [doi]

Implicit Gamma Theorems (I): Pseudoroots and PseudospectraFrançoise Tisseur, Jean-Pierre Dedieu, Myong-Hi Kim, Michael Shub. focm, 3(1):1-31, 2003. [doi]

1997

Stably Ergodic Dynamical Systems and Partial HyperbolicityCharles Pugh, Michael Shub. jc, 13(1):125-179, 1997. [doi]

Guest Editor s IntroductionMichael Shub. jc, 13(1):2-3, 1997. [doi]

1996

EDITOR S FOREWORDFelipe Cucker, Michael Shub. jc, 12(4):255-256, 1996. [doi]

1994

The implicit function theorem revisitedMichael Shub. ibmrd, 38(3):259-264, 1994.

1993

Complexity of Bezout s Theorem: III. Condition Number and PackingMichael Shub, Steve Smale. jc, 9(1):4-14, 1993. [doi]

1992

Test complexity of generic polynomialsPeter Bürgisser, Thomas Lickteig, Michael Shub. jc, 8(3):203-215, 1992. [doi]

Unified complexity analysis for Newton LP methodsJames Renegar, Michael Shub. mp, 53:1-16, 1992.

1989

Boundary Behavior of Interior Point Algorithms in Linear ProgrammingNimrod Megiddo, Michael Shub. mor, 14(1):97-146, 1989. [doi]

On the distance to the zero set of a homogeneous polynomialMichael Shub. jc, 5(3):303-305, 1989. [doi]

1987

On the asymptotic behavior of the projective rescaling algorithm for linear programmingMichael Shub. jc, 3(3):258-269, 1987. [doi]

1986

On the existence of generally convergent algorithmsMichael Shub, Steve Smale. jc, 2(1):2-11, 1986. [doi]

Sign in or sign up to see more results.

runs on WebDSL