Conjugate directions method for solving interval linear systems

DOI10.1023/A:1019149111226zbMATH Open0939.65054MaRDI QIDQ1817779FDOQ1817779

Yanyan Li

Publication date: 10 July 2000

Published in: Numerical Algorithms (Search for Journal in Brave)

zbMATH Keywords

quadratic programmingconjugate gradient methodsteepest descent methodlinear interval systems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Iterative numerical methods for linear systems (65F10) Interval and finite arithmetic (65G30)

Cited In (3)

• Inner and outer estimations of the generalized solution sets and an application in economic
• The cone method for solving linear systems
• The interval versions of the Kalman filter and the EM algorithm

   Recommendations

• Interval linear systems: the state of the art 👍 👎
• Title not available (Why is that?) 👍 👎
• An iterative method for algebraic solution to interval equations 👍 👎
• Conjugate gradient method for fuzzy symmetric positive definite system of linear equations 👍 👎

This page was built for publication: Conjugate directions method for solving interval linear systems

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