A Neural Root Finder of Polynomials Based on Root Moments (Q4832491): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1162/089976604774201668 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2126262069 / 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: 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 16: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

    Identifiers