Pole assignment, a new proof and algorithm (Q5966549): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Recursive simplification of pole-assignment problem in multi-input systems† / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized eigenstructure problem in linear system theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pole assignment, a new proof and algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesis of linear systems with desired equivalent form / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for pole assignment of time invariant linear systems† / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of numerical algorithms related to computing controllability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Schur method for pole assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624527 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0167-6911(82)80036-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2074683501 / rank
 
Normal rank

Latest revision as of 11:52, 30 July 2024

scientific article; zbMATH DE number 3790292
Language Label Description Also known as
English
Pole assignment, a new proof and algorithm
scientific article; zbMATH DE number 3790292

    Statements