Skip Navigation

The Computer Journal 1969 12(2):158-159; doi:10.1093/comjnl/12.2.158
© 1969 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (6)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Tewarson, R. P.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

The Crout reduction for sparse matrices

R. P. Tewarson *

State University of New York, Stony Brook, New York, USA

An algorithm is given for minimising the number of non-zero elements created during the forward course of the Crout reduction (no new elements are created in the back substitution). Practical computational techniques for the efficient utilisation of the algorithm are also discussed.

Received September 1968.

* State University of New York, Stony Brook, N.Y. 11790, U.S.A. This research was supported in part by the National Aeronautics and Space Administration, Washington, D.C., Grant No. NGR–33–015–013


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.