2011
DOI: 10.2478/v10006-011-0012-3
|View full text |Cite
|
Sign up to set email alerts
|

On generalized inverses of singular matrix pencils

Abstract: Linear time-invariant networks are modelled by linear differential-algebraic equations with constant coefficients. These equations can be represented by a matrix pencil. Many publications on this subject are restricted to regular matrix pencils. In particular, the influence of the Weierstrass structure of a regular pencil on the poles of its inverse is well known. In this paper we investigate singular matrix pencils. The relations between the Kronecker structure of a singular matrix pencil and the multiplicity… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 48 publications
0
5
0
Order By: Relevance
“…The LS Prony method leads to high estimation performances compared to those of the Prony method. Other methods that lead to high performances under specific conditions are proposed in [83][84][85]. The Prony method allows for estimating inter-harmonics, harmonics and damping components.…”
Section: Modified Least Square Prony Methodsmentioning
confidence: 99%
“…The LS Prony method leads to high estimation performances compared to those of the Prony method. Other methods that lead to high performances under specific conditions are proposed in [83][84][85]. The Prony method allows for estimating inter-harmonics, harmonics and damping components.…”
Section: Modified Least Square Prony Methodsmentioning
confidence: 99%
“…Occasionally, (general) pseudo-inverses are defined such that AA + A = A and A + AA + = A + hold, which ensures pseudo-invertibility of (some) singular matrices (see the works of Ben-Israel and Greville (2003), Bose and Mitra (1978), Boullion and Odell (1971), Campbell and Meyer (2008) or Röbenack and Reinschke (2011) in the context of dynamical systems). In addition to the above conditions, the Moore-Penrose pseudo-inverse satisfies (A + A) T = A + A and (AA + ) T = AA + , and although it can be used here, we can mostly be more permissive for the purpose of this paper.…”
Section: Remarkmentioning
confidence: 99%
“…The Moore-Penrose inverse is a useful tool for solving linear systems and matrix equations (Ben-Israel and Grevile, 2003;Penrose, 1956). Also, the Moore-Penrose inverse is frequently applied in the study of numerical properties of singular matrix pencils (Röbenack and Reinschke, 2011). Górecki and Łuczak (2013) used a generalization of the Moore-Penrose pseudoinverse to resolve the problem in the Linear Discriminant Analysis (LDA) technique.…”
Section: Introductionmentioning
confidence: 99%