×

Solving nonlinear systems with least significant bit accuracy. (English) Zbl 0485.65036


MSC:

65H10 Numerical computation of solutions to systems of equations
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Abbott, J. P., Brent, R. P.: Fast local convergence with single and multistep methods for nonlinear equations. Austr. Math. Soc.19, 173–199 (1975). · Zbl 0359.65044 · doi:10.1017/S0334270000001077
[2] Alefeld, G., Herzberger, J.: Einführung in die Intervallrechnung. Mannheim-Wien-Zürich: Bibl. Inst. 1974. · Zbl 0333.65002
[3] Bohlender, G.: Floating-point computation of functions with maximum accuracy. IEEE Trans. on Computers1977, 621. · Zbl 0405.65021
[4] Böhm, H.: Berechnung von Schranken für Polynomwurzeln mit dem Fixpunktsatz von Brouwer. Interner Bericht des Inst. f. Angew. Math., Universität Karlsruhe, 1980.
[5] Collins, G. E.: Quantifier elimination for real closed fields by cylindrical algebraic decomposition (Lecture Notes in Computer Science, Vol. 33), pp. 134–183. Berlin-Heidelberg-New York: Springer 1975. · Zbl 0318.02051
[6] Gastinel, N.: Lineare numerische Analysis. Braunschweig: F. Vieweg & Sohn 1972. · Zbl 0318.65006
[7] Kaucher, E., Rump, S. M.: Generalized iteration methods for bounds of the solution of fixed-point operator equations. Computing24, 131–137 (1980). · Zbl 0422.65039 · doi:10.1007/BF02281719
[8] Kaucher, E., Rump, S. M.: E-methods for fixed point equations. Computing28, 31–42 (1982). · Zbl 0474.65039 · doi:10.1007/BF02237993
[9] Krawczyk, R.: Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken. Computing4, 187–210 (1969). · Zbl 0187.10001 · doi:10.1007/BF02234767
[10] Köberl, D.: The solution of non-linear equations by the computation of fixed points with a modification of the sandwich method. Computing25, 175–178 (1980). · Zbl 0431.65042 · doi:10.1007/BF02259643
[11] Kulisch, U., Miranker, W.: Computer arithmetic in theory and practice. Academic Press 1981. · Zbl 0487.65026
[12] Martinez, J. M.: Solving nonlinear simultaneous equations with a generalization of Brent’s method.BIT 20, 501–510 (1980). · Zbl 0457.65030 · doi:10.1007/BF01933643
[13] Moore, R. E.: A test for existence of solutions for non-linear systems. SIAM J. Numer. Anal.4 (1977). · Zbl 0365.65034
[14] Moré, J. J., Cosnard, M. Y.: Numerical solution of nonlinear equations. ACM Trans. on Math. Software,5, 64–85 (1979). · Zbl 0393.65019 · doi:10.1145/355815.355820
[15] Rump, S. M.: Kleine Fehlerschranken bei Matrixproblemen. Dr.-Dissertation, Inst. f. Angew. Math., Universität Karlsruhe, Februar 1980. · Zbl 0437.65036
[16] Rump, S. M.: Polynomial minimum root separation. Math. of Comp.33, 327–336 (1979). · Zbl 0405.12018 · doi:10.1090/S0025-5718-1979-0514828-8
[17] Rump, S. M., Kaucher, E.: Small bounds for the solution of systems of linear equations. Computing, Suppl. 2. Wien-New York: Springer 1980. · Zbl 0419.65023
[18] Varga, R. S.: Matrix iterative analysis. Englewood Cliffs, N. J.: Prentice-Hall 1962. · Zbl 0133.08602
[19] Rump, S. M., Böhm, H.: Least significant bit evaluation of arithmetic expressions in single precision (to appear in Computing). · Zbl 0494.65020
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.