𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A comparative study of algorithms for reducing the fill-in during Cholesky factorization

✍ Scribed by P. J. de Jonge

Publisher
Springer-Verlag
Year
1992
Tongue
English
Weight
756 KB
Volume
66
Category
Article
ISSN
1432-1394

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Decomposed block Cholesky factorization
Decomposed block Cholesky factorization in the Karmarkar algorithm: Solving a class of super large LP problems
✍ M. Torabi πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 361 KB

With the introduction of the Karmarkar algorithm hope for optimally solving "super large" LP problems, often encountered in the communication industry, had risen high. However, a general code of the original Karmarkar algorithm takes a long computation time to solve such problems. Employing proper f

Comparing a new algorithm with the class
Comparing a new algorithm with the classic methods for estimating the number of factors
✍ Ronald C. Henry; Eun Sug Park; Clifford H. Spiegelman πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 80 KB

This paper presents and compares a new algorithm for finding the number of factors in a data analytic model. After we describe the new method, called NUMFACT, we compare it with standard methods for finding the number of factors to use in a model. The standard methods that we compare NUMFACT with ar