Conjugate directions method for solving interval linear systems
type: Item
instance of: scholarly article
title: Conjugate directions method for solving interval linear systems
zbMATH Open document ID: 0939.65054
DOI: 10.1023/A:1019149111226
author: Yanyan Li
published in: Numerical Algorithms
publication date: 2000-07-10T00:00:00Z
review text: Linear interval systems \(Ax=b\) are considered where \(A\) is a symmetric positive definite \(n\times n\) interval matrix and \(b\) is an \(n\)-dimensional interval vector. Instead of solving \(Ax=b\) directly it is intended to minimize the quadratic objective function \(x^TAx- 2x^Tb\). First, the steepest-descent method and then the conjugate gradient method are used to solve the minimization problem.
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 65G30
zbMATH DE Number: 1382955
zbMATH Keywords: quadratic programming
zbMATH Keywords: linear interval systems
zbMATH Keywords: steepest descent method
zbMATH Keywords: conjugate gradient method
reviewed by: H. Ratschek
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1382955