Open AccessNew Criteria for the Feasibility of the Cholesky Method with Interval Data
Author(s) -
G. Alefeld,
G. Mayer
Publication year - 2008
Publication title -
siam journal on matrix analysis and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.268
H-Index - 101
eISSN - 1095-7162
pISSN - 0895-4798
DOI - 10.1137/070711232
Subject(s) - cholesky decomposition , interval (graph theory) , mathematics , minimum degree algorithm , gaussian , interval data , incomplete cholesky factorization , algorithm , mathematical optimization , combinatorics , computational chemistry , eigenvalues and eigenvectors , physics , chemistry , quantum mechanics , data envelopment analysis
We present some new criteria for the feasibility of the interval Cholesky method. In particular, we relate this feasibility to that of the interval Gaussian algorithm.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom