#### Filter Results:

- Full text PDF available (8)

#### Publication Year

2005

2017

- This year (2)
- Last 5 years (4)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Matthew Booth, Philip Hackney, +8 authors Wendy Wang
- SIAM J. Matrix Analysis Applications
- 2008

- PAUL S. BOURDON, DAVID LEVI, SIVARAM K. NARAYAN, Lawrence G. Brown, JOEL H. SHAPIRO
- 2005

We characterize the essentially normal composition operators induced on the Hardy space H2 by linear fractional maps; they are either compact, normal, or (the nontrivial case) induced by parabolic non-automorphisms. These parabolic maps induce the first known examples of nontrivially essentially normal composition operators. In addition we characterize… (More)

- Francesco Barioli, Wayne Barrett, +15 authors Amy Wangsness Wehe
- 2017

The minimum rank of a simple graph G is defined to be the smallest possible rank over all symmetric real matrices whose ijth entry (for i 6= j) is nonzero whenever {i, j} is an edge in G and is zero otherwise. This paper introduces a new graph parameter, Z(G), that is the minimum size of a zero forcing set of vertices and uses it to bound the minimum rank… (More)

- Francesco Barioli, Shaun M. Fallat, +4 authors SIVARAM K. NARAYAN
- 2017

Let G = (V, E) be a multigraph with no loops on the vertex set V = {1, 2, . . . , n}. Define S+(G) as the set of symmetric positive semidefinite matrices A = [aij ] with aij 6= 0, i 6= j, if ij ∈ E(G) is a single edge and aij = 0, i 6= j, if ij / ∈ E(G). Let M+(G) denote the maximum multiplicity of zero as an eigenvalue of A ∈ S+(G) and mr+(G) = |G|−M+(G)… (More)

- Rachel Domagalski, Yeon Hyang Kim, Sivaram K. Narayan
- 2015 International Conference on Sampling Theory…
- 2015

A tight frame in R<sup>n</sup> is a redundant system which has a reconstruction formula similar to that of an orthonormal basis. For a unit-norm frame F = {f<sub>i</sub>}<sup>k</sup><sub>i=1</sub>, a scaling is a vector c = (c(l),..., c(k)) ε R<sup>k</sup>≥0 such that {c(i)f<sub>i</sub>}<sup>k</sup><sub>i=1</sub> is a tight frame in… (More)

- Alice Z.-Y. Chan, Martin S. Copenhaver, Sivaram K. Narayan, Logan Stokols, Allison Theobold
- Adv. Comput. Math.
- 2016

- Michael Lee, Elizabeth Love, Elizabeth Wascher, Sivaram K. Narayan
- 2006

A magic square M is an n-by-n array of numbers whose rows, columns, and the two diagonals sum to μ called the magic sum. If all the diagonals including broken diagonals sum to μ then the magic square is said to be pandiagonal. A regular magic square satisfies the condition that the entries symmetrically placed with respect to the center sum to 2μ n . If the… (More)

Let G = (V, E) be a multigraph with no loops on the vertex set V = {1, 2, . . . , n}. Define S+(G) as the set of symmetric positive semidefinite matrices A = [aij ] with aij 6= 0, i 6= j, if ij ∈ E(G) is a single edge and aij = 0, i 6= j, if ij / ∈ E(G). Let M+(G) denote the maximum multiplicity of zero as an eigenvalue of A ∈ S+(G) and mr+(G) = |G|−M+(G)… (More)

This paper is the result of undergraduate research done at Central Michigan University under the guidance of Dr. Sivaram K. Narayan, and was made possible in part by a grant from the Dean of the College of Science and Technology during the summer of 1998, and a CMU Summer Research Scholarship in the summer of 1999. I am very greatful to Dr. Narayan for his… (More)

- BRYAN CAIN, TERRY D. LENKER, SIVARAM K. NARAYAN, PETER VERMEIRE
- 2007

We consider (and characterize) mainly classes of (positively) stable complex matrices defined via methods of Geršgorin and Lyapunov. Although the real matrices in most of these classes have already been studied, we sometimes improve upon (and even correct) what has been previously published. Many of the classes turn out quite naturally to be products of… (More)