Pole placement preconditioning

DOI10.1016/S0024-3795(02)00472-XzbMath1018.65059MaRDI QIDQ1874661

Daniela Calvetti, Lothar Reichel

Publication date: 25 May 2003

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

numerical examplesiterative methodpreconditionernonsymmetric linear systemimplicitly restarted Arnoldi methodrestarted GMRES methodpartial pole placement problemgeneralized minimum residual methodspartial eigenvalue assignment problemtime-invariant linear control systems

Mathematics Subject Classification ID

Pole and zero placement problems (93B55) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items

A new framework for implicit restarting of the Krylov-Schur algorithm

Uses Software

• eigs
• Algorithm 747
• IRAM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An analysis of the pole placement problem I: The single-input case
• Restarted GMRES preconditioned by deflation
• On the selection of poles in the single-input pole placement problem
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• An algorithm to assign eigenvalues in a Hessenberg matrix: Single input case
• Projection and deflation method for partial pole assignment in linear state feedback
• Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
• Adaptively Preconditioned GMRES Algorithms
• Iterative Solution Methods
• Algorithm 747: a Fortran subroutine to solve the eigenvalue assignment problem for multiinput systems using state feedback
• Single-Input Eigenvalue Assignment Algorithms: A Close Look
• Choosing Poles So That the Single-Input Pole Placement Problem Is Well Conditioned
• The Condition Number of Equivalence Transformations That Block Diagonalize Matrix Pencils
• Eigenvalue translation based preconditioners for the GMRES(k) method

This page was built for publication: Pole placement preconditioning