ACM Home Page
Please provide us with feedback. Feedback
Algorithm 695: software for a new modified Cholesky factorization
Full text PdfPdf (462 KB)
Source ACM Transactions on Mathematical Software (TOMS) archive
Volume 17 ,  Issue 3  (September 1991) table of contents
Pages: 306 - 312  
Year of Publication: 1991
ISSN:0098-3500
Authors
Elizabeth Eskow  Univ. of Colorado, Boulder
Robert B. Schnabel  Univ. of Colorado, Boulder
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 42,   Citation Count: 2
Additional Information:

appendices and supplements   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/114697.116806
What is a DOI?

APPENDICES and SUPPLEMENTS
gZip695.gz (7 KB)
modified cholesky factorization
Gams: d2b1a, d2b1


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
 
2
GmL, P. E., AND MURRAY, W Newton-type methods for unconstrained and linearly constrained optimization. Math. Program. 7, 3 (Dec 1974), 311-350
 
3
GmL, P. E., MURRAY, W., AND WmGHT, M. H. Practical Optimization. Academic Press, London, 1981.
 
4
GOULD, N. Private communication, 1989.
 
5
SCHNABEL, R B., AND ESKOW, E.A. New modified Cholesky factorization. Univ. of Colorado Dept. of Computer Science Tech. Rep. CU-CS-415-88. To appear in SIAM J. Sci. Stat. Comput.


Collaborative Colleagues:
Elizabeth Eskow: colleagues
Robert B. Schnabel: colleagues

Peer to Peer - Readers of this Article have also read: