Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Complex Zeros01:29

Complex Zeros

Complex zeros are the solutions to polynomial equations that include imaginary numbers, specifically, numbers of the form a + bi, where a and b are real numbers and i is the imaginary unit defined by i2=-1. These zeros satisfy the equation P(x) = 0, where P(x) is a polynomial with real or complex coefficients. Since the complex number system includes all real numbers, it provides a complete framework for analyzing all possible roots of a polynomial.Every polynomial of degree n≥1 can be...
Real Zeros of Polynomials01:27

Real Zeros of Polynomials

Polynomials are algebraic expressions of terms with variables raised to non-negative integer powers. A central aspect of analyzing polynomial functions is determining their real zeros—values of the variable for which the polynomial evaluates to zero. These values represent the x-intercepts of the polynomial’s graph.The Rational Zeros Theorem lists possible rational solutions for a polynomial equation with integer coefficients. If f(x)=anxn+....+a0​, then every rational zero is of the form p/q​,...
Fundamental Theorem of Algebra01:30

Fundamental Theorem of Algebra

The Fundamental Theorem of Algebra is central to the study of polynomial equations, asserting that every non-constant polynomial with complex coefficients has at least one complex zero. This means that a polynomial of degree n ≥ 1, written as:  with an ≠ 0, has at least one solution in the complex number system. Since the set of real numbers is a subset of complex numbers, this theorem applies equally to polynomials with real coefficients.Building on this result, the Complete Factorization...
Routh-Hurwitz Criterion II01:19

Routh-Hurwitz Criterion II

In the application of the Routh-Hurwitz criterion, two specific scenarios can arise that complicate stability analysis.
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first column of the Routh...
Introduction to Polynomial Functions01:26

Introduction to Polynomial Functions

Polynomial functions are fundamental elements in algebra and calculus, defined by expressions that combine variables and constants through addition, subtraction, and multiplication, with the variable raised to nonnegative integer exponents. A general polynomial function of degree n is given byWhere an ≠ 0. The term anxn is the leading term, and an is the leading coefficient, while a0 is referred to as the constant term.Characteristics and ClassificationPolynomials are categorized by their...
Quadratic Equations in the Complex Number System01:29

Quadratic Equations in the Complex Number System

A quadratic equation in the form ax2+bx+c=0 can have solutions that vary in nature depending on the value of the discriminant, b2−4ac. In this expression, a is the coefficient of the quadratic term x2, b is the coefficient of the linear term x, and c is the constant term. When the discriminant is negative, the equation has no real number solutions. However, by introducing complex numbers through the imaginary unit i, defined by i=-1, these equations can still be solved.The square root of a...

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Screening for Left Ventricular Hypertrophy Using Artificial Intelligence Algorithms Based on 12 Leads of the Electrocardiogram-Applicable in Clinical Practice?-Critical Literature Review with Meta-Analysis.

Healthcare (Basel, Switzerland)·2025
Same author

Are There Limits in Explainability of Prognostic Biomarkers? Scrutinizing Biological Utility of Established Signatures.

Cancers·2021
Same author

Impact of information diffusion on epidemic spreading in partially mapping two-layered time-varying networks.

Nonlinear dynamics·2021
Same author

Limitations of Explainability for Established Prognostic Biomarkers of Prostate Cancer.

Frontiers in genetics·2021
Same author

Ensuring the Robustness and Reliability of Data-Driven Knowledge Discovery Models in Production and Manufacturing.

Frontiers in artificial intelligence·2021
Same author

Data-Driven Computational Social Network Science: Predictive and Inferential Models for Web-Enabled Scientific Discoveries.

Frontiers in big data·2021

Related Experiment Video

Updated: May 20, 2026

Generation and Coherent Control of Pulsed Quantum Frequency Combs
06:42

Generation and Coherent Control of Pulsed Quantum Frequency Combs

Published on: June 8, 2018

The quality of zero bounds for complex polynomials.

Matthias Dehmer1, Yury Robertovich Tsoy

  • 1Institute for Bioinformatics and Translational Research, UMIT, Hall in Tyrol, Austria. matthias.dehmer@umit.at

Plos One
|July 19, 2012
PubMed
Summary

This study assesses the effectiveness of various bounds for locating complex polynomial zeros. Our findings offer insights into selecting optimal bounds for improved zero-finding accuracy.

Area of Science:

  • Numerical Analysis
  • Complex Polynomials

Background:

  • Locating zeros of complex polynomials is crucial in various scientific fields.
  • Existing a priori bounds on the moduli of zeros require thorough quality evaluation.

Purpose of the Study:

  • To evaluate and compare the quality of classical and new zero bounds for univariate complex polynomials.
  • To identify the most effective bounds for practical applications in polynomial root finding.

Main Methods:

  • Selection of established and novel bounds for polynomial zero moduli.
  • Empirical evaluation using diverse sets of complex polynomials.
  • Comparative analysis of bound performance based on accuracy and efficiency.

Main Results:

More Related Videos

Troubleshooting and Quality Assurance in Hyperpolarized Xenon Magnetic Resonance Imaging: Tools for High-Quality Image Acquisition
09:55

Troubleshooting and Quality Assurance in Hyperpolarized Xenon Magnetic Resonance Imaging: Tools for High-Quality Image Acquisition

Published on: January 5, 2024

Related Experiment Videos

Last Updated: May 20, 2026

Generation and Coherent Control of Pulsed Quantum Frequency Combs
06:42

Generation and Coherent Control of Pulsed Quantum Frequency Combs

Published on: June 8, 2018

Troubleshooting and Quality Assurance in Hyperpolarized Xenon Magnetic Resonance Imaging: Tools for High-Quality Image Acquisition
09:55

Troubleshooting and Quality Assurance in Hyperpolarized Xenon Magnetic Resonance Imaging: Tools for High-Quality Image Acquisition

Published on: January 5, 2024

  • Demonstrated variability in the quality of different zero bounds.
  • Identified specific bounds that offer superior performance for certain polynomial types.
  • Highlighted the limitations of some existing bounds.
  • Conclusions:

    • The quality of a priori zero bounds significantly impacts the efficiency of locating polynomial zeros.
    • Results provide a basis for selecting optimal bounds, enhancing numerical root-finding algorithms.