The $\omega$-Condition Number: Applications to Optimal Preconditioning and Low Rank Generalized Jacobian Updating

TL;DR

This paper introduces the $\omega$-condition number, a novel measure based on singular value means, and explores its applications in optimal preconditioning, low rank Jacobian updates, and improving iterative linear system solutions.

Contribution

The paper defines the $\omega$-condition number, analyzes its properties, and demonstrates its advantages over classical measures in preconditioning and Jacobian approximation contexts.

Findings

$\omega$-condition number effectively guides optimal preconditioners.

Explicit formulas for $\omega$-optimal preconditioners are derived.

Using $\omega$ improves convergence and condition estimation in linear systems.

Abstract

Preconditioning is essential in iterative methods for solving linear systems. It is also the implicit objective in updating approximations of Jacobians in optimization methods, e.g.,in quasi-Newton methods. Motivated by the latter, we study a nonclassic matrix condition number, the $\omega$-condition number, $\omega$ for short. $\omega$ is the ratio of the arithmetic and geometric means of the singular values, rather than largest and smallest. Moreover, unlike the latter classical $\kappa$ condition number, $\omega$ is not invariant under inversion, an important point that allows one to recall that it is the conditioning of the inverse that is important. Our study is in the context of optimal conditioning for: (i) low rank updating of generalized Jacobians arising in the context of nonsmooth Newton methods; and (ii) iterative methods for linear systems; (iia) clustering of eigenvalues; (iib) convergence rates; and (iic) estimating the actual condition of a linear system. We emphasize that the simple functions in $\omega$ allow one to exploit optimality conditions and derive explicit formulae for $\omega$-optimal preconditioners of special structure. Connections to partial Cholesky type sparse preconditioners are made that modify the iterates of Cholesky decomposition by including the entire diagonal at each iteration. Our results confirm the efficacy of using the $\omega$-condition number compared to the classical $\kappa$-condition number.