Interactive Stepwise Discriminant Analysis in Matlab

2000 Mathematics Subject Classification: 62-04, 62H30, 62J20

Comparing Several Methods of Discriminant Analysis on the Case of Wine Data

2000 Mathematics Subject Classification: 62H30, 62J20, 62P12, 68T99

FLQ, the Fastest Quadratic Complexity Bound on the Values of Positive Roots of Polynomials

In this paper we present F LQ, a quadratic complexity bound on the values of the positive roots of polynomials. This bound is an extension of FirstLambda, the corresponding linear complexity bound and, consequently, it is derived from Theorem 3 below. We have implemented FLQ in the Vincent-Akritas-Strzeboński Continued Fractions method (VAS-CF) for the isolation of real roots of polynomials and compared its behavior with that of the theoretically proven best bound, LM Q. Experimental results indicate that whereas F LQ runs on average faster (or quite faster) than LM Q, nonetheless the quality of the bounds computed by both is about the same; moreover, it was revealed that when VAS-CF is run on our benchmark polynomials using F LQ, LM Q and min(F LQ, LM Q) all three versions run equally well and, hence, it is inconclusive which one should be used in the VAS-CF method.

Existence and Asymptotic Stability of Solutions of a Perturbed Quadratic Fractional Integral Equation

Mathematics Subject Classification: 45G10, 45M99, 47H09

A Linear Time Algorithm for Computing Longest Paths in Cactus Graphs

ACM Computing Classification System (1998): G.2.2.