This paper proposes the matrix-weighted consensus algorithm, which is a generalization of the consensus algorithm. Given a networked dynamical system where the interconnections between agents are weighted by nonnegative definite matrices, it is shown that consensus and clustering phenomena naturally exist. We examine algebraic and algebraic graph conditions for achieving a consensus. (C) 2017 Elsevier Ltd. All rights reserved.