Condition number bounds for problems with integer coefficients (Q1594828)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1558134
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Condition number bounds for problems with integer coefficients |
scientific article; zbMATH DE number 1558134 |
Statements
Condition number bounds for problems with integer coefficients (English)
0 references
5 July 2001
0 references
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.
0 references
condition numbers
0 references
linear equation
0 references
least squares problems
0 references
eigenvalue problems
0 references
systems of multivariate polynomials
0 references
convergence
0 references
QR iteration
0 references
Graeffe iteration
0 references
0.8106917142868042
0 references
0.7713491320610046
0 references
0.7686769962310791
0 references
0.7670270204544067
0 references
0.7668241858482361
0 references
