2017
DOI: 10.24193/subbmath.2017.3.05
|View full text |Cite
|
Sign up to set email alerts
|

A new proof of Ackermann's formula from control theory

Abstract: Abstract. This paper presents a novel proof for the well known Ackermann's formula, related to pole placement in linear time invariant systems. The proof uses a lemma [3], concerning rank one updates for matrices, often used to efficiently compute the determinants. The proof is given in great detail, but it can be summarised to few lines.Mathematics Subject Classification (2010): 26D10, 46N30.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 2 publications
0
0
0
Order By: Relevance
“…  . To find 1 l the Ackermann formula [10] was used 1 0.023 l  . Similarly, for A functional block of the Luenberger state observer (see Figure 3) was programmed.…”
Section: Controller Design and Implementationmentioning
confidence: 99%
“…  . To find 1 l the Ackermann formula [10] was used 1 0.023 l  . Similarly, for A functional block of the Luenberger state observer (see Figure 3) was programmed.…”
Section: Controller Design and Implementationmentioning
confidence: 99%