Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Philip A. Knight is active.

Publication


Featured researches published by Philip A. Knight.


SIAM Journal on Matrix Analysis and Applications | 2008

The Sinkhorn-Knopp Algorithm: Convergence and Applications

Philip A. Knight

As long as a square nonnegative matrix


SIAM Journal on Matrix Analysis and Applications | 2014

A Symmetry Preserving Algorithm for Matrix Scaling

Philip A. Knight; Daniel Ruiz; Bora Uçar

A


Journal of Physics A | 1996

On the periodically perturbed logistic equation

Michael Grinfeld; Philip A. Knight; Harbir Lamba

contains sufficient nonzero elements, the Sinkhorn-Knopp algorithm can be used to balance the matrix, that is, to find a diagonal scaling of


SIAM Journal on Matrix Analysis and Applications | 1995

Matrix Powers in Finite Precision Arithmetic

Nicholas J. Higham; Philip A. Knight

A


Journal of Statistical Physics | 2012

Rank-driven Markov processes

Michael Grinfeld; Philip A. Knight; Andrew R. Wade

that is doubly stochastic. We relate balancing to problems in traffic flow and describe how balancing algorithms can be used to give a two sided measure of nodes in a graph. We show that with an appropriate modification, the Sinkhorn-Knopp algorithm is a natural candidate for computing the measure on enormous data sets.


Linear Algebra and its Applications | 1995

Fast rectangular matrix multiplication and QR decomposition

Philip A. Knight

We present an iterative algorithm which asymptotically scales the


Ima Journal of Numerical Analysis | 2013

A fast algorithm for matrix balancing

Philip A. Knight; Daniel Ruiz

\infty


Archive | 2015

A First Course in Network Theory

Ernesto Estrada; Philip A. Knight

-norm of each row and each column of a matrix to one. This scaling algorithm preserves symmetry of the original matrix and shows fast linear convergence with an asymptotic rate of 1/2. We discuss extensions of the algorithm to the 1-norm, and by inference to other norms. For the 1-norm case, we show again that convergence is linear, with the rate dependent on the spectrum of the scaled matrix. We demonstrate experimentally that the scaling algorithm improves the conditioning of the matrix and that it helps direct solvers by reducing the need for pivoting. In particular, for symmetric matrices the theoretical and experimental results highlight the potential of the proposed algorithm over existing alternatives.


Physical Review E | 2011

Bak-Sneppen-type models and rank-driven processes.

Michael Grinfeld; Philip A. Knight; Andrew R. Wade

We study the logistic equation modified by a periodic time dependence. The perturbation introduces bifurcation delays which can be calculated explicitly and we qualitatively explain how the bifurcation diagram deforms as the perturbation is increased.


Journal of Computational and Applied Mathematics | 2007

The Hertz contact problem, coupled Volterra integral equations and a linear complementarity problem

A. Gauthier; Philip A. Knight; Sean McKee

If

Collaboration


Dive into the Philip A. Knight's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

A. Gauthier

University of Strathclyde

View shared research outputs
Top Co-Authors

Avatar

Ernesto Estrada

University of Strathclyde

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Sean McKee

University of Strathclyde

View shared research outputs
Top Co-Authors

Avatar

Harbir Lamba

George Mason University

View shared research outputs
Top Co-Authors

Avatar

Bora Uçar

École normale supérieure de Lyon

View shared research outputs
Researchain Logo
Decentralizing Knowledge