The feasibility of the interval Gaussian algorithm for arrowhead matrices

From MaRDI portal





An arrowhead interval matrix is defined as a quadratic matrix which only has nonzero interval entries in the main diagonal, in the last line, and in the last column. It is shown that the application of the interval Gauss algorithm without pivoting is feasible for such a matrix iff the main diagonal entries do not contain zero.











This page was built for publication: The feasibility of the interval Gaussian algorithm for arrowhead matrices

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