Computing the zeros of analytic functions
analytic functioncomputational complex analysislogarithmic residuemeromorphic functionpolesquadrature methodtextbookzeros
Polynomials and rational functions of one complex variable (30C10) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Numerical computation of solutions to single equations (65H05) Numerical computation of solutions to systems of equations (65H10)
The authors study the zeros of analytic function and several related problems in computational complex analysis. Using a logarithmic residue based quadrature method, the authors develop the algorithm for computing all the zeros of an analytic function \(f\) that lie inside a positively oriented Jordan curve \(\gamma.\) The same method is used to approximate the center of a cluster and the total number of zeros of the analytic function in this cluster. The authors also show how the logarithmic residue based approach can be used to compute all the zeros and poles of a meromorphic function that lie in the interior of a Jordan curve. They consider systems of analytic equations and use a multidimensional logarithmic residue formula to compute the zeros and corresponding multiplicities of analytics functions. This book provides useful methods and software for computing zeros of analytic functions which leads to a rich blend of mathematics and numerical analysis.
- scientific article; zbMATH DE number 1424366
- Locating all the zeros of an analytic function in one complex variable
- A derivative-free algorithm for computing zeros of analytic functions
- Computing zeros of analytic mappings: A logarithmic residue approach
- On locating clusters of zeros of analytic functions
- Computing zeros of analytic mappings: A logarithmic residue approach
- A derivative-free algorithm for computing zeros of analytic functions
- Computations with infinite Toeplitz matrices and polynomials
- A projection method for generalized eigenvalue problems using numerical integration.
- A perturbation result for generalized eigenvalue problems and its application to error estimation in a quadrature method for computing zeros of analytic functions.
- Stable polefinding and rational least-squares fitting via eigenvalues
- Symbolic computation and computer graphics as tools for developing and studying new root-finding methods
- An accurate numerical inversionof Laplace transforms based on the location of their poles
- An error analysis of two related quadrature methods for computing zeros of analytic functions.
- Numerical integration error method for zeros of analytic functions
- On a certain method for finding zeros of analytic functions and its application to solving boundary value problems
- On locating clusters of zeros of analytic functions
- A method for solving stationary equations for priority time-sharing service process in random environment
- Orthogonal iterations on companion-like pencils
- Computing leaky modes of optical fibers using a FEAST algorithm for polynomial eigenproblems
- Exact solution of the Zakharov-Shabat scattering problem for doubly-truncated multisoliton potentials
- On locating the zeros and poles of a meromorphic function
- Computing the complex zeros of special functions
- Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials
- An integral that counts the zeros of a function
- Bounds for zeros of entire functions
- A family of root-finding methods with accelerated convergence
- Analytic study of multiserver buffers with two-state Markovian arrivals and constant service times of multiple slots
- An efficient higher order family of root finders
- Sigmoid-like functions and root finding methods
- Equations determining Belyi pairs, with applications to anti-Vandermonde systems
- A modification of the numerical integration error method for the zero-finding problem of an analytic function
- BO: a unified tool for plasma waves and instabilities analysis
- On the asymptotic probability of forbidden motifs on the fringe of recursive trees
- Designing rational filter functions for solving eigenvalue problems by contour integration
- QPmR-quasi-polynomial root-finder: algorithm update and examples
- scientific article; zbMATH DE number 988722 (Why is no real title available?)
- Finding the number of roots of a polynomial in a plane region using the winding number
- The Singularity Expansion Method applied to the transient motions of a floating elastic plate
- scientific article; zbMATH DE number 3974178 (Why is no real title available?)
- On parallel complexity of analytic functions
- scientific article; zbMATH DE number 1131781 (Why is no real title available?)
- Computing multiple roots of inexact polynomials
- RECOVERING STATE TRAJECTORIES FROM OUTPUT MEASUREMENTS AND DYNAMIC MODELS: A COMPUTATIONAL COMPLEXITY POINT OF VIEW
- scientific article; zbMATH DE number 1424366 (Why is no real title available?)
- Nonlinear eigenvalue problems and contour integrals
- On generalized Halley-like methods for solving nonlinear equations
- Computing eigenvalues of real symmetric matrices with rational filters in real arithmetic
- Direct computation of elliptic singularities across anisotropic, multi-material edges
- Computation of the Real Zeros of the Kummer Function M(a;c;x)
- Symbolic algorithm for finding zeros of a system of holomorphic functions
- Fast barycentric rational interpolations for complex functions with some singularities
- Nonlinear functional equations satisfied by orthogonal polynomials
- Complexity of a root clustering algorithm for holomorphic functions
- The Liouville-Neumann expansion in singular eigenvalue problems
- Nonlocal dispersion and intermediate layer effects in insulator-insulator-metal plasmonic waveguides
- On the Green's function for the Helmholtz operator in an impedance circular cylindrical waveguide
- A Contour Method for Multiparameter Eigenvalue Problems
- On an application of symbolic computation and computer graphics to root-finders: the case of multiple roots of unknown multiplicity
- On location and approximation of clusters of zeros: Case of embedding dimension one
- New simultaneous root-finding methods with accelerated convergence for analytic functions
This page was built for publication: Computing the zeros of analytic functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1977445)
