메뉴 건너뛰기




Volumn 261, Issue 1-3, 1997, Pages 173-186

Improved bound for rank revealing LU factorizations

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0005540367     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(96)00397-7     Document Type: Article
Times cited : (13)

References (20)
  • 2
    • 0041018232 scopus 로고
    • Structure-preserving and rank-revealing QR-factorizations
    • C. H. Bischof and P. C. Hansen, Structure-preserving and rank-revealing QR-factorizations, SIAM J. Sci. Statist. Comput. 12:1332-1350 (1991).
    • (1991) SIAM J. Sci. Statist. Comput. , vol.12 , pp. 1332-1350
    • Bischof, C.H.1    Hansen, P.C.2
  • 3
    • 84909652504 scopus 로고
    • On the existence and computation of LU-factorizations with small pivots
    • T. F. Chan, On the existence and computation of LU-factorizations with small pivots, Math. Comp. 42:535-547 (1984).
    • (1984) Math. Comp. , vol.42 , pp. 535-547
    • Chan, T.F.1
  • 4
    • 0002170151 scopus 로고
    • Rank revealing QR factorizations
    • T. F. Chan, Rank revealing QR factorizations, Linear Algebra Appl. 88/89:67-82 (1987).
    • (1987) Linear Algebra Appl. , vol.88-89 , pp. 67-82
    • Chan, T.F.1
  • 5
    • 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:727-741 (1992).
    • (1992) SIAM J. Sci. Statist. Comput. , vol.13 , pp. 727-741
    • Chan, T.F.1    Hansen, P.C.2
  • 8
    • 0000628245 scopus 로고
    • The probability of large diagonal elements in the QR factorization
    • L. V. Foster, The probability of large diagonal elements in the QR factorization, SIAM J. Sci. Statist. Comput. 11:531-544 (1990).
    • (1990) SIAM J. Sci. Statist. Comput. , vol.11 , pp. 531-544
    • Foster, L.V.1
  • 9
    • 0000924593 scopus 로고
    • Numerical methods for solving linear least squares problems
    • G. H. Golub, Numerical methods for solving linear least squares problems, Numer. Math. 7:206-216 (1965).
    • (1965) Numer. Math. , vol.7 , pp. 206-216
    • Golub, G.H.1
  • 12
    • 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:213-232 (1992).
    • (1992) Math. Comp. , vol.58 , pp. 213-232
    • Hong, Y.P.1    Pan, C.T.2
  • 14
    • 0040424114 scopus 로고    scopus 로고
    • An alternate column selection criterion for a rank revealing QR factorization
    • Tech. Rep., BCSTECH-93-021, Boeing Computer Services, submitted for publication
    • T.-M. Hwang, W.-W. Lin, and D. J. Pierce, An Alternate Column Selection Criterion for a Rank Revealing QR factorization, Tech. Rep., BCSTECH-93-021, Boeing Computer Services, Math Comp., submitted for publication.
    • Math Comp.
    • Hwang, T.-M.1    Lin, W.-W.2    Pierce, D.J.3
  • 15
    • 0001151327 scopus 로고
    • The bordering algorithm and path following near singular points of high nullity
    • H. B. Keller, The bordering algorithm and path following near singular points of high nullity, SIAM J. Sci. Statist. Comput. 4:573-582 (1983).
    • (1983) SIAM J. Sci. Statist. Comput. , vol.4 , pp. 573-582
    • Keller, H.B.1
  • 17
    • 0039239789 scopus 로고
    • Tech. Rep. MEA-TR-193-REVISED, Boeing Computer Services
    • D. J. Pierce and J. G. Lewis, Sparse Rank Revealing QR Factorization, Tech. Rep. MEA-TR-193-REVISED, Boeing Computer Services, 1995; SIAM J. Matrix Anal. Appl., submitted for publication.
    • (1995) Sparse Rank Revealing QR Factorization
    • Pierce, D.J.1    Lewis, J.G.2
  • 18
    • 0040424136 scopus 로고    scopus 로고
    • submitted for publication
    • D. J. Pierce and J. G. Lewis, Sparse Rank Revealing QR Factorization, Tech. Rep. MEA-TR-193-REVISED, Boeing Computer Services, 1995; SIAM J. Matrix Anal. Appl., submitted for publication.
    • SIAM J. Matrix Anal. Appl.
  • 19
    • 0026882267 scopus 로고
    • An updating algorithm for subspace tracking
    • G. W. Stewart, An updating algorithm for subspace tracking, IEEE Trans. Signal Process. 40:1535-1541 (1992).
    • (1992) IEEE Trans. Signal Process , vol.40 , pp. 1535-1541
    • Stewart, G.W.1
  • 20
    • 84945709312 scopus 로고
    • Error analysis of direct methods of matrix inversion
    • J. H. Wilkinson, Error analysis of direct methods of matrix inversion, J. Assoc. Comput. Mach. 10:281-330 (1961).
    • (1961) J. Assoc. Comput. Mach. , vol.10 , pp. 281-330
    • Wilkinson, J.H.1


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