메뉴 건너뛰기




Volumn 42, Issue 3-4, 2005, Pages 227-241

A Lanczos-like reduction of symmetric structured matrices to semiseparable form

Author keywords

[No Author keywords available]

Indexed keywords

% REDUCTIONS; LANCZOS; MATRIX; STRUCTURED-MATRICES; SYMMETRIC MATRICES; SYMMETRICS;

EID: 33846366357     PISSN: 00080624     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10092-005-0109-x     Document Type: Article
Times cited : (3)

References (23)
  • 2
    • 0031071241 scopus 로고    scopus 로고
    • Inversion formulas and linear complexity algorithm for diagonal plus semiseparable matrices
    • Eidelman, Y., Gohberg, I.: Inversion formulas and linear complexity algorithm for diagonal plus semiseparable matrices. Comput. Math. Appl. 33(4), 69-79 (1997)
    • (1997) Comput. Math. Appl. , vol.33 , Issue.4 , pp. 69-79
    • Eidelman, Y.1    Gohberg, I.2
  • 3
    • 4043086344 scopus 로고    scopus 로고
    • Direct and inverse eigenvalue problems for diagonal-plus-semiseparable matrices
    • Fasino, D., Gemignani, L.: Direct and inverse eigenvalue problems for diagonal-plus-semiseparable matrices. Numer. Algorithms 34, 313-324 (2003)
    • (2003) Numer. Algorithms , vol.34 , pp. 313-324
    • Fasino, D.1    Gemignani, L.2
  • 4
    • 20344372250 scopus 로고    scopus 로고
    • Fast and stable algorithms for reducing diagonal plus semiseparable matrices to tridiagonal and bidiagonal form
    • Olshevsky, V. (ed.). Providence, RI: Amer. Math. Soc.
    • Fasino, D., Mastronardi, N., Van Barel, M.: Fast and stable algorithms for reducing diagonal plus semiseparable matrices to tridiagonal and bidiagonal form. In: Olshevsky, V. (ed.): Fast algorithms for structured matrices: theory and applications. (Contemp. Math. 323). Providence, RI: Amer. Math. Soc. 2003, pp. 105-118
    • (2003) Fast Algorithms for Structured Matrices: Theory and Applications. (Contemp. Math. 323) , pp. 105-118
    • Fasino, D.1    Mastronardi, N.2    Van Barel, M.3
  • 10
    • 0013420838 scopus 로고    scopus 로고
    • Fast and stable algorithms for reduction diagonal plus semi-separable matrices to tridiagonal and bidiagonal form
    • Mastronardi, N., Chandrasekaran, S., Van Huffel, S.: Fast and stable algorithms for reduction diagonal plus semi-separable matrices to tridiagonal and bidiagonal form. BIT 41, 149-157 (2001)
    • (2001) BIT , vol.41 , pp. 149-157
    • Mastronardi, N.1    Chandrasekaran, S.2    Van Huffel, S.3
  • 13
    • 84968487118 scopus 로고
    • The Lanczos algorithm with selective orthogonalization
    • Parlett, B.N., Scott, D.S.: The Lanczos algorithm with selective orthogonalization. Math. Comp. 33, 217-238 (1979)
    • (1979) Math. Comp. , vol.33 , pp. 217-238
    • Parlett, B.N.1    Scott, D.S.2
  • 14
    • 84968519566 scopus 로고
    • The Lanczos algorithm with partial reorthogonalization
    • Simon, H.D.: The Lanczos algorithm with partial reorthogonalization. Math. Comp. 42, 115-142 (1984)
    • (1984) Math. Comp. , vol.42 , pp. 115-142
    • Simon, H.D.1
  • 15
    • 0000682936 scopus 로고
    • Analysis of the symmetric Lanczos algorithm with reorthogonalization methods
    • Simon, H.D.: Analysis of the symmetric Lanczos algorithm with reorthogonalization methods. Linear Algebra Appl. 61, 101-131 (1984)
    • (1984) Linear Algebra Appl. , vol.61 , pp. 101-131
    • Simon, H.D.1
  • 16
    • 0034510473 scopus 로고    scopus 로고
    • Low-rank matrix approximation using the Lanczos bidiagonalization process with applications
    • Simon, H.D., Zha, H.: Low-rank matrix approximation using the Lanczos bidiagonalization process with applications. SIAM J. Sci. Comput. 21, 2257-2274 (2000)
    • (2000) SIAM J. Sci. Comput. , vol.21 , pp. 2257-2274
    • Simon, H.D.1    Zha, H.2
  • 18
    • 0020189061 scopus 로고
    • Estimation of frequencies of multiple sinusoids: Making linear prediction perform like maximum likelihood
    • Tufts, D.W., Kumaresan, R.: Estimation of frequencies of multiple sinusoids: making linear prediction perform like maximum likelihood. Proc. IEEE 70, 975-989 (1982)
    • (1982) Proc. IEEE , vol.70 , pp. 975-989
    • Tufts, D.W.1    Kumaresan, R.2
  • 19
    • 33144489927 scopus 로고    scopus 로고
    • An orthogonal similarity reduction of a matrix into semiseparable form
    • Van Barel, M., Vandebril, R., Mastronardi, N.: An orthogonal similarity reduction of a matrix into semiseparable form. SIAM J. Matrix Anal. Appl. 27, 176-197 (2005)
    • (2005) SIAM J. Matrix Anal. Appl. , vol.27 , pp. 176-197
    • Van Barel, M.1    Vandebril, R.2    Mastronardi, N.3
  • 21
    • 11144351655 scopus 로고    scopus 로고
    • A QR-method for computing the singular values via semiseparable matrices
    • Vandebril, R., Van Barel, M., Mastronardi, N.: A QR-method for computing the singular values via semiseparable matrices. Numer. Math. 99, 163-195 (2004)
    • (2004) Numer. Math. , vol.99 , pp. 163-195
    • Vandebril, R.1    Van Barel, M.2    Mastronardi, N.3
  • 22
    • 26644435288 scopus 로고    scopus 로고
    • A note on the representation and definition of semiseparable matrices
    • Vandebril, R., Van Barel, M., Mastronardi, N.: A note on the representation and definition of semiseparable matrices. Numer. Linear Algebra Appl. 12, 839-858 (2005)
    • (2005) Numer. Linear Algebra Appl. , vol.12 , pp. 839-858
    • Vandebril, R.1    Van Barel, M.2    Mastronardi, N.3


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