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 Experiment Videos

Zeroing polynomials using modified constrained neural network approach.

De-Shuang Huang1, Horace H S Ip, Ken Chee Keung Law

  • 1Intelligent Computing Laboratory, Institute of Intelligent Machines, Chinese Academy of Sciences, Hefei, Anhui 230031, China. huangdeshuang@yahoo.com

IEEE Transactions on Neural Networks
|June 9, 2005
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

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

Sort by
Same author

Human-Structure-Aware Token Position Embedding for Tokenized Pose Estimation.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same author

GraphLooper: predicting chromatin loops based on hierarchical multi-view graph pooling method.

Briefings in bioinformatics·2026
Same author

LMSCDA: A Secondary Structure Enhanced Language Model for Predicting CircRNA and Disease Associations.

IEEE journal of biomedical and health informatics·2026
Same author

Multi-species integration, alignment and annotation of single-cell RNA-seq data with CAMEX.

Nature communications·2026
Same author

SpaLSTF: Diffusion-based generative model with BiLSTM and XCA-Transformer for spatial transcriptomics imputation.

PLoS computational biology·2026
Same author

A scalable computational framework for predicting gene expression from candidate <i>cis</i>-regulatory elements.

Genome research·2026
Same journal

Universal perceptron and DNA-like learning algorithm for binary neural networks: LSBF and PBF implementations.

IEEE transactions on neural networks·2013
Same journal

Guest editorial: special section on white box nonlinear prediction models.

IEEE transactions on neural networks·2011
Same journal

Data-based fault-tolerant control of high-speed trains with traction/braking notch nonlinearities and actuator failures.

IEEE transactions on neural networks·2011
Same journal

Guest editorial: special section on data-based control, modeling, and optimization.

IEEE transactions on neural networks·2011
Same journal

Neural network-based multiple robot simultaneous localization and mapping.

IEEE transactions on neural networks·2011
Same journal

Data-driven model-free adaptive control for a class of MIMO nonlinear discrete-time systems.

IEEE transactions on neural networks·2011
See all related articles

This study introduces modified constrained learning neural root finders (NRFs) for polynomial equations. These novel neural root finders offer a simpler and computationally efficient approach compared to existing methods, even with noisy data.

Area of Science:

  • Computational mathematics
  • Artificial intelligence
  • Numerical analysis

Background:

  • Polynomial root finding is a fundamental problem in mathematics and engineering.
  • Existing numerical methods can be computationally intensive or sensitive to initial conditions.
  • Neural networks offer a promising alternative for solving complex mathematical problems.

Purpose of the Study:

  • To propose novel modified constrained learning neural root finders (NRFs) for polynomial equations.
  • To investigate the performance of these NRFs based on backpropagation networks (BPNs).
  • To evaluate the robustness of the proposed methods against noisy polynomial coefficients.

Main Methods:

  • Development of modified constrained learning algorithms (MCLA) based on error cost functions (ECFs).

Related Experiment Videos

  • Utilizing the relationships between polynomial roots, coefficients, and root moments.
  • Implementation using backpropagation networks (BPNs) and the root-moment method (RMM).

    • Main Results:

    • The proposed MCLA demonstrates computational complexity of the order of the polynomial.
    • The MCLA is found to be simpler and more efficient than the conventional CLA.
    • The study evaluates the impact of various parameters and noise on the NRFs' performance.

    Conclusions:

    • The developed neural root finders provide an effective and computationally efficient alternative to traditional methods.
    • The modified constrained learning approach enhances the robustness of NRFs, particularly in the presence of noisy data.
    • Simulating experiments confirm the advantages of the proposed neural approaches over non-neural methods.