Computing Row and Column Counts for Sparse QR and LU Factorization

Author： Gilbert J.  

Publisher： Springer Publishing Company

ISSN： 0006-3835

Source： Bit Numerical Mathematics, Vol.41, Iss.4, 2001-09, pp. : 693-710

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On the row merge tree for sparse LU factorization with partial pivoting

By Grigori L.  

Bit Numerical Mathematics, Vol. 47, Iss. 1, 2007-03 ,pp. : 45-76

Springer Publishing Company

Access to resources Recommend Favorite

Computing generalized inverses using LU factorization of matrix product

By Stanimirovic Predrag   Tasic Milan  

International Journal of Computer Mathematics, Vol. 85, Iss. 12, 2008-12 ,pp. : 1865-1878

Taylor & Francis Ltd

Access to resources Recommend Favorite

Efficient Sparse LU Factorization with Left-Right Looking Strategy on Shared Memory Multiprocessors

By Schenk O.  

Bit Numerical Mathematics, Vol. 40, Iss. 1, 2000-01 ,pp. : 158-176

Springer Publishing Company

Access to resources Recommend Favorite

Regularization Using QR Factorization and the Estimation of the Optimal Parameter

By Kitagawa T.  

Bit Numerical Mathematics, Vol. 41, Iss. 5, 2001-12 ,pp. : 1049-1058

Springer Publishing Company

Access to resources Recommend Favorite

Improved rigorous perturbation bounds for the LU and QR factorizations

By  

NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS (ELECTRONIC), Vol. 22, Iss. 6, 2015-12 ,pp. : 1115-1130

John Wiley & Sons Inc

Access to resources Recommend Favorite