|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
BAUER, F L On the definition of condition numbers and their relation to closed methods for solving linear systems lnformanon Processmg, Proc Int Conf Inform Processing, Unesco Paris, June 1959, Butterworth, London, 1960, pp 109-110
|
| |
2
|
BAUER, F L Optimally scaled matrices Numer Math 5 (1963), 78-87
|
| |
3
|
BAUER, F L Genamgkeitsfragen bel der Losung hnearer Gleichungssysteme ZAMM 46, 7 (Nov 1966), 409- 421
|
| |
4
|
BAUER, F L Computational graphs and rounding error SlAM J Numer Anal 11, I (Mar 1974), 87-96
|
| |
5
|
CURTIS, A R, AND REID, J K On the automatic scahng of mamces for Gausslan elimination J Inst Math Apphc 10, 1 (Aug 1972), 118-124
|
| |
6
|
FORSYTHE, G E, AND MOLER, C B Computer Solution of LmearAlgebralc Systems Prentice-Hall, Englewood Chffs, N J, 1967
|
| |
7
|
FORSYTHE, G E, AND STRAUS, E G On best conditioned matrices Proc Amer Math Soc 6 (1955), 340- 345
|
| |
8
|
GEAR, C W Numerical errors m sparse hnear equations File F-75-885, Dept Compt So, U of llhnols at Urbana-Champaign, Urbana, I11, May 1975
|
| |
9
|
|
| |
10
|
JANKOWSKI, M, AND WOZNIAKOWSKI, M lterattve refinement tmphes numerical stability BIT 17 (1977), 303-311
|
| |
11
|
KAHAN, W Numerical linear algebra Canad Math Bull 9 (1966), 757-801
|
| |
12
|
MILLER, W Automatic a priori round-off analysis, I Computing 10 (1972), 97-106
|
| |
13
|
MILLER, W On the stability of fimte numerical procedures Numer Math 19 (1972), 425-432
|
 |
14
|
|
| |
15
|
MILLER, W Roundoff analysis by direct comparison of two algorithms SIAM J Numer Anal 13, 3 (June 1976), 382-392
|
| |
16
|
MILLER. W Roundoff analyses and sparse data Numer Math 29, 1 (1977), 37-43
|
| |
17
|
OETTLI, W, AND PRAGER, W Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides Numer Math 6 (1964), 405-409
|
 |
18
|
|
| |
19
|
SHERMAN, A.H. Algorithms for sparse Gaussian elimination with partial pivoting Rep. R-76-817, Dept. Comput. Sci., U. of llhnois at Urbana-Champaign, Urbana, II1., July 1976
|
| |
20
|
SKEEL, R.D. Iterative refinement implies numerical stability for Gausslan ehmmation Manuscript, Dept. Comptr. Scl, U. of Illinois at Urbana-Champalgn, Urbana, Ill., July 1978 Submitted to a technical journal.
|
| |
21
|
STEWART, G W lntroductwn to Matrix Computations Academic Press, New York, 1973
|
| |
22
|
VAt~ PEg SLUIS, A Stability of solutions ofhnear algebraic systems Numer Math. 14 (1970), 246-251
|
| |
23
|
VAN DES SLUIS, A Condition, equilibration, and pivoting in linear algebraic systems Numer Math 15 (1970), 74-86
|
| |
24
|
|
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE conference on Design automation
Gwo-Dong Chen
, Daniel D. Gajski
|