Prestructuring sparse matrices with dense rows and columns via null space methods

E-ISSN： 1099-1506|25|2|nla.2133-nla.2133

ISSN： 1070-5325

Source： NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS (ELECTRONIC), Vol.25, Iss.2, 2018-03, pp. : n/a-n/a

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

Incremental Norm Estimation for Dense and Sparse Matrices

By Duff I.S.

Bit Numerical Mathematics, Vol. 42, Iss. 2, 2002-01 ,pp. : 300-322

Springer Publishing Company

Access to resources Recommend Favorite

On the upper bounds of the minimum number of rows of disjunct matrices

By Cheng Yongxi

Optimization Letters, Vol. 3, Iss. 2, 2009-03 ,pp. : 297-302

Springer Publishing Company

Access to resources Recommend Favorite

The weighted consecutive ones problem for a fixed number of rows or columns

By Oswald M. Reinelt G.

Operations Research Letters, Vol. 31, Iss. 5, 2003-09 ,pp. : 350-356

Elsevier

Access to resources Recommend Favorite

Block-Projections Algorithms with Blocks Containing Mutually Orthogonal Rows and Columns

By Popa C.

Bit Numerical Mathematics, Vol. 39, Iss. 2, 1999-01 ,pp. : 323-338

Springer Publishing Company

Access to resources Recommend Favorite

The Hilbert Null-cone on Tuples of Matrices and Bilinear Forms

By Bürgin Matthias

Mathematische Zeitschrift, Vol. 254, Iss. 4, 2006-12 ,pp. : 785-809

Springer Publishing Company

Access to resources Recommend Favorite