Solution of the determinantal assignment problem using the Grassmann matrices
The paper provides a direct solution to the determinantal assignment problem (DAP) which unifies all frequency assignment problems of the linear control theory. The current approach is based on the solvability of the exterior equation where is an n −dimensional vector space over which is an integral...
Ausführliche Beschreibung
Autor*in: |
Karcanias, Nicos [verfasserIn] |
---|
Format: |
Artikel |
---|---|
Sprache: |
Englisch |
Erschienen: |
2016 |
---|
Rechteinformationen: |
Nutzungsrecht: © 2015 Taylor & Francis 2015 |
---|
Schlagwörter: |
---|
Übergeordnetes Werk: |
Enthalten in: International journal of control - London : Taylor & Francis, 1965, 89(2016), 2, Seite 352 |
---|---|
Übergeordnetes Werk: |
volume:89 ; year:2016 ; number:2 ; pages:352 |
Links: |
---|
DOI / URN: |
10.1080/00207179.2015.1077525 |
---|
Katalog-ID: |
OLC1971624357 |
---|
LEADER | 01000caa a2200265 4500 | ||
---|---|---|---|
001 | OLC1971624357 | ||
003 | DE-627 | ||
005 | 20230714181928.0 | ||
007 | tu | ||
008 | 160308s2016 xx ||||| 00| ||eng c | ||
024 | 7 | |a 10.1080/00207179.2015.1077525 |2 doi | |
028 | 5 | 2 | |a PQ20160430 |
035 | |a (DE-627)OLC1971624357 | ||
035 | |a (DE-599)GBVOLC1971624357 | ||
035 | |a (PRQ)i1452-b9309505c1b4d9f0db1259726b68db5d2443f491948c48ea20f80266d7f655d00 | ||
035 | |a (KEY)0006630320160000089000200352solutionofthedeterminantalassignmentproblemusingth | ||
040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
041 | |a eng | ||
082 | 0 | 4 | |a 620 |q DNB |
100 | 1 | |a Karcanias, Nicos |e verfasserin |4 aut | |
245 | 1 | 0 | |a Solution of the determinantal assignment problem using the Grassmann matrices |
264 | 1 | |c 2016 | |
336 | |a Text |b txt |2 rdacontent | ||
337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
338 | |a Band |b nc |2 rdacarrier | ||
520 | |a The paper provides a direct solution to the determinantal assignment problem (DAP) which unifies all frequency assignment problems of the linear control theory. The current approach is based on the solvability of the exterior equation where is an n −dimensional vector space over which is an integral part of the solution of DAP. New criteria for existence of solution and their computation based on the properties of structured matrices are referred to as Grassmann matrices. The solvability of this exterior equation is referred to as decomposability of , and it is in turn characterised by the set of quadratic Plücker relations (QPRs) describing the Grassmann variety of the corresponding projective space. Alternative new tests for decomposability of the multi-vector are given in terms of the rank properties of the Grassmann matrix, of the vector , which is constructed by the coordinates of . It is shown that the exterior equation is solvable ( is decomposable), if and only if where ; the solution space for a decomposable , is the space . This provides an alternative linear algebra characterisation of the decomposability problem and of the Grassmann variety to that defined by the QPRs. Further properties of the Grassmann matrices are explored by defining the Hodge-Grassmann matrix as the dual of the Grassmann matrix. The connections of the Hodge-Grassmann matrix to the solution of exterior equations are examined, and an alternative new characterisation of decomposability is given in terms of the dimension of its image space. The framework based on the Grassmann matrices provides the means for the development of a new computational method for the solutions of the exact DAP (when such solutions exist), as well as computing approximate solutions, when exact solutions do not exist. | ||
540 | |a Nutzungsrecht: © 2015 Taylor & Francis 2015 | ||
650 | 4 | |a frequency assignment | |
650 | 4 | |a control theory | |
650 | 4 | |a linear and multilinear algebra | |
700 | 1 | |a Leventides, John |4 oth | |
773 | 0 | 8 | |i Enthalten in |t International journal of control |d London : Taylor & Francis, 1965 |g 89(2016), 2, Seite 352 |w (DE-627)129595780 |w (DE-600)240693-7 |w (DE-576)015088804 |x 0020-7179 |7 nnns |
773 | 1 | 8 | |g volume:89 |g year:2016 |g number:2 |g pages:352 |
856 | 4 | 1 | |u http://dx.doi.org/10.1080/00207179.2015.1077525 |3 Volltext |
856 | 4 | 2 | |u http://www.tandfonline.com/doi/abs/10.1080/00207179.2015.1077525 |
912 | |a GBV_USEFLAG_A | ||
912 | |a SYSFLAG_A | ||
912 | |a GBV_OLC | ||
912 | |a SSG-OLC-TEC | ||
912 | |a GBV_ILN_70 | ||
912 | |a GBV_ILN_2020 | ||
912 | |a GBV_ILN_4314 | ||
912 | |a GBV_ILN_4318 | ||
912 | |a GBV_ILN_4700 | ||
951 | |a AR | ||
952 | |d 89 |j 2016 |e 2 |h 352 |
author_variant |
n k nk |
---|---|
matchkey_str |
article:00207179:2016----::ouinfhdtriatlsinetrbeuigh |
hierarchy_sort_str |
2016 |
publishDate |
2016 |
allfields |
10.1080/00207179.2015.1077525 doi PQ20160430 (DE-627)OLC1971624357 (DE-599)GBVOLC1971624357 (PRQ)i1452-b9309505c1b4d9f0db1259726b68db5d2443f491948c48ea20f80266d7f655d00 (KEY)0006630320160000089000200352solutionofthedeterminantalassignmentproblemusingth DE-627 ger DE-627 rakwb eng 620 DNB Karcanias, Nicos verfasserin aut Solution of the determinantal assignment problem using the Grassmann matrices 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier The paper provides a direct solution to the determinantal assignment problem (DAP) which unifies all frequency assignment problems of the linear control theory. The current approach is based on the solvability of the exterior equation where is an n −dimensional vector space over which is an integral part of the solution of DAP. New criteria for existence of solution and their computation based on the properties of structured matrices are referred to as Grassmann matrices. The solvability of this exterior equation is referred to as decomposability of , and it is in turn characterised by the set of quadratic Plücker relations (QPRs) describing the Grassmann variety of the corresponding projective space. Alternative new tests for decomposability of the multi-vector are given in terms of the rank properties of the Grassmann matrix, of the vector , which is constructed by the coordinates of . It is shown that the exterior equation is solvable ( is decomposable), if and only if where ; the solution space for a decomposable , is the space . This provides an alternative linear algebra characterisation of the decomposability problem and of the Grassmann variety to that defined by the QPRs. Further properties of the Grassmann matrices are explored by defining the Hodge-Grassmann matrix as the dual of the Grassmann matrix. The connections of the Hodge-Grassmann matrix to the solution of exterior equations are examined, and an alternative new characterisation of decomposability is given in terms of the dimension of its image space. The framework based on the Grassmann matrices provides the means for the development of a new computational method for the solutions of the exact DAP (when such solutions exist), as well as computing approximate solutions, when exact solutions do not exist. Nutzungsrecht: © 2015 Taylor & Francis 2015 frequency assignment control theory linear and multilinear algebra Leventides, John oth Enthalten in International journal of control London : Taylor & Francis, 1965 89(2016), 2, Seite 352 (DE-627)129595780 (DE-600)240693-7 (DE-576)015088804 0020-7179 nnns volume:89 year:2016 number:2 pages:352 http://dx.doi.org/10.1080/00207179.2015.1077525 Volltext http://www.tandfonline.com/doi/abs/10.1080/00207179.2015.1077525 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC GBV_ILN_70 GBV_ILN_2020 GBV_ILN_4314 GBV_ILN_4318 GBV_ILN_4700 AR 89 2016 2 352 |
spelling |
10.1080/00207179.2015.1077525 doi PQ20160430 (DE-627)OLC1971624357 (DE-599)GBVOLC1971624357 (PRQ)i1452-b9309505c1b4d9f0db1259726b68db5d2443f491948c48ea20f80266d7f655d00 (KEY)0006630320160000089000200352solutionofthedeterminantalassignmentproblemusingth DE-627 ger DE-627 rakwb eng 620 DNB Karcanias, Nicos verfasserin aut Solution of the determinantal assignment problem using the Grassmann matrices 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier The paper provides a direct solution to the determinantal assignment problem (DAP) which unifies all frequency assignment problems of the linear control theory. The current approach is based on the solvability of the exterior equation where is an n −dimensional vector space over which is an integral part of the solution of DAP. New criteria for existence of solution and their computation based on the properties of structured matrices are referred to as Grassmann matrices. The solvability of this exterior equation is referred to as decomposability of , and it is in turn characterised by the set of quadratic Plücker relations (QPRs) describing the Grassmann variety of the corresponding projective space. Alternative new tests for decomposability of the multi-vector are given in terms of the rank properties of the Grassmann matrix, of the vector , which is constructed by the coordinates of . It is shown that the exterior equation is solvable ( is decomposable), if and only if where ; the solution space for a decomposable , is the space . This provides an alternative linear algebra characterisation of the decomposability problem and of the Grassmann variety to that defined by the QPRs. Further properties of the Grassmann matrices are explored by defining the Hodge-Grassmann matrix as the dual of the Grassmann matrix. The connections of the Hodge-Grassmann matrix to the solution of exterior equations are examined, and an alternative new characterisation of decomposability is given in terms of the dimension of its image space. The framework based on the Grassmann matrices provides the means for the development of a new computational method for the solutions of the exact DAP (when such solutions exist), as well as computing approximate solutions, when exact solutions do not exist. Nutzungsrecht: © 2015 Taylor & Francis 2015 frequency assignment control theory linear and multilinear algebra Leventides, John oth Enthalten in International journal of control London : Taylor & Francis, 1965 89(2016), 2, Seite 352 (DE-627)129595780 (DE-600)240693-7 (DE-576)015088804 0020-7179 nnns volume:89 year:2016 number:2 pages:352 http://dx.doi.org/10.1080/00207179.2015.1077525 Volltext http://www.tandfonline.com/doi/abs/10.1080/00207179.2015.1077525 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC GBV_ILN_70 GBV_ILN_2020 GBV_ILN_4314 GBV_ILN_4318 GBV_ILN_4700 AR 89 2016 2 352 |
allfields_unstemmed |
10.1080/00207179.2015.1077525 doi PQ20160430 (DE-627)OLC1971624357 (DE-599)GBVOLC1971624357 (PRQ)i1452-b9309505c1b4d9f0db1259726b68db5d2443f491948c48ea20f80266d7f655d00 (KEY)0006630320160000089000200352solutionofthedeterminantalassignmentproblemusingth DE-627 ger DE-627 rakwb eng 620 DNB Karcanias, Nicos verfasserin aut Solution of the determinantal assignment problem using the Grassmann matrices 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier The paper provides a direct solution to the determinantal assignment problem (DAP) which unifies all frequency assignment problems of the linear control theory. The current approach is based on the solvability of the exterior equation where is an n −dimensional vector space over which is an integral part of the solution of DAP. New criteria for existence of solution and their computation based on the properties of structured matrices are referred to as Grassmann matrices. The solvability of this exterior equation is referred to as decomposability of , and it is in turn characterised by the set of quadratic Plücker relations (QPRs) describing the Grassmann variety of the corresponding projective space. Alternative new tests for decomposability of the multi-vector are given in terms of the rank properties of the Grassmann matrix, of the vector , which is constructed by the coordinates of . It is shown that the exterior equation is solvable ( is decomposable), if and only if where ; the solution space for a decomposable , is the space . This provides an alternative linear algebra characterisation of the decomposability problem and of the Grassmann variety to that defined by the QPRs. Further properties of the Grassmann matrices are explored by defining the Hodge-Grassmann matrix as the dual of the Grassmann matrix. The connections of the Hodge-Grassmann matrix to the solution of exterior equations are examined, and an alternative new characterisation of decomposability is given in terms of the dimension of its image space. The framework based on the Grassmann matrices provides the means for the development of a new computational method for the solutions of the exact DAP (when such solutions exist), as well as computing approximate solutions, when exact solutions do not exist. Nutzungsrecht: © 2015 Taylor & Francis 2015 frequency assignment control theory linear and multilinear algebra Leventides, John oth Enthalten in International journal of control London : Taylor & Francis, 1965 89(2016), 2, Seite 352 (DE-627)129595780 (DE-600)240693-7 (DE-576)015088804 0020-7179 nnns volume:89 year:2016 number:2 pages:352 http://dx.doi.org/10.1080/00207179.2015.1077525 Volltext http://www.tandfonline.com/doi/abs/10.1080/00207179.2015.1077525 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC GBV_ILN_70 GBV_ILN_2020 GBV_ILN_4314 GBV_ILN_4318 GBV_ILN_4700 AR 89 2016 2 352 |
allfieldsGer |
10.1080/00207179.2015.1077525 doi PQ20160430 (DE-627)OLC1971624357 (DE-599)GBVOLC1971624357 (PRQ)i1452-b9309505c1b4d9f0db1259726b68db5d2443f491948c48ea20f80266d7f655d00 (KEY)0006630320160000089000200352solutionofthedeterminantalassignmentproblemusingth DE-627 ger DE-627 rakwb eng 620 DNB Karcanias, Nicos verfasserin aut Solution of the determinantal assignment problem using the Grassmann matrices 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier The paper provides a direct solution to the determinantal assignment problem (DAP) which unifies all frequency assignment problems of the linear control theory. The current approach is based on the solvability of the exterior equation where is an n −dimensional vector space over which is an integral part of the solution of DAP. New criteria for existence of solution and their computation based on the properties of structured matrices are referred to as Grassmann matrices. The solvability of this exterior equation is referred to as decomposability of , and it is in turn characterised by the set of quadratic Plücker relations (QPRs) describing the Grassmann variety of the corresponding projective space. Alternative new tests for decomposability of the multi-vector are given in terms of the rank properties of the Grassmann matrix, of the vector , which is constructed by the coordinates of . It is shown that the exterior equation is solvable ( is decomposable), if and only if where ; the solution space for a decomposable , is the space . This provides an alternative linear algebra characterisation of the decomposability problem and of the Grassmann variety to that defined by the QPRs. Further properties of the Grassmann matrices are explored by defining the Hodge-Grassmann matrix as the dual of the Grassmann matrix. The connections of the Hodge-Grassmann matrix to the solution of exterior equations are examined, and an alternative new characterisation of decomposability is given in terms of the dimension of its image space. The framework based on the Grassmann matrices provides the means for the development of a new computational method for the solutions of the exact DAP (when such solutions exist), as well as computing approximate solutions, when exact solutions do not exist. Nutzungsrecht: © 2015 Taylor & Francis 2015 frequency assignment control theory linear and multilinear algebra Leventides, John oth Enthalten in International journal of control London : Taylor & Francis, 1965 89(2016), 2, Seite 352 (DE-627)129595780 (DE-600)240693-7 (DE-576)015088804 0020-7179 nnns volume:89 year:2016 number:2 pages:352 http://dx.doi.org/10.1080/00207179.2015.1077525 Volltext http://www.tandfonline.com/doi/abs/10.1080/00207179.2015.1077525 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC GBV_ILN_70 GBV_ILN_2020 GBV_ILN_4314 GBV_ILN_4318 GBV_ILN_4700 AR 89 2016 2 352 |
allfieldsSound |
10.1080/00207179.2015.1077525 doi PQ20160430 (DE-627)OLC1971624357 (DE-599)GBVOLC1971624357 (PRQ)i1452-b9309505c1b4d9f0db1259726b68db5d2443f491948c48ea20f80266d7f655d00 (KEY)0006630320160000089000200352solutionofthedeterminantalassignmentproblemusingth DE-627 ger DE-627 rakwb eng 620 DNB Karcanias, Nicos verfasserin aut Solution of the determinantal assignment problem using the Grassmann matrices 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier The paper provides a direct solution to the determinantal assignment problem (DAP) which unifies all frequency assignment problems of the linear control theory. The current approach is based on the solvability of the exterior equation where is an n −dimensional vector space over which is an integral part of the solution of DAP. New criteria for existence of solution and their computation based on the properties of structured matrices are referred to as Grassmann matrices. The solvability of this exterior equation is referred to as decomposability of , and it is in turn characterised by the set of quadratic Plücker relations (QPRs) describing the Grassmann variety of the corresponding projective space. Alternative new tests for decomposability of the multi-vector are given in terms of the rank properties of the Grassmann matrix, of the vector , which is constructed by the coordinates of . It is shown that the exterior equation is solvable ( is decomposable), if and only if where ; the solution space for a decomposable , is the space . This provides an alternative linear algebra characterisation of the decomposability problem and of the Grassmann variety to that defined by the QPRs. Further properties of the Grassmann matrices are explored by defining the Hodge-Grassmann matrix as the dual of the Grassmann matrix. The connections of the Hodge-Grassmann matrix to the solution of exterior equations are examined, and an alternative new characterisation of decomposability is given in terms of the dimension of its image space. The framework based on the Grassmann matrices provides the means for the development of a new computational method for the solutions of the exact DAP (when such solutions exist), as well as computing approximate solutions, when exact solutions do not exist. Nutzungsrecht: © 2015 Taylor & Francis 2015 frequency assignment control theory linear and multilinear algebra Leventides, John oth Enthalten in International journal of control London : Taylor & Francis, 1965 89(2016), 2, Seite 352 (DE-627)129595780 (DE-600)240693-7 (DE-576)015088804 0020-7179 nnns volume:89 year:2016 number:2 pages:352 http://dx.doi.org/10.1080/00207179.2015.1077525 Volltext http://www.tandfonline.com/doi/abs/10.1080/00207179.2015.1077525 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC GBV_ILN_70 GBV_ILN_2020 GBV_ILN_4314 GBV_ILN_4318 GBV_ILN_4700 AR 89 2016 2 352 |
language |
English |
source |
Enthalten in International journal of control 89(2016), 2, Seite 352 volume:89 year:2016 number:2 pages:352 |
sourceStr |
Enthalten in International journal of control 89(2016), 2, Seite 352 volume:89 year:2016 number:2 pages:352 |
format_phy_str_mv |
Article |
institution |
findex.gbv.de |
topic_facet |
frequency assignment control theory linear and multilinear algebra |
dewey-raw |
620 |
isfreeaccess_bool |
false |
container_title |
International journal of control |
authorswithroles_txt_mv |
Karcanias, Nicos @@aut@@ Leventides, John @@oth@@ |
publishDateDaySort_date |
2016-01-01T00:00:00Z |
hierarchy_top_id |
129595780 |
dewey-sort |
3620 |
id |
OLC1971624357 |
language_de |
englisch |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC1971624357</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230714181928.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">160308s2016 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1080/00207179.2015.1077525</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20160430</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1971624357</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1971624357</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)i1452-b9309505c1b4d9f0db1259726b68db5d2443f491948c48ea20f80266d7f655d00</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0006630320160000089000200352solutionofthedeterminantalassignmentproblemusingth</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">DNB</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Karcanias, Nicos</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Solution of the determinantal assignment problem using the Grassmann matrices</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2016</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The paper provides a direct solution to the determinantal assignment problem (DAP) which unifies all frequency assignment problems of the linear control theory. The current approach is based on the solvability of the exterior equation where is an n −dimensional vector space over which is an integral part of the solution of DAP. New criteria for existence of solution and their computation based on the properties of structured matrices are referred to as Grassmann matrices. The solvability of this exterior equation is referred to as decomposability of , and it is in turn characterised by the set of quadratic Plücker relations (QPRs) describing the Grassmann variety of the corresponding projective space. Alternative new tests for decomposability of the multi-vector are given in terms of the rank properties of the Grassmann matrix, of the vector , which is constructed by the coordinates of . It is shown that the exterior equation is solvable ( is decomposable), if and only if where ; the solution space for a decomposable , is the space . This provides an alternative linear algebra characterisation of the decomposability problem and of the Grassmann variety to that defined by the QPRs. Further properties of the Grassmann matrices are explored by defining the Hodge-Grassmann matrix as the dual of the Grassmann matrix. The connections of the Hodge-Grassmann matrix to the solution of exterior equations are examined, and an alternative new characterisation of decomposability is given in terms of the dimension of its image space. The framework based on the Grassmann matrices provides the means for the development of a new computational method for the solutions of the exact DAP (when such solutions exist), as well as computing approximate solutions, when exact solutions do not exist.</subfield></datafield><datafield tag="540" ind1=" " ind2=" "><subfield code="a">Nutzungsrecht: © 2015 Taylor & Francis 2015</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">frequency assignment</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">control theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">linear and multilinear algebra</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Leventides, John</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">International journal of control</subfield><subfield code="d">London : Taylor & Francis, 1965</subfield><subfield code="g">89(2016), 2, Seite 352</subfield><subfield code="w">(DE-627)129595780</subfield><subfield code="w">(DE-600)240693-7</subfield><subfield code="w">(DE-576)015088804</subfield><subfield code="x">0020-7179</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:89</subfield><subfield code="g">year:2016</subfield><subfield code="g">number:2</subfield><subfield code="g">pages:352</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1080/00207179.2015.1077525</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://www.tandfonline.com/doi/abs/10.1080/00207179.2015.1077525</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4314</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">89</subfield><subfield code="j">2016</subfield><subfield code="e">2</subfield><subfield code="h">352</subfield></datafield></record></collection>
|
author |
Karcanias, Nicos |
spellingShingle |
Karcanias, Nicos ddc 620 misc frequency assignment misc control theory misc linear and multilinear algebra Solution of the determinantal assignment problem using the Grassmann matrices |
authorStr |
Karcanias, Nicos |
ppnlink_with_tag_str_mv |
@@773@@(DE-627)129595780 |
format |
Article |
dewey-ones |
620 - Engineering & allied operations |
delete_txt_mv |
keep |
author_role |
aut |
collection |
OLC |
remote_str |
false |
illustrated |
Not Illustrated |
issn |
0020-7179 |
topic_title |
620 DNB Solution of the determinantal assignment problem using the Grassmann matrices frequency assignment control theory linear and multilinear algebra |
topic |
ddc 620 misc frequency assignment misc control theory misc linear and multilinear algebra |
topic_unstemmed |
ddc 620 misc frequency assignment misc control theory misc linear and multilinear algebra |
topic_browse |
ddc 620 misc frequency assignment misc control theory misc linear and multilinear algebra |
format_facet |
Aufsätze Gedruckte Aufsätze |
format_main_str_mv |
Text Zeitschrift/Artikel |
carriertype_str_mv |
nc |
author2_variant |
j l jl |
hierarchy_parent_title |
International journal of control |
hierarchy_parent_id |
129595780 |
dewey-tens |
620 - Engineering |
hierarchy_top_title |
International journal of control |
isfreeaccess_txt |
false |
familylinks_str_mv |
(DE-627)129595780 (DE-600)240693-7 (DE-576)015088804 |
title |
Solution of the determinantal assignment problem using the Grassmann matrices |
ctrlnum |
(DE-627)OLC1971624357 (DE-599)GBVOLC1971624357 (PRQ)i1452-b9309505c1b4d9f0db1259726b68db5d2443f491948c48ea20f80266d7f655d00 (KEY)0006630320160000089000200352solutionofthedeterminantalassignmentproblemusingth |
title_full |
Solution of the determinantal assignment problem using the Grassmann matrices |
author_sort |
Karcanias, Nicos |
journal |
International journal of control |
journalStr |
International journal of control |
lang_code |
eng |
isOA_bool |
false |
dewey-hundreds |
600 - Technology |
recordtype |
marc |
publishDateSort |
2016 |
contenttype_str_mv |
txt |
container_start_page |
352 |
author_browse |
Karcanias, Nicos |
container_volume |
89 |
class |
620 DNB |
format_se |
Aufsätze |
author-letter |
Karcanias, Nicos |
doi_str_mv |
10.1080/00207179.2015.1077525 |
dewey-full |
620 |
title_sort |
solution of the determinantal assignment problem using the grassmann matrices |
title_auth |
Solution of the determinantal assignment problem using the Grassmann matrices |
abstract |
The paper provides a direct solution to the determinantal assignment problem (DAP) which unifies all frequency assignment problems of the linear control theory. The current approach is based on the solvability of the exterior equation where is an n −dimensional vector space over which is an integral part of the solution of DAP. New criteria for existence of solution and their computation based on the properties of structured matrices are referred to as Grassmann matrices. The solvability of this exterior equation is referred to as decomposability of , and it is in turn characterised by the set of quadratic Plücker relations (QPRs) describing the Grassmann variety of the corresponding projective space. Alternative new tests for decomposability of the multi-vector are given in terms of the rank properties of the Grassmann matrix, of the vector , which is constructed by the coordinates of . It is shown that the exterior equation is solvable ( is decomposable), if and only if where ; the solution space for a decomposable , is the space . This provides an alternative linear algebra characterisation of the decomposability problem and of the Grassmann variety to that defined by the QPRs. Further properties of the Grassmann matrices are explored by defining the Hodge-Grassmann matrix as the dual of the Grassmann matrix. The connections of the Hodge-Grassmann matrix to the solution of exterior equations are examined, and an alternative new characterisation of decomposability is given in terms of the dimension of its image space. The framework based on the Grassmann matrices provides the means for the development of a new computational method for the solutions of the exact DAP (when such solutions exist), as well as computing approximate solutions, when exact solutions do not exist. |
abstractGer |
The paper provides a direct solution to the determinantal assignment problem (DAP) which unifies all frequency assignment problems of the linear control theory. The current approach is based on the solvability of the exterior equation where is an n −dimensional vector space over which is an integral part of the solution of DAP. New criteria for existence of solution and their computation based on the properties of structured matrices are referred to as Grassmann matrices. The solvability of this exterior equation is referred to as decomposability of , and it is in turn characterised by the set of quadratic Plücker relations (QPRs) describing the Grassmann variety of the corresponding projective space. Alternative new tests for decomposability of the multi-vector are given in terms of the rank properties of the Grassmann matrix, of the vector , which is constructed by the coordinates of . It is shown that the exterior equation is solvable ( is decomposable), if and only if where ; the solution space for a decomposable , is the space . This provides an alternative linear algebra characterisation of the decomposability problem and of the Grassmann variety to that defined by the QPRs. Further properties of the Grassmann matrices are explored by defining the Hodge-Grassmann matrix as the dual of the Grassmann matrix. The connections of the Hodge-Grassmann matrix to the solution of exterior equations are examined, and an alternative new characterisation of decomposability is given in terms of the dimension of its image space. The framework based on the Grassmann matrices provides the means for the development of a new computational method for the solutions of the exact DAP (when such solutions exist), as well as computing approximate solutions, when exact solutions do not exist. |
abstract_unstemmed |
The paper provides a direct solution to the determinantal assignment problem (DAP) which unifies all frequency assignment problems of the linear control theory. The current approach is based on the solvability of the exterior equation where is an n −dimensional vector space over which is an integral part of the solution of DAP. New criteria for existence of solution and their computation based on the properties of structured matrices are referred to as Grassmann matrices. The solvability of this exterior equation is referred to as decomposability of , and it is in turn characterised by the set of quadratic Plücker relations (QPRs) describing the Grassmann variety of the corresponding projective space. Alternative new tests for decomposability of the multi-vector are given in terms of the rank properties of the Grassmann matrix, of the vector , which is constructed by the coordinates of . It is shown that the exterior equation is solvable ( is decomposable), if and only if where ; the solution space for a decomposable , is the space . This provides an alternative linear algebra characterisation of the decomposability problem and of the Grassmann variety to that defined by the QPRs. Further properties of the Grassmann matrices are explored by defining the Hodge-Grassmann matrix as the dual of the Grassmann matrix. The connections of the Hodge-Grassmann matrix to the solution of exterior equations are examined, and an alternative new characterisation of decomposability is given in terms of the dimension of its image space. The framework based on the Grassmann matrices provides the means for the development of a new computational method for the solutions of the exact DAP (when such solutions exist), as well as computing approximate solutions, when exact solutions do not exist. |
collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC GBV_ILN_70 GBV_ILN_2020 GBV_ILN_4314 GBV_ILN_4318 GBV_ILN_4700 |
container_issue |
2 |
title_short |
Solution of the determinantal assignment problem using the Grassmann matrices |
url |
http://dx.doi.org/10.1080/00207179.2015.1077525 http://www.tandfonline.com/doi/abs/10.1080/00207179.2015.1077525 |
remote_bool |
false |
author2 |
Leventides, John |
author2Str |
Leventides, John |
ppnlink |
129595780 |
mediatype_str_mv |
n |
isOA_txt |
false |
hochschulschrift_bool |
false |
author2_role |
oth |
doi_str |
10.1080/00207179.2015.1077525 |
up_date |
2024-07-03T20:03:12.502Z |
_version_ |
1803589509451874304 |
fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC1971624357</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230714181928.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">160308s2016 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1080/00207179.2015.1077525</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20160430</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1971624357</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1971624357</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)i1452-b9309505c1b4d9f0db1259726b68db5d2443f491948c48ea20f80266d7f655d00</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0006630320160000089000200352solutionofthedeterminantalassignmentproblemusingth</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">DNB</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Karcanias, Nicos</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Solution of the determinantal assignment problem using the Grassmann matrices</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2016</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The paper provides a direct solution to the determinantal assignment problem (DAP) which unifies all frequency assignment problems of the linear control theory. The current approach is based on the solvability of the exterior equation where is an n −dimensional vector space over which is an integral part of the solution of DAP. New criteria for existence of solution and their computation based on the properties of structured matrices are referred to as Grassmann matrices. The solvability of this exterior equation is referred to as decomposability of , and it is in turn characterised by the set of quadratic Plücker relations (QPRs) describing the Grassmann variety of the corresponding projective space. Alternative new tests for decomposability of the multi-vector are given in terms of the rank properties of the Grassmann matrix, of the vector , which is constructed by the coordinates of . It is shown that the exterior equation is solvable ( is decomposable), if and only if where ; the solution space for a decomposable , is the space . This provides an alternative linear algebra characterisation of the decomposability problem and of the Grassmann variety to that defined by the QPRs. Further properties of the Grassmann matrices are explored by defining the Hodge-Grassmann matrix as the dual of the Grassmann matrix. The connections of the Hodge-Grassmann matrix to the solution of exterior equations are examined, and an alternative new characterisation of decomposability is given in terms of the dimension of its image space. The framework based on the Grassmann matrices provides the means for the development of a new computational method for the solutions of the exact DAP (when such solutions exist), as well as computing approximate solutions, when exact solutions do not exist.</subfield></datafield><datafield tag="540" ind1=" " ind2=" "><subfield code="a">Nutzungsrecht: © 2015 Taylor & Francis 2015</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">frequency assignment</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">control theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">linear and multilinear algebra</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Leventides, John</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">International journal of control</subfield><subfield code="d">London : Taylor & Francis, 1965</subfield><subfield code="g">89(2016), 2, Seite 352</subfield><subfield code="w">(DE-627)129595780</subfield><subfield code="w">(DE-600)240693-7</subfield><subfield code="w">(DE-576)015088804</subfield><subfield code="x">0020-7179</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:89</subfield><subfield code="g">year:2016</subfield><subfield code="g">number:2</subfield><subfield code="g">pages:352</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1080/00207179.2015.1077525</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://www.tandfonline.com/doi/abs/10.1080/00207179.2015.1077525</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4314</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">89</subfield><subfield code="j">2016</subfield><subfield code="e">2</subfield><subfield code="h">352</subfield></datafield></record></collection>
|
score |
7.401867 |