A Neural Root Finder of Polynomials Based on Root Moments (Q4832491): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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: On computational efficiency of the iterative methods for the simultaneous approximation of polynomial zeros / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Accelerated Solution of Multivariate Polynomial Systems of Equations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Equiripple minimum phase FIR filter design from linear phase systems using root moments / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Phase unwrapping by factorization / rank | |||
Normal rank | |||
Latest revision as of 17:01, 7 June 2024
scientific article; zbMATH DE number 2125133
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Neural Root Finder of Polynomials Based on Root Moments |
scientific article; zbMATH DE number 2125133 |
Statements
A Neural Root Finder of Polynomials Based on Root Moments (English)
0 references
4 January 2005
0 references
Constrained Learning Algorithm
0 references
0 references
0 references
0 references
