scholarly journals W. von Tschirnhaus and algebraic equations with roots in arithmetical progression

1940 ◽  
Vol 6 (3) ◽  
pp. 181-184
Author(s):  
Gino Loria

In an interesting appendix to a letter written by John Collins to James Gregory on August 3, 1675, but not published until a few months ago, appear some formulae, given without proof, for expressing the roots of an equation of any degree from the 2nd to the 9th in terms of the coefficients, under the assumption that these roots are in arithmetical progression. The formulae were discovered by the well known contemporary of Leibniz, Baron W. von Tschirnhaus. It is evident that in the case of an equation of degree n this particular assumption imposes n − 2 conditions on the coefficients; so that two of these coefficients can be chosen ad libitum. Tschirnhaus did not go to the trouble of obtaining these relations explicitly, in fact he makes no mention of them, but he gives expressions, in the cases indicated above, for the roots as functions of the first two coefficients of the equation in question, and these coefficients, as we have observed, are arbitrary. It is not known by what approach he arrived at his formulae; it seems likely to us, however, that he expressed the desired roots in terms of two arbitrary unknowns, that he evaluated the sum of these, and the sum of their products two at a time, and that, finally, he equated the results to the first two coefficients of the equation. In this way two equations are obtained, sufficient to determine the two auxiliary unknowns; and the problem can be considered as solved. Without seeming to imply that this procedure was the same as that adopted by the eminent German mathematician, we shall show that by its means one can not only derive his results, but also solve the question in the case of an algebraic equation of any degree.

2012 ◽  
Vol 12 (04) ◽  
pp. 1250002 ◽  
Author(s):  
NGUYEN DINH CONG ◽  
NGUYEN THI THE

We introduce a concept of Lyapunov exponents and Lyapunov spectrum of a stochastic differential algebraic equation (SDAE) of index-1. The Lyapunov exponents are defined samplewise via the induced two-parameter stochastic flow generated by inherent regular stochastic differential equations. We prove that Lyapunov exponents are nonrandom.


1932 ◽  
Vol 51 ◽  
pp. 80-90 ◽  
Author(s):  
A. C. Aitken

In a former paper on the same subject the writer pointed out that the sequence used by D. Bernoulli for approximating to the greatest root of an algebraic equation could be further utilised in such a way as to give all the roots. It is suggested in the present paper that there is really no need to compute a first Bernoullian sequence at all, but that by the theory of dual symmetric functions the coefficients in the given equation may be used with equal convenience. In a practical respect this simplifies the technique of root-evaluation.


2019 ◽  
Vol 18 (6) ◽  
pp. 1491-1514
Author(s):  
Yuri Bychkov ◽  
Elena Solovyeva ◽  
Sergei Scherbakov

This paper proposes an algorithm for calculating approximate values of  roots of algebraic equations with a specified limit of absolute errors. A mathematical basis of the algorithm is an analytical-numerical method of solving nonlinear integral-differential equations with non-stationary coefficients. The analytical-numerical method belongs to the class of one-step continuous methods of variable order with an adaptive procedure for choosing a calculation step, a formalized estimate of the error of the performed calculations at each step and the error accumulated during the calculation. The proposed algorithm for calculating the approximate values of the roots of an algebraic equation with specified limit absolute errors consists of two stages. The results of the first stage are numerical intervals containing the unknown exact values of the roots of the algebraic equation. At the second stage, the approximate values of these roots with the specified limit absolute errors are calculated. As an example of the use of the proposed algorithm, defining the roots of the fifth-order algebraic equation with three different values of the limiting absolute error is presented. The obtained results allow drawing the following conclusions. The proposed algorithm enables to select numeric intervals that contain unknown exact values of the roots. Knowledge of these intervals facilitates the calculation of the approximate root values under any specified limiting absolute error. The algorithm efficiency, i.e., the guarantee of achieving the goal, does not depend on the choice of initial conditions. The algorithm is not iterative, so the number of calculation steps required for extracting a numerical interval containing an unknown exact value of any root of an algebraic equation is always restricted. The algorithm of determining a certain root of the algebraic equation is computationally completely autonomous.


2014 ◽  
Vol 989-994 ◽  
pp. 4934-4939
Author(s):  
Xiao Guang Ren ◽  
Wen Hao Zhou ◽  
Juan Chen

With the development of the electronic technology, the processors count in a supercomputer reaches million scales. However, the processes scale of a application is limited to several thousands, and the scalability face a bottle neck from several aspects, including I/O, communication, cache access .etc. In this paper, we focus on the communication bottleneck to the scalability of linear algebraic equation solve. We take preconditioned conjugate gradient (PCG) as an example, and analysis the feathers of the communication operations in the process of PCG solver. We find that reduce communication is the most critical issue for the scalability of the parallel iterative method for linear algebraic equation solve. We propose a local residual error optimization scheme to eliminate part of the reduce communication operations in the parallel iterative method, and improve the scalability of the parallel iterative method. Experimental results on the Tianhe-2 supercomputer demonstrate that our optimization scheme can achieve a much signally effect for the scalability of the linear algebraic equation solve.


1966 ◽  
Vol 33 (1) ◽  
pp. 218-219 ◽  
Author(s):  
W. F. Ames ◽  
J. F. Sontowski

The classical perturbation method—the expansion of a solution of an algebraic equation as a power series in a parameter—is extended to an expansion in several parameters. An example concerning the Timoshenko beam equation is used to illustrate the ideas. Advantages of the procedure are discussed in the light of this example.


2017 ◽  
Vol 6 (1) ◽  
pp. 59 ◽  
Author(s):  
Sri Adi Widodo

Problem-solving skills are the basic capabilities of a person in solving a problem and that involve critical thinking, logical, and systematic. To solve a problem one-way necessary measures to solve the problem. Polya is one way to solve a mathematical problem. by developing teaching materials designed using the steps in solving problems Polya expected students could improve its ability to solve problems. In this first year, the goal of this study is to investigate the process of learning the hypothetical development of teaching materials. This study is a research & development. Procedure development research refers to research the development of Thiagarajan, Semmel & Semmel ie 4-D. Model development in the first year is define, design, and development. The collection of data for the assessment of teaching materials algebra equations conducted by the expert by filling the validation sheet. Having examined the materials of algebraic equations in the subject of numerical methods, reviewing the curriculum that is aligned with KKNI, and formulates learning outcomes that formed the conceptual teaching material on the material algebraic equations. From the results of expert assessment team found that the average ratings of teaching materials in general algebraic equation of 4.38 with a very good category. The limited test needs to be done to see effectiveness teaching materials on problem-solving skills in students who are taking courses numerical methods


Author(s):  
Pradeep Kumar Mallick ◽  
N.K. kamila ◽  
S. Patnaik

In this paper, a pair of symmetric block ciphers has been developed for encryption and decryption of text file. The characters in the file are represented by the ASCII codes. A substitution table and a reverse substitution table are formed by using a key. The process of encryption and decryption is carried by using linear algebraic equations. However, the cryptanalysis has been discussed for establishing the strength of the algorithm. Result and analysis exhibits that the current algorithm works well and more secured to break the cipher.


1831 ◽  
Vol 121 ◽  
pp. 349-377 ◽  

The branch of the integral calculus which treats of elliptic transcendents originated in the researches of Fagnani, an Italian geometer of eminence. He discovered that two arcs of the periphery of a given ellipse may be determined in many ways, so that their difference shall be equal to an assignable straight line; and he proved that any arc of the lemniscata, like that of a circle, may be multiplied any number of times, or may be subdivided into any number of equal parts, by finite algebraic equations. These are particular results; and it was the discoveries of Euler that enabled geometers to advance to the investigation of the general properties of the elliptic functions. An integral in finite terms deduced by that geometer from an equation between the differentials of two similar transcendent quantities not separately integrable, led immediately to an algebraic equation between the amplitudes of three elliptic functions, of which one is the sum, or the difference, of the other two. This sort of integrals, therefore, could now be added or subtracted in a manner analogous to circular arcs, or logarithms; the amplitude of the sum, or of the difference, being expressed algebraically by means of the amplitudes of the quantities added or subtracted. What Fagnani had accomplished with respect to the arcs of the lemniscata, which are expressed by a particular elliptic integral, Euler extended to all transcendents of the same class. To multiply a function of this kind, or to subdivide it into equal parts, was reduced to solving an algebraic equation. In general, all the properties of the elliptic transcendents, in which the modulus remains unchanged, are deducible from the discoveries of Euler. Landen enlarged our knowledge of this kind of functions, and made a useful addition to analysis, by showing that the arcs of the hyperbola may be reduced, by a proper transformation, to those of the ellipse. Every part of analysis is indebted to Lagrange, who enriched this particular branch with a general method for changing an elliptic function into another having a different modulus, a process which greatly facilitates the numerical calculation of this class of integrals. An elliptic function lies between an arc of the circle on one hand, and a logarithm on the other, approaching indefinitely to the first when the modulus is diminished to zero, and to the second when the modulus is augmented to unit, its other limit. By repeatedly applying the transformation of Lagrange, we may compute either a scale of decreasing moduli reducing the integral to a circular arc, or a scale of increasing moduli bringing it continually nearer to a logarithm. The approximation is very elegant and simple, and attains the end proposed with great rapidity. The discoveries that have been mentioned occurred in the general cultivation of analysis; but Legendre has bestowed much of his attention and study upon this particular branch of the integral calculus. He distributed the elliptic functions in distinct classes, and reduced them to a regular theory. In a Mémoire sur les Transcendantes Elliptiques, published in 1793, and in his Exercices de Calcul Intégral, which appeared in 1817 he has developed many of their properties entirely new; investigated the easiest methods of approximating to their values; computed numerical tables to facilitate their application; and exemplified their use in some interesting problems of geometry and mechanics. In a publication so late as 1825, the author, returning to the same subject, has rendered his theory still more perfect, and made many additions to it which further researches had suggested. In particular we find a new method of making an elliptic function approach as near as we please to a circular arc, or to a logarithm, by a scale of reduction very different from that of which Lagrange is the author, the only one before known. This step in advance would unavoidably have conducted to a more extensive theory of this kind of integrals, which, nearly about the same time, was being discovered by the researches of other geometers.


1927 ◽  
Vol 46 ◽  
pp. 289-305 ◽  
Author(s):  
A. C. Aitken

The aim of the present paper is to extend Daniel Bernoulli's method of approximating to the numerically greatest root of an algebraic equation. On the basis of the extension here given it now becomes possible to make Bernoulli's method a means of evaluating not merely the greatest root, but all the roots of an equation, whether real, complex, or repeated, by an arithmetical process well adapted to mechanical computation, and without any preliminary determination of the nature or position of the roots. In particular, the evaluation of complex roots is extremely simple, whatever the number of pairs of such roots. There is also a way of deriving from a sequence of approximations to a root successive sequences of ever-increasing rapidity of convergence.


1864 ◽  
Vol 154 ◽  
pp. 733-755 ◽  

1. Mr. Harley has shown that any root of the equation y n — ny +(n—1 x =0 satisfies the differential equation y ‒ (D‒2 n ‒1/ n ) (D‒3 n ‒2/ n ) . . (D‒ n 2 ‒ n + 1/ n )/D(D‒1) . . (D‒ n + 1) e ( n ‒1) θ y =0, . . . (1) in which e θ = x , and D= d / dθ provided that n be a positive integer greater than 2. This result, demonstrated for particular values of , and raised by induction into a general theorem, was subsequently established rigorously by Mr. Cayley by means of Lagrange’s theorem. For the case of n =2, the differential equation was found by Mr. Harley to be y ‒D‒3/2/D e θ y =1/2 e θ ............(2) Solving these differential equations for the particular cases of n =2 and n =3, Mr. Harley arrived at the actual expression of the roots of the given algebraic equation for these cases. That all algebraic equations up to the fifth degree can be reduced to the above trinomial form, is well known.


Sign in / Sign up

Export Citation Format

Share Document