The use of Chebyshev matrix polynomials in the iterative solution of linear equations compared to the method of successive overrelaxtion /

"(This is being submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Mathematics, June 1959.)"

Œuvres de Charles Hermite publiées sous les auspices de l'Académie des sciences,

"Le préface ... est la leçon que j'ai faite à la Sorbonne sur l'œuvre scientifique de Charles Hermite quelques semaines après sa mort."--Avertissement.

Cours de M. Hermite rédigé en 1882

Available on demand as hard copy or computer file from Cornell University Library.

L'hermite en Suisse; ou Observations sur les mœurs et les usages suisses au commencement du XIXe siècle. Faisant suite à la Collection des mœurs françaises, anglaises, italiennes etc.

Attributed to Étienne Jouy.

L'Hermite de Corbeny, ou Le sacre et le couronnement de Charles X, roi de France et de Navarre.

Mode of access: Internet.

L'Hermite de Belleville, ou Choix d'opuscules, politiques, littéraires et satiriques /

Each vol. has also added t.p. of 1833 edition.

L'hermite de la Chaussée-d'Antin, ou, Observations sur les moeurs et les usages parisiens au commencement du XIXe siècle.

Added t.p.: engraved.

The Paris Spectator : or, L'hermite de la Chaussée-d'Antin. Containing observations upon Parisian manners & customs at the commencement of the nineteenth century /

The author's name is given in the translator's introduction (p. viii).

L'hermite de la Chaussée-d'Antin,

Mode of access: Internet.

Solution of the equation of secular variation by a method due to Hermite ...

Thesis (PH.D.)--University of Virginia, 1916.

Correspondance d'Hermite et de Stieltjes.

Mode of access: Internet.

On decomposition of sub-linearised polynomials

We give a detailed exposition of the theory of decompositions of linearised polynomials, using a well-known connection with skew-polynomial rings with zero derivative. It is known that there is a one-to-one correspondence between decompositions of linearised polynomials and sub-linearised polynomials. This correspondence leads to a formula for the number of indecomposable sub-linearised polynomials of given degree over a finite field. We also show how to extend existing factorisation algorithms over skew-polynomial rings to decompose sub-linearised polynomials without asymptotic cost.

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.