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.
Recommendations
- A necessary and sufficient criterion to guarantee feasibility of the interval Gaussian algorithm for a class of matrices
- A contribution to the feasibility of the interval Gaussian algorithm
- On the applicability of the interval Gaussian algorithm
- A New Criterion to Guarantee the Feasibility of the Interval Gaussian Algorithm
- scientific article; zbMATH DE number 5296963
- An approximate inverse matrix technique for arrowhead matrices
- scientific article; zbMATH DE number 1639655
- Publication:4865662
- Stable computation of Gaussian interpolants -- a heuristic approach
Cited in
(5)- An efficient method for computing the inverse of arrowhead matrices
- scientific article; zbMATH DE number 1639655 (Why is no real title available?)
- A necessary and sufficient criterion to guarantee feasibility of the interval Gaussian algorithm for a class of matrices
- A contribution to the feasibility of the interval Gaussian algorithm
- Direct methods for linear systems with inexact input data
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)