Charles R. Johnson

Comput. Appl. Math., February, 2025

2024

Efficient Vectors for Block Perturbed Consistent Matrices.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., March, 2024

Efficient vectors in priority setting methodology.

[BibT_eX]

[DOI]

Ann. Oper. Res., January, 2024

Pairwise comparison matrices with uniformly ordered efficient vectors.

[BibT_eX]

[DOI]

Int. J. Approx. Reason., 2024

Efficiency analysis for the Perron vector of a reciprocal matrix.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2024

2022

The Doubly Stochastic Single Eigenvalue Problem: A Computational Approach.

[BibT_eX]

[DOI]

Amit Harlev

Derek Lim

Exp. Math., 2022

The inverse eigenvalue problem for linear trees.

[BibT_eX]

[DOI]

Tanay V. Wakhare

Discret. Math., 2022

2021

Corrigendum to "The proportion of trees that are linear" [Discrete Math. 343 (10) (2020) 112008].

[BibT_eX]

[DOI]

Tanay V. Wakhare

Eric Wityk

Discret. Math., 2021

2020

Matricial Proofs of Some Classical Results about Critical Point Location.

[BibT_eX]

[DOI]

Pietro Paparella

Am. Math. Mon., 2020

The proportion of trees that are linear.

[BibT_eX]

[DOI]

Tanay V. Wakhare

Eric Wityk

Discret. Math., 2020

2017

Changes in vertex status and the fundamental decomposition of a tree relative to a multiple (parter) eigenvalue.

[BibT_eX]

[DOI]

António Leal Duarte

Paul R. McMichael

Discret. Appl. Math., 2017

2016

Comparison on the spectral radii of weighted digraphs that differ in a certain subdigraph.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2016

2015

The Number of Interlacing Equalities Resulting from Removal of a Vertex from a Tree.

[BibT_eX]

[DOI]

Miriam Farber

Leon Zhang

SIAM J. Discret. Math., 2015

2014

Ordered multiplicity lists for eigenvalues of symmetric matrices whose graph is a linear tree.

[BibT_eX]

[DOI]

Andrew A. Li

Andrew J. Walker

Discret. Math., 2014

2013

Nonpositive Eigenvalues of Hollow, Symmetric, Nonnegative Matrices.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2013

Nonpositive eigenvalues of the adjacency matrix and lower bounds for Laplacian eigenvalues.

[BibT_eX]

[DOI]

Discret. Math., 2013

Eigenvalue Pairing in the Response Matrix for a Class of Network Models with Circular Symmetry.

[BibT_eX]

[DOI]

Miriam Farber

Wei Zhen

Electron. J. Comb., 2013

2012

Minimizing the least eigenvalue of graphs with fixed order and size.

[BibT_eX]

[DOI]

Aneta Sawikowska

Discret. Math., 2012

Matrix Analysis, 2nd Ed.

[BibT_eX]

[DOI]

Cambridge University Press, ISBN: 9781139020411, 2012

2011

The change in multiplicity of an eigenvalue of a Hermitian matrix associated with the removal of an edge from its graph.

[BibT_eX]

[DOI]

Paul R. McMichael

Discret. Math., 2011

2010

On the Possible Ranks among Matrices with a given Pattern.

[BibT_eX]

[DOI]

Yulin Zhang

Discret. Math. Algorithms Appl., 2010

Note: TP<sub>2</sub>=Bruhat.

[BibT_eX]

[DOI]

S. Nasserasr

Discret. Math., 2010

Eigenvalue assignments and the two largest multiplicities in a Hermitian matrix whose graph is a tree.

[BibT_eX]

[DOI]

Christopher Jordan-Squire

David A. Sher

Discret. Appl. Math., 2010

2009

Parametrization of the Matrix Symplectic Group and Applications.

[BibT_eX]

[DOI]

Froilán M. Dopico

SIAM J. Matrix Anal. Appl., 2009

Solution theory for complete bilinear systems of equations.

[BibT_eX]

[DOI]

Joshua A. Link

Numer. Linear Algebra Appl., 2009

2008

On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2008

The extent to which triangular sub-patterns explain minimum rank.

[BibT_eX]

[DOI]

Joshua A. Link

Discret. Appl. Math., 2008

2007

Path Product Matrices and Eventually Inverse M-matrices.

[BibT_eX]

[DOI]

Ronald L. Smith

SIAM J. Matrix Anal. Appl., 2007

2006

Perturbation of Matrices Diagonalizable under Congruence.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2006

Compressions of Totally Positive Matrices.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2006

The trees for which maximum multiplicity implies the simplicity of other eigenvalues.

[BibT_eX]

[DOI]

Carlos M. Saiago

Discret. Math., 2006

Converse to the Parter-Wiener theorem: The case of non-trees.

[BibT_eX]

[DOI]

António Leal Duarte

Discret. Math., 2006

The number of equivalence classes of symmetric sign patterns.

[BibT_eX]

[DOI]

Peter J. Cameron

Discret. Math., 2006

2004

Hermitian Matrices, Eigenvalue Multiplicities, and Eigenvector Components.

[BibT_eX]

[DOI]

Brian D. Sutton

SIAM J. Matrix Anal. Appl., 2004

2003

Erratum: Successively Ordered Elementary Bidiagonal Factorization.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2003

Matrix Classes That Generate All Matrices with Positive Determinant.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2003

The Parter-Wiener Theorem: Refinement and Generalization.

[BibT_eX]

[DOI]

António Leal Duarte

Carlos M. Saiago

SIAM J. Matrix Anal. Appl., 2003

Multiplicative principal-minor inequalities for totally nonnegative matrices.

[BibT_eX]

[DOI]

Shaun M. Fallat

Michael I. Gekhtman

Adv. Appl. Math., 2003

2002

Eigenvalues of Words in Two Positive Definite Letters.

[BibT_eX]

[DOI]

Christopher J. Hillar

SIAM J. Matrix Anal. Appl., 2002

Intervals of Inverse M-Matrices.

[BibT_eX]

[DOI]

Ronald L. Smith

Reliab. Comput., 2002

2001

Successively Ordered Elementary Bidiagonal Factorization.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2001

Deterministic inverse zero-patterns.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2001

2000

Spectral Structures of Irreducible Totally Nonnegative Matrices.

[BibT_eX]

[DOI]

Shaun M. Fallat

Michael I. Gekhtman

SIAM J. Matrix Anal. Appl., 2000

Line-Sum Symmetry via the DomEig Algorithm.

[BibT_eX]

[DOI]

Joel Pitkin

David P. Stanford

Comput. Optim. Appl., 2000

1998

Approximate Semidefinite Matrices in a Linear Variety.

[BibT_eX]

[DOI]

Pablo Tarazaga

SIAM J. Matrix Anal. Appl., October, 1998

Critical Graphs for the Positive Definite Completion Problem.

[BibT_eX]

[DOI]

Wayne W. Barrett

Raphael Loewy

SIAM J. Matrix Anal. Appl., 1998

An Interior-Point Method for Approximate Positive Semidefinite Completions.

[BibT_eX]

[DOI]

Brenda Kroschel

Henry Wolkowicz

Comput. Optim. Appl., 1998

1996

In Memoriam Robert C. Thompson 1931-1995.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 1996

Structural conditions for cycle completable graphs.

[BibT_eX]

[DOI]

Terry A. McKee

Discret. Math., 1996

1995

Principal Submatrices, Geometric Multiplicities, and Structured Eigenvectors.

[BibT_eX]

[DOI]

Brenda K. Kroschel

SIAM J. Matrix Anal. Appl., 1995

The Euclidian Distance Matrix Completion Problem.

[BibT_eX]

[DOI]

Mihály Bakonyi

SIAM J. Matrix Anal. Appl., 1995

1993

Length Bounds for Singular Values of Sparse Matrices.

[BibT_eX]

[DOI]

Peter M. Nylen

SIAM J. Matrix Anal. Appl., October, 1993

Sparsity Analysis of the $QR$ Factorization.

[BibT_eX]

[DOI]

Donovan R. Hare

SIAM J. Matrix Anal. Appl., July, 1993

Sign Controllability of a Nonnegative Matrix and a Positive Vector.

[BibT_eX]

[DOI]

Volker Mehrmann

SIAM J. Matrix Anal. Appl., April, 1993

Determinantal inequalities for positive definite matrices.

[BibT_eX]

[DOI]

Wayne W. Barrett

Discret. Math., 1993

1991

Topics in Matrix Analysis.

[BibT_eX]

[DOI]

Cambridge University Press, ISBN: 978-0-511-84037-1, 1991

1990

Qualitative Analysis of Schur Complements.

[BibT_eX]

[DOI]

John S. Maybee

Proceedings of the Applied Geometry And Discrete Mathematics, 1990

Matrix analysis.

[BibT_eX]

Cambridge University Press, ISBN: 978-0-521-38632-6, 1990

1986

The structure of distances in networks.

[BibT_eX]

[DOI]

Eric Howe

James Lawrence

Networks, 1986

1985

Matrix Analysis.

[BibT_eX]

[DOI]

Cambridge University Press, ISBN: 9780511810817, 1985

1983

On a Generalized Matching Problem Arising in Estimating the Eigenvalue Variation of Two Matrices.

[BibT_eX]

[DOI]

Eur. J. Comb., 1983

1980

A note on cospectral graphs.

[BibT_eX]

[DOI]

Morris Newman

J. Comb. Theory B, 1980

1979

A convergence proof for a hyperstable adaptive recursive filter (Corresp.).

[BibT_eX]

[DOI]