Vui lòng dùng định danh này để trích dẫn hoặc liên kết đến tài liệu này: http://10.1.1.57:8888/dspace/handle/hau/5011
Nhan đề: The Evolution of the Minimum Degree Ordering Algorithm
Tác giả: George, Alan
Liu, Joseph W.H.
Từ khoá: sparse matrices
minimum degree algorithm
computational complexity
ordering algorithms
Năm xuất bản: 5/1987
Nhà xuất bản: Society for Industrial and Applied Mathematics
Tóm tắt: Over the past fifteen years, the implementation of the minimum degree algorithm has received much study, and many important enhancements have been made to it. This paper describes these various enhancements, their historical development, and some experiments showing how very effective they are in improving the execution time of the algorithm. A shortcoming is also presented that exists in all of the widely used implementations of the algorithm, namely, that the quality of the ordering provided by the implementations is surprisingly sensitive to the initial ordering. For example, changing the input ordering can lead to an increase (or decrease) of as much as a factor of three in the cost of the subsequent numerical factorization. This sensitivity is caused by the lack of an effective tie-breaking strategy, and the authors’ experiments illustrate the importance of developing such a strategy Copyright © 1989 © Society for Industrial and Applied Mathematics
Định danh: http://10.1.1.57:8080/dspace/handle/hau/5011
ISSN: 0036-1445
1095-7200
Bộ sưu tập: Báo cáo tiếng nước ngoài

Các tập tin trong tài liệu này:
Tập tin Mô tả Kích thước Định dạng  
3.81 MBAdobe PDFXem truc tuyen


Khi sử dụng các tài liệu trong Thư viện số phải tuân thủ Luật bản quyền.