Quadratic vector equations

11Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We study in a unified fashion several quadratic vector and matrix equations with nonnegativity hypotheses, by seeing them as special cases of the general problem Mx=a+b(x,x), where a and the unknown x are componentwise nonnegative vectors, M is a nonsingular M-matrix, and b is a bilinear map from pairs of nonnegative vectors to nonnegative vectors. Specific cases of this equation have been studied extensively in the past by several authors, and include unilateral matrix equations from queuing problems (Bini, Latouche, and Meini, 2005 [7]), nonsymmetric algebraic Riccati equations (Guo and Laub, 2000 [14]), and quadratic matrix equations encountered in neutron transport theory (Lu, 2005 [23,24]). We present a unified approach which treats the common aspects of their theoretical properties and basic iterative solution algorithms. This has interesting consequences: in some cases, we are able to derive in full generality theorems and proofs appeared in literature only for special cases of the problem; this broader view highlights the role of hypotheses such as the strict positivity of the minimal solution. In an example, we adapt an algorithm derived for one equation of the class to another, with computational advantage with respect to the existing methods. We discuss possible research lines, including the relationship among Newton-type methods and the cyclic reduction algorithm for unilateral quadratic equations. © 2011 Elsevier Inc. All rights reserved.

Cite

CITATION STYLE

APA

Poloni, F. (2013). Quadratic vector equations. In Linear Algebra and Its Applications (Vol. 438, pp. 1627–1644). https://doi.org/10.1016/j.laa.2011.05.036

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free