Suchergebnisse - Complex root-finding algorithm

  1. 1

    On root finding algorithms for complex functions with branch cuts von Kowalczyk, Piotr

    ISSN: 0377-0427, 1879-1778
    Veröffentlicht: Elsevier B.V 01.04.2017
    Veröffentlicht in Journal of computational and applied mathematics (01.04.2017)
    “… A simple and versatile method is presented, which enhances the complex root finding process by eliminating branch cuts and branch points in the analyzed domain …”
    Volltext
    Journal Article
  2. 2

    A New Root-Finding Algorithm for Solving Real-World Problems and Its Complex Dynamics via Computer Technology von Naseem, Amir, Rehman, M. A., Younis, Jihad

    ISSN: 1076-2787, 1099-0526
    Veröffentlicht: Hoboken Hindawi 2021
    Veröffentlicht in Complexity (New York, N.Y.) (2021)
    “… Many complex statistics can be sorted out easily with the help of different computer programs in seconds, especially in computational and applied Mathematics …”
    Volltext
    Journal Article
  3. 3

    Self-Adaptive Mesh Generator for Global Complex Roots and Poles Finding Algorithm von Dziedziewicz, Sebastian, Warecka, Malgorzata, Lech, Rafal, Kowalczyk, Piotr

    ISSN: 0018-9480, 1557-9670
    Veröffentlicht: New York IEEE 01.07.2023
    “… However, the global complex roots and poles finding algorithm (GRPF) (as one of the few) has direct control over the accuracy of the results …”
    Volltext
    Journal Article
  4. 4

    AN IMPROVED ITERATIVE SCHEME FOR REAL AND COMPLEX ROOTS DETECTION von Malhotra, Reetu, Siwach, Anujeet

    ISSN: 0973-8975, 2454-7190
    Veröffentlicht: 31.08.2025
    “… In this study, researchers propose an innovative numerical approach to solve non-linear equations for real as well as complex roots …”
    Volltext
    Journal Article
  5. 5

    Global Complex Roots and Poles Finding Algorithm in C × R Domain von Dziedziewicz, Sebastian, Warecka, Malgorzata, Lech, Rafal, Kowalczyk, Piotr

    ISSN: 2169-3536, 2169-3536
    Veröffentlicht: Piscataway IEEE 2023
    Veröffentlicht in IEEE access (2023)
    “… An algorithm to find the roots and poles of a complex function depending on two arguments …”
    Volltext
    Journal Article
  6. 6

    Global Complex Roots and Poles Finding Algorithm Based on Phase Analysis for Propagation and Radiation Problems von Kowalczyk, Piotr

    ISSN: 0018-926X, 1558-2221
    Veröffentlicht: New York IEEE 01.12.2018
    Veröffentlicht in IEEE transactions on antennas and propagation (01.12.2018)
    “… A flexible and effective algorithm for complex roots and poles finding is presented …”
    Volltext
    Journal Article
  7. 7

    A Geometric Approach to Global Complex Roots Finding Algorithm von Li, Yan-Rong

    ISBN: 9798383645925
    Veröffentlicht: ProQuest Dissertations & Theses 01.01.2021
    “… Recently, many high efficient root finding methods had been proposed. However, those algorithms usually required an initial point that is close enough to the exact root …”
    Volltext
    Dissertation
  8. 8

    Efficient complex root finding algorithm for microwave and optical propagation problems von Kowalczyk, Piotr

    Veröffentlicht: IEEE 01.05.2016
    “… Article relates to the use of innovative root finding algorithm (on a complex plane) to study propagation properties of microwave and optical waveguides …”
    Volltext
    Tagungsbericht
  9. 9
  10. 10

    Global Roots and Poles Finding Algorithm on Quantum Computer von Buczkowski, Jakub, Kozminski, Tomasz, Szczepanski, Filip, Wilinski, Michal, Stefanski, Tomasz P.

    ISSN: 2169-3536, 2169-3536
    Veröffentlicht: Piscataway IEEE 2024
    Veröffentlicht in IEEE access (2024)
    “… In this paper, the implementation of the global roots and poles finding algorithm for a complex-valued function of a complex variable on a quantum computer, which allows for solving general nonlinear …”
    Volltext
    Journal Article
  11. 11

    Simple and fast numerical analysis of multilayer waveguide modes von Kwon, Min-Suk, Shin, Sang-Yung

    ISSN: 0030-4018, 1873-0310
    Veröffentlicht: Amsterdam Elsevier B.V 15.03.2004
    Veröffentlicht in Optics communications (15.03.2004)
    “… The proposed method has two features: simple implementation and fast calculation. Its implementation is simple since it is based on a complex root-finding algorithm reported recently …”
    Volltext
    Journal Article
  12. 12

    An Improvement of Global Complex Roots and Poles Finding Algorithm for Propagation and Radiation Problems von Jasinski, Maciej, Dziedziewicz, Sebastian, Jozwicka, Maria, Kowalczyk, Piotr

    Veröffentlicht: European Association on Antennas and Propagation 01.03.2019
    “… An improvement of the recently developed global roots finding algorithm has been proposed …”
    Volltext
    Tagungsbericht
  13. 13

    Innovative root finding and tracing algorithms in complex domain for treatment of lossy transmission lines von Marynowski, Wojciech, Kowalczyk, Piotr

    Veröffentlicht: IEICE 01.10.2016
    “… Innovative complex root finding and tracing algorithms are applied to the analysis of losses in transmission line containing a thin graphene layer deposited on a silicone substrate …”
    Volltext
    Tagungsbericht
  14. 14

    Newton’s method in practice, II: The iterated refinement Newton method and near-optimal complexity for finding all roots of some polynomials of very large degrees von Randig, Marvin, Schleicher, Dierk, Stoll, Robin

    ISSN: 0377-0427, 1879-1778, 1879-1778
    Veröffentlicht: Elsevier B.V 01.02.2024
    Veröffentlicht in Journal of computational and applied mathematics (01.02.2024)
    “… We present an algorithm, based on Newton’s method, for finding all roots of univariate complex polynomials so that the observed complexity is linear in the degree, up to logarithmic factors …”
    Volltext
    Journal Article
  15. 15

    Simulating biologically plausible complex survival data von Crowther, Michael J., Lambert, Paul C.

    ISSN: 0277-6715, 1097-0258, 1097-0258
    Veröffentlicht: England Blackwell Publishing Ltd 15.10.2013
    Veröffentlicht in Statistics in medicine (15.10.2013)
    “… We describe a general algorithm involving numerical integration and rootfinding techniques to generate survival times from a variety of complex parametric distributions, incorporating any combination of time …”
    Volltext
    Journal Article
  16. 16

    FAMILIES OF RATIONAL MAPS AND ITERATIVE ROOT-FINDING ALGORITHMS (DYNAMICS, COMPLEX ANALYSIS, NEWTON'S METHOD) von MCMULLEN, CURTIS TRACY

    ISBN: 9798643117704
    Veröffentlicht: ProQuest Dissertations & Theses 01.01.1985
    “… In this work we develop a rigidity theorem for algebraic families of rational maps and apply it to the study of iterative root-finding algorithms …”
    Volltext
    Dissertation
  17. 17

    Efficient Inverse Fractional Neural Network-Based Simultaneous Schemes for Nonlinear Engineering Applications von Shams, Mudassir, Carpentieri, Bruno

    ISSN: 2504-3110, 2504-3110
    Veröffentlicht: Basel MDPI AG 01.12.2023
    Veröffentlicht in Fractal and fractional (01.12.2023)
    “… In this paper, we propose a new class of global neural network-based root-finding algorithms for locating real and complex polynomial roots, which exploits the ability of machine learning techniques …”
    Volltext
    Journal Article
  18. 18

    Dynamics of Newton-like root finding methods von Campos, B., Canela, J., Vindel, P.

    ISSN: 1017-1398, 1572-9265
    Veröffentlicht: New York Springer US 01.08.2023
    Veröffentlicht in Numerical algorithms (01.08.2023)
    “… When exploring the literature, it can be observed that the operator obtained when applying Newton-like root finding algorithms to the quadratic polynomials z 2 …”
    Volltext
    Journal Article
  19. 19

    Improved Aberth–Ehrlich root-finding algorithm and its further application for binary microlensing von Fatheddin, Hossein, Sajadian, Sedighe

    ISSN: 0035-8711, 1365-2966
    Veröffentlicht: Oxford University Press 30.06.2022
    Veröffentlicht in Monthly notices of the Royal Astronomical Society (30.06.2022)
    “… ) is used while modelling binary light curves. In this paper, we first introduce a fast root-finding algorithm for univariate polynomials based on the Aberth–Ehrlich (AE …”
    Volltext
    Journal Article
  20. 20

    An explicit 16-stage Runge–Kutta method of order 10 discovered by numerical search von Zhang, David Kai

    ISSN: 1017-1398, 1572-9265
    Veröffentlicht: New York Springer US 01.07.2024
    Veröffentlicht in Numerical algorithms (01.07.2024)
    “… -finding algorithms to the order conditions. A naïve implementation of these algorithms would be made computationally infeasible by the considerable size and complex structure of the Butcher equations …”
    Volltext
    Journal Article