메뉴 건너뛰기




Volumn 20, Issue 4, 1999, Pages 1336-1348

QLP approximation to the singular value decomposition

Author keywords

[No Author keywords available]

Indexed keywords

HOUSEHOLDER TRANSFORMATIONS; PIVOTED ORTHOGONAL TRIANGULARIZATION; RANK DETERMINATION; SINGULAR VALUE DECOMPOSITION;

EID: 0033279732     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1064827597319519     Document Type: Article
Times cited : (74)

References (11)
  • 1
    • 84946063031 scopus 로고
    • An improved algorithm for computing the singular value decomposition
    • T. F. CHAN, An improved algorithm for computing the singular value decomposition, ACM Trans. Math. Software, 8 (1982), pp. 72-83.
    • (1982) ACM Trans. Math. Software , vol.8 , pp. 72-83
    • Chan, T.F.1
  • 2
    • 0002170151 scopus 로고
    • Rank revealing QR factorizations
    • T. F. CHAN, Rank revealing QR factorizations, Linear Algebra Appl., 88/89 (1987), pp. 67-82.
    • (1987) Linear Algebra Appl. , vol.88-89 , pp. 67-82
    • Chan, T.F.1
  • 3
    • 0001138266 scopus 로고
    • Computing truncated singular value decomposition least squares solutions by rank revealing QR-factorizations
    • T. F. CHAN AND P. C. HANSEN, Computing truncated singular value decomposition least squares solutions by rank revealing QR-factorizations, SIAM J. Sci. Statist. Comput., 11 (1990), pp. 519-530.
    • (1990) SIAM J. Sci. Statist. Comput. , vol.11 , pp. 519-530
    • Chan, T.F.1    Hansen, P.C.2
  • 4
    • 0001326391 scopus 로고
    • Some applications of the rank revealing QR factorization
    • T. F. CHAN AND P. C. HANSEN, Some applications of the rank revealing QR factorization. SIAM J. Sci. Statist. Comput., 13 (1992), pp. 727-741.
    • (1992) SIAM J. Sci. Statist. Comput. , vol.13 , pp. 727-741
    • Chan, T.F.1    Hansen, P.C.2
  • 6
    • 0000924593 scopus 로고
    • Numerical methods for solving least squares problems
    • G. H. GOLUB, Numerical methods for solving least squares problems, Numer. Math., 7 (1965), pp. 206-216.
    • (1965) Numer. Math. , vol.7 , pp. 206-216
    • Golub, G.H.1
  • 7
    • 0003216822 scopus 로고    scopus 로고
    • Efficient algorithms for computing a strong rank-revealing QR-factorization
    • M. GU AND S. C. EISENSTAT, Efficient algorithms for computing a strong rank-revealing QR-factorization, SIAM J. Sci. Comput., 17 (1996), pp. 848-869.
    • (1996) SIAM J. Sci. Comput. , vol.17 , pp. 848-869
    • Gu, M.1    Eisenstat, S.C.2
  • 8
    • 84968501766 scopus 로고
    • Rank-revealing QR factorizations and the singular value decomposition
    • Y. P. HONG AND C.-T. PAN, Rank-revealing QR factorizations and the singular value decomposition, Math. Comp., 58 (1992), pp. 213-232.
    • (1992) Math. Comp. , vol.58 , pp. 213-232
    • Hong, Y.P.1    Pan, C.-T.2
  • 9
    • 0343491909 scopus 로고    scopus 로고
    • A new method for linear ill-posed problems with double use of the QR-decomposition
    • Kalamazoo, MI
    • Y. HOSODA, A new method for linear ill-posed problems with double use of the QR-decomposition, paper presented at the Kalamazoo Symposium on Matrix Analysis and Applications, Kalamazoo, MI, 1997.
    • (1997) Kalamazoo Symposium on Matrix Analysis and Applications
    • Hosoda, Y.1
  • 10
    • 0038876113 scopus 로고
    • A block QR algorithm and the singular value decomposition
    • R. MATHIAS AND G. W. STEWART, A block QR algorithm and the singular value decomposition, Linear Algebra Appl., 182 (1993), pp. 91-100.
    • (1993) Linear Algebra Appl. , vol.182 , pp. 91-100
    • Mathias, R.1    Stewart, G.W.2


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