Computing the norm ∥A∥∞,1 is NP-hard

Linear and Multilinear Algebra

Volumn 47, Issue 3, 2000, Pages 195-204

  Rohn, Jiří ^a,b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b INSTITUTE OF COMPUTER SCIENCE   (Czech Republic)

Author keywords

M matrix; Norm; NP hardness; Positive definiteness

Indexed keywords

EID: 18244372233     PISSN: 03081087     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (8)

1. Berman, A. and Plemmons, R. J. (1994). Nonnegative Matrices in the Mathematical Sciences. SIAM, Philadelphia.
2. Garey, M. R. and Johnson, D. S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco.
3. Garey, M. R., Johnson, D. S. and Stockmeyer, L. (1976). Some simplified NP-complete graph problems. Theoret. Comp. Sci., 1, 237-267.
4. Golub, G. H. and van Loan, C. F. (1996). Matrix Computations. The Johns Hopkins University Press, Baltimore.
5. Poljak, S. and Rohn, J. (1993). Checking robust nonsingularity is NP-hard. Math. Control Signals Systems, 6, 1-9.
6. Rohn, J. (1997). Complexity of some linear problems with interval data. Reliable Computing, 3, 315-323.
7. Rohn, J. (1994). Checking positive definiteness or stability of symmetric interval matrices is NP-hard. Comment. Math. Univ. Carolin., 35, 795-797.
8. Tao, P. D. (1984). Algorithmes de calcul du maximum des formes quadratiques sur la boule unité de la norme du maximum. Numer. Math., 45, 377-401.