Program identification of zeroes and features of functions on the basis of sorting with the application to the digital filtration
On the basis of sorting schemes of steady localization and calculation of zeroes of polynomials and functions with consideration of multiplicity are synthesized. Schemes differ from known ones by construction on the basis of sorting, by property of automatic localization of area all zeroes and each...
Saved in:
| Date: | 2026 |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | Russian |
| Published: |
PROBLEMS IN PROGRAMMING
2026
|
| Subjects: | |
| Online Access: | https://pp.isofts.kiev.ua/index.php/ojs1/article/view/958 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Problems in programming |
| Download file: |  |
Institution
Problems in programming| Summary: | On the basis of sorting schemes of steady localization and calculation of zeroes of polynomials and functions with consideration of multiplicity are synthesized. Schemes differ from known ones by construction on the basis of sorting, by property of automatic localization of area all zeroes and each zero separately, by parallelism and by computing stability. By means of sorting the scheme of the approached calculation of residues of functions in poles is constructed and on this basis the scheme of the approached calculation of curvilinear integrals on the closed contour is constructed. Applicability of a method for the analysis of digital filters by means of inverse z-transformation and for the analysis of time function of linear dynamic system and for the analysis of stability of a discrete chain is investigated.Problems in programming 2010; 2-3: 593-603 |
|---|