Re: classifying degenerate critical points

From: Monkey Saddle (monkey_saddle_at_yahoo.com)
Date: 08/28/04 

Date: 28 Aug 2004 15:15:02 -0700

lrudolph@panix.com (Lee Rudolph) wrote in message news:<cgqdnu$gv9$1@panix2.panix.com>...
> I suspect this is much harder than you think it is. (I mean,
> I know it's very hard, and I suspect you don't think that--yet.)
[snip]
> Now, if you restrict your attention to *real analytic*, or further
> to *real polynomial*, functions, then you may be able to get
> somewhere.

Thanks for your reply, Lee. Indeed, I am only concerned with real
polynomials of finite degree. In light of this, do you think it would
still be worthwhile to track down the details of finitely determined
singularities/germs? I presume the fact that I'm working with real
polynomials does *not* suddenly simplify classification of degenerate
critical points to some simple procedure (i.e. it's probably still
"much harder than [I] think it is")?

Thanks again,
Monkey

Relevant Pages

  • Re: JSH: Somewhat puzzled
    ... > factoring polynomials, ... Tsk, tsk... ... If this technobabble of yours is 'a kick in the ego', ...
    (sci.math)
  • Re: Exchange algorithm (Remez or Parks-McClellan)
    ... the maximum absolute difference from the continuous solution ... will be small for polynomials. ... I suspect it is faster ...
    (sci.math.num-analysis)
  • Re: infinite product
    ... I hadn't looked at that MathWorld entry before. ... the polynomials of -is, as you might suppose, no accident. ...
    (sci.math)
  • Re: Need help with Newtons integral
    ... if you decided to take equidistant nodes for a formula of order 6 ... (exact for polynomials of degree 4, ... but then the quadrature weights should not be obtained from a linear ...
    (sci.math.num-analysis)
  • Re: P=NP
    ... always to 0 is the polynomial "0" (I am considering polynomials with ... trivial algorithm that you are trying to understand. ... and the bibliographic details you gave in your original post don't ...
    (comp.programming)