A Reliable Argument Principle Algorithm to Find the Number of Zeros of an Analytic Function in a Bounded Domain.

Xingren Ying; I. Norman Katz

Numerische Mathematik (1988)

  • Volume: 53, Issue: 1-2, page 143-164
  • ISSN: 0029-599X; 0945-3245/e

How to cite

top

Ying, Xingren, and Katz, I. Norman. "A Reliable Argument Principle Algorithm to Find the Number of Zeros of an Analytic Function in a Bounded Domain.." Numerische Mathematik 53.1-2 (1988): 143-164. <http://eudml.org/doc/133269>.

@article{Ying1988,
author = {Ying, Xingren, Katz, I. Norman},
journal = {Numerische Mathematik},
keywords = {argument principle; number of zeros of an analytic function; reliable algorithm; numerical examples; discretization control; global information; nonlinear equation solver; solver for all roots},
number = {1-2},
pages = {143-164},
title = {A Reliable Argument Principle Algorithm to Find the Number of Zeros of an Analytic Function in a Bounded Domain.},
url = {http://eudml.org/doc/133269},
volume = {53},
year = {1988},
}

TY - JOUR
AU - Ying, Xingren
AU - Katz, I. Norman
TI - A Reliable Argument Principle Algorithm to Find the Number of Zeros of an Analytic Function in a Bounded Domain.
JO - Numerische Mathematik
PY - 1988
VL - 53
IS - 1-2
SP - 143
EP - 164
KW - argument principle; number of zeros of an analytic function; reliable algorithm; numerical examples; discretization control; global information; nonlinear equation solver; solver for all roots
UR - http://eudml.org/doc/133269
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.