메뉴 건너뛰기




Volumn 15, Issue 1, 1997, Pages 37-55

Low-rank revealing UTV decompositions

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0005617538     PISSN: 10171398     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1019254318361     Document Type: Article
Times cited : (44)

References (17)
  • 1
    • 0001107873 scopus 로고
    • Improved algorithm for noniterative time-domain model fitting to exponentially damped magnetic resonance signals
    • H. Barkhuijsen, R. De Beer and D. Van Ormondt, Improved algorithm for noniterative time-domain model fitting to exponentially damped magnetic resonance signals, J. Magnetic Resonance 30 (1987) 553-557.
    • (1987) J. Magnetic Resonance , vol.30 , pp. 553-557
    • Barkhuijsen, H.1    De Beer, R.2    Van Ormondt, D.3
  • 3
    • 21344449496 scopus 로고    scopus 로고
    • Low-rank orthogonal decompositions for information retrieval applications
    • M.W. Berry and R.D. Fierro, Low-rank orthogonal decompositions for information retrieval applications, Num. Lin. Alg. Appl. 3 (1996) 301-327.
    • (1996) Num. Lin. Alg. Appl. , vol.3 , pp. 301-327
    • Berry, M.W.1    Fierro, R.D.2
  • 5
    • 84985405500 scopus 로고
    • Low-rank revealing QR factorizations
    • T.F. Chan and P.C. Hansen, Low-rank revealing QR factorizations, Num. Lin. Alg. Appl. 1 (1994) 33-44.
    • (1994) Num. Lin. Alg. Appl. , vol.1 , pp. 33-44
    • Chan, T.F.1    Hansen, P.C.2
  • 6
    • 0025474239 scopus 로고
    • Tracking a few extreme singular values and vectors in signal processing
    • P. Comon and G.H. Golub, Tracking a few extreme singular values and vectors in signal processing, Proc. IEEE 78 (1990) 1337-1343.
    • (1990) Proc. IEEE , vol.78 , pp. 1337-1343
    • Comon, P.1    Golub, G.H.2
  • 7
    • 0030123520 scopus 로고    scopus 로고
    • Fast computation of the principal singular vectors of Toeplitz matrices arising in exponential data modelling
    • L. Eldén and E. Sjöström, Fast computation of the principal singular vectors of Toeplitz matrices arising in exponential data modelling, Signal Processing 50 (1996) 151-164.
    • (1996) Signal Processing , vol.50 , pp. 151-164
    • Eldén, L.1    Sjöström, E.2
  • 8
    • 0030536908 scopus 로고    scopus 로고
    • Perturbation analysis for two-sided (or complete) orthogonal decompositions
    • R.D. Fierro, Perturbation analysis for two-sided (or complete) orthogonal decompositions, SIAM J. Matrix Anal. Appl. 17 (1996) 383-400.
    • (1996) SIAM J. Matrix Anal. Appl. , vol.17 , pp. 383-400
    • Fierro, R.D.1
  • 9
    • 21844498172 scopus 로고
    • Bounding the subspaces from rank-revealing two-sided orthogonal decompositions
    • R.D. Fierro and J.R. Bunch, Bounding the subspaces from rank-revealing two-sided orthogonal decompositions, SIAM J. Matrix Anal. Appl. 16 (1995) 743-759.
    • (1995) SIAM J. Matrix Anal. Appl. , vol.16 , pp. 743-759
    • Fierro, R.D.1    Bunch, J.R.2
  • 10
    • 21844514079 scopus 로고
    • Accuracy of TSVD solutions computed from rank revealing decompositions
    • R.D. Fierro and P.C. Hansen, Accuracy of TSVD solutions computed from rank revealing decompositions, Numer. Math. 70 (1995) 453-471.
    • (1995) Numer. Math. , vol.70 , pp. 453-471
    • Fierro, R.D.1    Hansen, P.C.2
  • 12
    • 0000288016 scopus 로고
    • Calculating the singular values and pseudo-inverse of a matrix
    • Series B
    • G.H. Golub and W. Kahan, Calculating the singular values and pseudo-inverse of a matrix, SIAM J. Numer. Anal. 2 (Series B) (1965) 205-224.
    • (1965) SIAM J. Numer. Anal. , vol.2 , pp. 205-224
    • Golub, G.H.1    Kahan, W.2


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