## Abstract

To introduce the subject, we consider a few examples of nonlinear equations: is an algebraic equation; there is only one unknown, but it occurs in the third power. There are three solutions, of which two are conjugate complex.is a transcendental equation. Again, only one unknown is present, but now in a transcendental function. There are denumerably many solutions.is a transcendental equation only in an unessential way, since it can be transformed at once into a quadratic equation for e is a system of two nonlinear algebraic equations in two unknowns

$${x^3} + x + 1 = 0$$

$$2x - \tan x = 0$$

$$\sin x + 3 \cos x = 2$$

^{ix}. While there are infinitely many solutions, they can all be derived from two solutions through addition of multiples of 2π.$${x^3} + {y^2} + 5 = 0$$

$$2x + {y^3} + 5y = 0$$

*x*and*y*. It can be reduced to*one*algebraic equation of degree 9 in only*one*unknown. This latter equation has nine solutions which generate nine pairs of numbers (*x*_{ i },*y*_{ i }), i = 1,…, 9, satisfying the given system. (There are fewer if only real*x,y*are admitted.)## Keywords

Algebraic Equation Nonlinear Equation Reconstruction Error Transcendental Equation Nonlinear Algebraic Equation
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

## Preview

Unable to display preview. Download preview PDF.

## References

- Alefeld, G. and Herzberger, J. [1983]:
*Introduction to Interval Computations*, Academic Press, New York.MATHGoogle Scholar - Brent, R.P. [1973]:
*Algorithms for Minimization Without Derivatives*, Prentice-Hall, Englewood Cliffs, N.J. 100.MATHGoogle Scholar - Dekker, T.J. [1969]: Finding a zero by means of successive linear interpolation, in
*Constructive Aspects of the Fundamental Theorem of Algebra*(B. Dejon and P. Henrici, eds.), pp. 37–28. Wiley-Interscience, London.Google Scholar - Dennis, J.E., Jr. and Schnabel, R.B. [1983]:
*Numerical Methods for Unconstrained Optim-ization and Nonlinear Equations*, Prentice-Hall, Englewood Cliffs, N. J.Google Scholar - Fletcher, R. [1987]:
*Practical Methods of Optimization*, 2nd ed., Wiley, Chichester.MATHGoogle Scholar - Forsythe, G.E., Malcolm, M.A. and Moler. C.B. [1977]:
*Computer Methods for Mathematical Computations*, Prentice-Hall, Englewood Cliffs, N.J.MATHGoogle Scholar - Fröberg, C.-E. [1985]:
*Numerical Mathematics. Theory and Computer Applications*, Benjamin/Cummings, Menlo Park, California.MATHGoogle Scholar - Gautschi, W. [1984]: Questions of numerical condition related to polynomials, in
*Studies in Numerical Analysis*(G.H. Golub, ed.), pp. 140–177, Studies in Mathematics**24**, The Mathematical Association of America.Google Scholar - Gill, P.E., Murray, W. and Wright, M.H. [1981]:
*Practical Optimization*,Academic Press, London.MATHGoogle Scholar - Goldstine, H.H. [1977]:
*A History of Numerical Analysis from the 16th Through the 19th Century*, Studies in the History of Mathematics and Physical Sciences**2**, Springer, New York.Google Scholar - IMSL [1987]:
*Math/Library User’s Manual*, Houston.Google Scholar - Jenkins, M.A. and Traub, J.F. [1970]: A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration,
*Numer. Math.***14**, 252–263.MathSciNetMATHCrossRefGoogle Scholar - Kahaner, D., Moler, C. and Nash, S. [1989]:
*Numerical Methods and Software*, Prentice- Hall, Englewood Cliffs, N.J.MATHGoogle Scholar - Kantorovich, L. and Akilov, G.P. [1964]:
*Functional Analysis inNormed Spaces*, International Series of Monographs in Pure and Applied Mathematics**46**, Macmillan, New York.Google Scholar - Maas, C. [1985]: Was ist das Falsche an der Regula Falsi? Mitt. Math. Ges. Hamburg 11, H. 3, 311–317.MathSciNetMATHGoogle Scholar
- Moré, J.J., Garbow, B.S. and Hillstrom, K.E. [1980]:
*User Guide for MINPACK-1*, Argonne National Laboratory, Report ANL-80-74.Google Scholar - Moser, J. [1961]: A new technique for the construction of solutions of nonlinear differential equations,
*Proc. Nat. Acad. Sei. USA.***47**, 1824–1831.MATHCrossRefGoogle Scholar - Muller, D.E. [1956]: A method for solving algebraic equations using an automatic computer,
*Math. Tables Aids Comput*.**10**, 208–215.MathSciNetMATHCrossRefGoogle Scholar - Ortega, J.M. and Rheinboldt, W.C. [1970]:
*Iterative Solution of Nonlinear Equations in Several Variables*Academic Press, New York.Google Scholar - Ostrowski, A.M. [1973]:
*Solution of Equations in Euclidean and Banach Spaces*,Pure and Applied Mathematics**9**, Academic Press, New York.Google Scholar - Peters, G. and Wilkinson, J.H. [1971]: Practical problems arising in the solution of polynomial equations,
*J. Inst. Math. Appl*.**8**, 16–35.MathSciNetMATHCrossRefGoogle Scholar - Potra, F.A. [1989]: On q-order and r-order of convergence,
*J. Optim. Theory Appl*.**63**, no. 3.Google Scholar - Potra, F.A. and Ptak, V. [1984]:
*Nondiscrete Induction and Iterative Processes*, Pitman, Boston.MATHGoogle Scholar - Powell, MJ.D. [1970]: A hybrid method for nonlinear equations, in
*Numerical Methods for Nonlinear Algebraic Equations*(P. Rabinowitz, ed.), pp. 87–114. Gordon and Breach, London.Google Scholar - Schmidt, J.W. [1963]: Eine Übertragung der Regula Falsi auf Gleichungen in Banachräumen I, II, Z.
*Angew. Math. Mech*.**43**, 1–8, 97–110.CrossRefGoogle Scholar - Stoer, J. and Bulirsch, R. [1980]:
*Introduction to Numerical Analysis*, Springer, New York.Google Scholar - Watson, L.T., Billups, S.C. and Morgan, A.P. [1987]: Algorithm 652 - HOMPACK: A suite of codes for globally convergent homotopy algorithms,
*ACM Trans. Math. Software***13**, 281–310.MathSciNetMATHCrossRefGoogle Scholar - Wilkinson, J.H. [1963]:
*Rounding Errors in Algebraic Processes*, Prentice-Hall, Engle- wood Cliffs, N. J.MATHGoogle Scholar - Wilkinson, J.H. [1984]: The perfidious polynomial, in
*Studies in Numerical Analysis*(G.H. Golub, ed.), pp. 1–28, Studies in Mathematics**24**, The Mathematical Association of America.Google Scholar

## Copyright information

© Birkhäuser Boston 1990