Pole assignment with optimal spectral conditioning (Q1391870): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pole assignment via Sylvester's equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approaches to robust pole assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3702408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust pole assignment in linear state feedback / rank
 
Normal rank
Property / cites work
 
Property / cites work: A gradient flow approach to the robust pole‐placement problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric state-feedback control for arbitrary eigenvalue assignment with minimum sensitivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4000286 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Schur method for pole assignment / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:20, 28 May 2024

scientific article
Language Label Description Also known as
English
Pole assignment with optimal spectral conditioning
scientific article

    Statements

    Pole assignment with optimal spectral conditioning (English)
    0 references
    0 references
    0 references
    23 July 1998
    0 references
    0 references
    0 references
    0 references
    0 references
    pole assignment
    0 references
    robustness
    0 references
    condition number
    0 references
    unconstrained minimizations
    0 references
    algorithm
    0 references