Computing the Brouwer degree in $R^{2}$
HTML articles powered by AMS MathViewer
- by P. J. Erdelsky PDF
- Math. Comp. 27 (1973), 133-137 Request permission
Abstract:
A very simple rigorous procedure is derived for computing the Brouwer degree in ${R^2}$, a generalization of the zero-counting integral $\oint {f’(z)\;dz/f(z)}$, for functions which are Lipschitz continuous on a piecewise linear path of integration, using only computed or observed values of $f(z)$, a bound for the error in them, and a bound for the Lipschitz constant. It is used to locate zeros and to test the numerical significance of zeros found by other methods.References
- L. M. Delves and J. N. Lyness, A numerical method for locating the zeros of an analytic function, Math. Comp. 21 (1967), 543–560. MR 228165, DOI 10.1090/S0025-5718-1967-0228165-4
- James Dugundji, Topology, Allyn and Bacon, Inc., Boston, Mass., 1966. MR 0193606
- Peter Henrici and Irene Gargantini, Uniformly convergent algorithms for the simultaneous approximation of all zeros of a polynomial, Constructive Aspects of the Fundamental Theorem of Algebra (Proc. Sympos., Zürich-Rüschlikon, 1967) Wiley-Interscience, New York, 1969, pp. 77–113. MR 0256553
- G. W. Stewart III, Error analysis of the algorithm for shifting the zeros of a polynomial by synthetic division, Math. Comp. 25 (1971), 135–139. MR 292333, DOI 10.1090/S0025-5718-1971-0292333-7
Additional Information
- © Copyright 1973 American Mathematical Society
- Journal: Math. Comp. 27 (1973), 133-137
- MSC: Primary 65D20
- DOI: https://doi.org/10.1090/S0025-5718-1973-0326990-5
- MathSciNet review: 0326990