 | This article is rated Start-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||
| ||||||||||||||
- If the first element of the first row of every row pair is positive at this point, then the system is stable.
Needs clarification, what is a row pair?
Moreover, I don't think that it is correct. Actually, the system is stable if the absolute value of the first element of each odd-numbered row is greater than the absolute value of the last non-zero element in the same row. The Italian version of this article is good I think. Even the construction of the table is a bit more complicated in the English version. Maybe, it should be clearer to use determinants of 2x2 matrices. Ciano bill ( talk) 22:23, 8 May 2008 (UTC)
This is completely wrong. — Preceding unsigned comment added by 143.235.204.106 ( talk) 20:46, 25 November 2015 (UTC)
Strictly speaking, this article describes the Marden algorithm rather than Jury. They're closely related, though. The difference between Marden and Jury algorithms is explained in Rajan S., "Stability and stabilization of linear time invariant system using marden table" ( https://shodhganga.inflibnet.ac.in/bitstream/10603/50219/8/08_chapter3.pdf), pages 44-50 particularly. Marden's test requires building the full table, which is what we read in the article: "... continued in this manner until a row containing only one non-zero element is reached," while Jury's allows to stop at the pair of rows that contain 3 elements. And checking the sign of the leading coefficient is Marden's criterion, while Jury's criterion is based on the comparison of the magnitudes of the first and the last coefficients in a row.
— Preceding unsigned comment added by 89.109.50.205 ( talk) 21:17, 13 January 2023 (UTC)
|
| This article is rated Start-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||
| ||||||||||||||
- If the first element of the first row of every row pair is positive at this point, then the system is stable.
Needs clarification, what is a row pair?
Moreover, I don't think that it is correct. Actually, the system is stable if the absolute value of the first element of each odd-numbered row is greater than the absolute value of the last non-zero element in the same row. The Italian version of this article is good I think. Even the construction of the table is a bit more complicated in the English version. Maybe, it should be clearer to use determinants of 2x2 matrices. Ciano bill ( talk) 22:23, 8 May 2008 (UTC)
This is completely wrong. — Preceding unsigned comment added by 143.235.204.106 ( talk) 20:46, 25 November 2015 (UTC)
Strictly speaking, this article describes the Marden algorithm rather than Jury. They're closely related, though. The difference between Marden and Jury algorithms is explained in Rajan S., "Stability and stabilization of linear time invariant system using marden table" ( https://shodhganga.inflibnet.ac.in/bitstream/10603/50219/8/08_chapter3.pdf), pages 44-50 particularly. Marden's test requires building the full table, which is what we read in the article: "... continued in this manner until a row containing only one non-zero element is reached," while Jury's allows to stop at the pair of rows that contain 3 elements. And checking the sign of the leading coefficient is Marden's criterion, while Jury's criterion is based on the comparison of the magnitudes of the first and the last coefficients in a row.
— Preceding unsigned comment added by 89.109.50.205 ( talk) 21:17, 13 January 2023 (UTC)