메뉴 건너뛰기




Volumn 11, Issue 5, 1997, Pages 393-401

A fast non-negativity-constrained least squares algorithm

Author keywords

Multiway; NNLS; Non negativity; PARAFAC

Indexed keywords

DECOMPOSITION METHODS; ITERATIVE METHODS; REGRESSION ANALYSIS;

EID: 0642334046     PISSN: 08869383     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1099-128X(199709/10)11:5<393::AID-CEM483>3.0.CO;2-L     Document Type: Article
Times cited : (796)

References (23)
  • 8
    • 0003476369 scopus 로고
    • Prentice-Hall, Englewood Cliffs, NJ
    • C. L. Lawson and R. J. Hanson, Solving Least Squares Problems, Prentice-Hall, Englewood Cliffs, NJ (1974); also available as Classics in Applied Mathemaatics, Vol. 15, SIAM, Philadelphia, PA (1995).
    • (1974) Solving Least Squares Problems
    • Lawson, C.L.1    Hanson, R.J.2
  • 9
    • 85153974882 scopus 로고
    • SIAM, Philadelphia, PA
    • C. L. Lawson and R. J. Hanson, Solving Least Squares Problems, Prentice-Hall, Englewood Cliffs, NJ (1974); also available as Classics in Applied Mathemaatics, Vol. 15, SIAM, Philadelphia, PA (1995).
    • (1995) Classics in Applied Mathemaatics , vol.15
  • 22
    • 85153992257 scopus 로고    scopus 로고
    • Food Technology, Department of Dairy and Food Science, Royal Veterinary and Agricultural University, Frederiksberg
    • C. A. Andersson, Internal Rep., Food Technology, Department of Dairy and Food Science, Royal Veterinary and Agricultural University, Frederiksberg (1996).
    • (1996) Internal Rep.
    • Andersson, C.A.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.