Explicit solution of the row completion problem for matrix pencils

DC Field	Value	Language
dc.contributor.author	Dodig, Marija	en
dc.date.accessioned	2020-04-27T10:33:25Z	-
dc.date.available	2020-04-27T10:33:25Z	-
dc.date.issued	2010-02-15	en
dc.identifier.issn	00243795	en
dc.identifier.uri	http://researchrepository.mi.sanu.ac.rs/handle/123456789/661	-
dc.description.abstract	In this paper we give new, explicit and simplified conditions for the problem of determining the possible strict equivalence class of a pencil with prescribed rows (columns). This improves the result from [1] and solves an important particular case of the challenge problem posed by Loiseau et al. [7]. All results that we present are obtained over arbitrary fields.	en
dc.publisher	Elsevier	-
dc.relation	FCT, Projects ISFL-1-1431 and SFRH/BPD/26607/2006	-
dc.relation	Ministry of Science of Serbia, Project No. 144014	-
dc.relation.ispartof	Linear Algebra and Its Applications	en
dc.subject	Completion \| Kronecker invariants \| Matrix pencils	en
dc.title	Explicit solution of the row completion problem for matrix pencils	en
dc.type	Article	en
dc.identifier.doi	10.1016/j.laa.2009.10.039	en
dc.identifier.scopus	2-s2.0-72049123756	en
dc.relation.firstpage	1299	en
dc.relation.lastpage	1309	en
dc.relation.issue	5	en
dc.relation.volume	432	en
dc.description.rank	M22	-
item.cerifentitytype	Publications	-
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-
item.openairetype	Article	-
item.grantfulltext	none	-
item.fulltext	No Fulltext	-
crisitem.author.orcid	0000-0001-8209-6920	-

19

checked on Nov 18, 2024

17

checked on Nov 19, 2024

Check