A new partitioning neural network model for recursively finding arbitrary roots of higher order arbitrary polynomials (Q1765859): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5289009 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4195836 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Phase unwrapping by factorization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Dilation method for finding close roots of polynomials based on constrained learning neural networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Learning representations by back-propagating errors / rank | |||
Normal rank | |||
Latest revision as of 18:57, 7 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new partitioning neural network model for recursively finding arbitrary roots of higher order arbitrary polynomials |
scientific article |
Statements
A new partitioning neural network model for recursively finding arbitrary roots of higher order arbitrary polynomials (English)
0 references
23 February 2005
0 references
Feedforward neural network
0 references
Roots-finder
0 references
Polynomial
0 references
Complex constrained learning algorithm
0 references
Partitioning
0 references
Laguerre method
0 references
Muller method
0 references
Jenkins-Traub method
0 references
Numerical examples
0 references
0 references
