The geometry of ill-conditioning (Q1100848): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 01:41, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The geometry of ill-conditioning |
scientific article |
Statements
The geometry of ill-conditioning (English)
0 references
1987
0 references
The problems of finding a solution to a linear system of equations, finding the roots of a polynomial equation, and finding the eigenvalues and eigenvectors of a matrix are considered. The condition number, which limits the accuracy obtainable in the solution, as well as the speed of convergence of certain numerical algorithms, is proportional to the distance of the given problem to the set of degenerate problems. Upper and lower bounds for the probability that a problem chosen at random is within a given distance to the set of degenerate problems are given. Each problem is considered as a vector in an Euclidean space of data vectors, and probabilities are then ratios of volumes of the sets under consideration.
0 references
matrix inversion
0 references
ill-posed problems
0 references
random matrix
0 references
ill-conditioning
0 references
linear system
0 references
roots of a polynomial equation
0 references
eigenvalues
0 references
eigenvectors
0 references
condition number
0 references
speed of convergence
0 references
degenerate problems
0 references
Upper and lower bounds
0 references