Abstract
An improved Prony algorithm is described which produces a lower sum of squares of residuals than the usual Prony Algorithm. Indeed, the new algorithm produces the lowest sum of squares of residuals possible. A simple numerical example is used to compare the new and old algorithms. Within the context of the new algorithm, a technique to constrain poles is also described.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
