Graphs and controllability completion problems

The symmetric N-matrix completion problem

Araújo, C. Mendes
Torregrosa, Juan R.
Urbano, Ana M.

September 2005

An $n\times n$ matrix is called an $N$-matrix if all its principal minors are negative. In this pap...

Controllability and completion of partial upper triangular matrices over rings

Gurvits, Leonid
Rodman, Leiba
Shalom, Tamir

July 1992

AbstractFor a given partial upper triangular matrix A and a matrix b over a ring, we characterize th...

Completion of partial operator matrices

Bakonyi, M.(Mihaly)

January 1992

This work concerns completion problems for partial operator matrices. A partial matrix is an m-by-n ...

Graphs and controllability completion problems

Jordán, C.
Torregrosa, J.R.
Urbano, A.M.

August 2001

AbstractIn this paper we are interested in the controllability completion problem when some assumpti...

Completions of partial P-matrices with acyclic or non-acyclic associated graph

Jordán, C.
Torregrosa, J.R.
Urbano, A.M.

July 2003

AbstractIn this paper we analyze the positive (sign-symmetric) P-matrix completion problem when the ...

The N-matrix completion problem under digraphs assumptions

Mendes Araújo, C
Torregrosa, Juan R
Urbano, Ana M

March 2004

AbstractAn n×n matrix is called an N-matrix if all principal minors are negative. In this paper, we ...

The completable digraphs for the totally nonnegative completion problem

Jordán, Cristina
Torregrosa, Juan-R.
el-Ghamry, Ramadán

March 2009

AbstractIn this paper, we study the totally nonnegative completion problem when the partial totally ...

N-matrix completion problem

Araújo, C. Mendes
Torregrosa, Juan R.
Urbano, Ana M.

October 2003

An n x n matrix is called an N-matrix if all principal minors are negative. In this paper, we are in...

The completion problem for N-matrices

Araújo, C. Mendes
Torregrosa, Juan R.

January 2002

An $n\times m$ matrix is called an $N$-matrix if all principal minors are negative. In this paper, w...

Conditions for a totally positive completion in the case of a symmetrically placed cycle

Johnson, Charles R
Kroschel, Brenda K

January 2014

In earlier work, the labelled graphs G for which every combinatorially symmetric totally nonnegative...

The N-matrix completion problem under digraphs assumptions

Araújo, C. Mendes
Torregrosa, Juan R.
Urbano, Ana M.

March 2004

An $n \times n$ matrix is called an $N$--matrix if all principal minors are negative. In this paper...

N-matrix completion problem

Araújo, C.Mendes
Torregrosa, Juan R.
Urbano, Ana M.

October 2003

AbstractAn n×n matrix is called an N-matrix if all principal minors are negative. In this paper, we ...

The cycle completable graphs for the completely positive and doubly nonnegative completion problems

Drew, John H.
Johnson, Charles R.
Kilner, Steven J.
McKay, Angela M.

July 2000

AbstractA partial matrix is a rectangular array, only some of whose entries are specified. The title...

The completion problem for N-matrices ∗

Claudia Mendes
Juan R. Torregrosa
Dpto Matematica
Dpto Matemática Aplicada

December 2014

An n×nmatrix is called anN-matrix if all principal minors are negative. In this paper, we are intere...

N_0 completions on partial matrices

Araújo, C. Mendes
Torregrosa, Juan R.
Jordán, Cristina

May 2009

An $n\times n$ matrix is called an $N_0$-matrix if all its principal minors are nonpositive. In this...

The symmetric N-matrix completion problem

Araújo, C. Mendes
Torregrosa, Juan R.
Urbano, Ana M.

September 2005

An $n\times n$ matrix is called an $N$-matrix if all its principal minors are negative. In this pap...

Controllability and completion of partial upper triangular matrices over rings

Gurvits, Leonid
Rodman, Leiba
Shalom, Tamir

July 1992

AbstractFor a given partial upper triangular matrix A and a matrix b over a ring, we characterize th...

Completion of partial operator matrices

Bakonyi, M.(Mihaly)

January 1992

This work concerns completion problems for partial operator matrices. A partial matrix is an m-by-n ...

Graphs and controllability completion problems

Jordán, C.
Torregrosa, J.R.
Urbano, A.M.

August 2001

AbstractIn this paper we are interested in the controllability completion problem when some assumpti...

Completions of partial P-matrices with acyclic or non-acyclic associated graph

Jordán, C.
Torregrosa, J.R.
Urbano, A.M.

July 2003

AbstractIn this paper we analyze the positive (sign-symmetric) P-matrix completion problem when the ...

The N-matrix completion problem under digraphs assumptions

Mendes Araújo, C
Torregrosa, Juan R
Urbano, Ana M

March 2004

AbstractAn n×n matrix is called an N-matrix if all principal minors are negative. In this paper, we ...

The completable digraphs for the totally nonnegative completion problem

Jordán, Cristina
Torregrosa, Juan-R.
el-Ghamry, Ramadán

March 2009

AbstractIn this paper, we study the totally nonnegative completion problem when the partial totally ...

N-matrix completion problem

Araújo, C. Mendes
Torregrosa, Juan R.
Urbano, Ana M.

October 2003

An n x n matrix is called an N-matrix if all principal minors are negative. In this paper, we are in...

The completion problem for N-matrices

Araújo, C. Mendes
Torregrosa, Juan R.

January 2002

An $n\times m$ matrix is called an $N$-matrix if all principal minors are negative. In this paper, w...

Conditions for a totally positive completion in the case of a symmetrically placed cycle

Johnson, Charles R
Kroschel, Brenda K

January 2014

In earlier work, the labelled graphs G for which every combinatorially symmetric totally nonnegative...

The N-matrix completion problem under digraphs assumptions

Araújo, C. Mendes
Torregrosa, Juan R.
Urbano, Ana M.

March 2004

An $n \times n$ matrix is called an $N$--matrix if all principal minors are negative. In this paper...

N-matrix completion problem

Araújo, C.Mendes
Torregrosa, Juan R.
Urbano, Ana M.

October 2003

AbstractAn n×n matrix is called an N-matrix if all principal minors are negative. In this paper, we ...

The cycle completable graphs for the completely positive and doubly nonnegative completion problems

Drew, John H.
Johnson, Charles R.
Kilner, Steven J.
McKay, Angela M.

July 2000

AbstractA partial matrix is a rectangular array, only some of whose entries are specified. The title...

The completion problem for N-matrices ∗

Claudia Mendes
Juan R. Torregrosa
Dpto Matematica
Dpto Matemática Aplicada

December 2014

An n×nmatrix is called anN-matrix if all principal minors are negative. In this paper, we are intere...

N_0 completions on partial matrices

Araújo, C. Mendes
Torregrosa, Juan R.
Jordán, Cristina

May 2009

An $n\times n$ matrix is called an $N_0$-matrix if all its principal minors are nonpositive. In this...

The symmetric N-matrix completion problem

Araújo, C. Mendes
Torregrosa, Juan R.
Urbano, Ana M.

September 2005

An $n\times n$ matrix is called an $N$-matrix if all its principal minors are negative. In this pap...

Controllability and completion of partial upper triangular matrices over rings

Gurvits, Leonid
Rodman, Leiba
Shalom, Tamir

July 1992

AbstractFor a given partial upper triangular matrix A and a matrix b over a ring, we characterize th...

Completion of partial operator matrices

Bakonyi, M.(Mihaly)

January 1992

This work concerns completion problems for partial operator matrices. A partial matrix is an m-by-n ...

Graphs and controllability completion problems

Abstract

Extracted data

Graphs and controllability completion problems

Abstract

Extracted data

Related items

Related items