THE CHOLESKY METHOD FOR INTERVAL DATA

被引：34

作者：

ALEFELD, G

MAYER, G

机构：

[1] Institut für Angewandte Mathematik Universität Karlsruhe, D-76128 Karlsruhe

来源：

LINEAR ALGEBRA AND ITS APPLICATIONS | 1993年 / 194卷

关键词：

D O I：

10.1016/0024-3795(93)90120-D

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We apply the well-known Cholesky method to bound the solutions of linear systems with symmetric matrices and right-hand sides both of which are varying within given intervals. We derive criteria to guarantee the feasibility and the optimality of the method. Furthermore, we discuss some general properties.

引用

页码：161 / 182

页数：22

共 17 条

[1] ON THE CONVERGENCE OF SOME INTERVAL-ARITHMETIC MODIFICATIONS OF NEWTON METHOD
ALEFELD, G
[J]. SIAM JOURNAL ON NUMERICAL ANALYSIS, 1984, 21 (02) : 363 - 372
[2] Alefeld G., 1983, INTRO INTERVAL COMPU
[3] ALEFELD G, 1977, COMPUTING S, V1, P15
[4] [Anonymous], 1958, MONATSH MATH
[5] OPTIMAL SOLUTIONS OF LINEAR INTERVAL SYSTEMS
BARTH, W
[J]. COMPUTING, 1974, 12 (02) : 117 - 125
[6] Berman A, 1979, MATH SCI CLASSICS AP, V9, DOI DOI 10.1137/1.9781611971262
[7] FROMMER A, 1990, LOSUNG LINEARER GLEI
[8] Gantmacher F. R., 1986, MATRIZENTHEORIE
[9] HARTFIEL DJ, 1980, NUMER MATH, V35, P355, DOI 10.1007/BF01396417
[10] MAYER G, 1991, IMACS ANN COMPUT APP, P329

← 1 2 →