| Autor: |
Porte, M., Vignes, J. |
| Zdroj: |
Numerische Mathematik; 1974, Vol. 23 Issue 1, p73-81, 9p |
| Abstrakt: |
The detection of matrix singularity by a numerical method is not easily accomplished on account of the finite precision of computer arithmetic. In this paper we present a numerical method which determines a value C for the ≪degree of conditioning≫ of a matrix. This value is C=0 for a singular matrix and has progressively larger values for matrices which are increasingly well-conditioned. This value is C=C ( C defined by the precision of the computer) when the matrix is perfectly well-conditioned. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
Full text from SpringerLink