An efficient algorithm for the symmetric principal minor assignment problem

E-resources

PDF

Full text

Peer reviewed Open access

An efficient algorithm for the symmetric principal minor assignment problem

Rising, Justin; Kulesza, Alex; Taskar, Ben

Linear algebra and its applications, 05/2015, Volume: 473

Journal Article

We consider the problem of reconstructing a symmetric matrix from its principal minors, which has several applications in information theory and statistical modeling. We develop a theory of symmetric matrices with equal corresponding principal minors based on a simple equivalent property due to Oeding (2011) 10. We then use this theory to provide a method for choosing a canonical representative from the class of all symmetric matrices with specified principal minors. Finally, we provide an efficient algorithm for computing this canonical representative given its principal minors as input.

Keep searching

Author

Rising, Justin | Kulesza, Alex | Taskar, Ben

Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.

Year	Impact factor		Edition		Category		Classification
Year	JCR	SNIP	JCR	SNIP	JCR	SNIP	JCR	SNIP

Links to authors' personal bibliographies	Links to information on researchers in the SICRIS system

Source: Personal bibliographies and: SICRIS

Upload image

Shelf entry

Adding material to shelf was successful.

Adding material to shelf failed.

It was not necessary to add the material to the shelf.

Permalink

E-mail

Impact factor

Select the library membership card:

DRS, in which the journal is indexed

Citations

Theme