Condition number bounds for problems with integer coefficients

From MaRDI portal



Abstract: An apriori bound for the condition number associated to each of the following problems is given: general linear equation solving, minimum squares, non-symmetric eigenvalue problems, solving univariate polynomials, solving systems of multivariate polynomials. It is assumed that the input has integer coefficients and is not on the degenerate locus of the respective problem (i.e. the condition number is finite). Then condition numbers are bounded in terms of the dimension and of the bit-size of the input. In the same setting, bounds are given for the speed of convergence of the following iterative algorithms: QR without shift for the symmetric eigenvalue problem, and Graeffe iteration for univariate polynomials.


Explicit bounds are derived for the condition numbers associated to linear equation solving, least squares problems, nonsymmetric eigenvalue problems, solving univariate polynomials, and solving systems of multivariate polynomials. These results are applied to find bounds for the speed of convergence of QR iteration without shift for the symmetric eigenvalue problems and Graeffe iteration for solving univariate polynomials as well.





Describes a project that uses

Uses Software






This page was built for publication: Condition number bounds for problems with integer coefficients

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1594828)