View : 521 Download: 0

Full metadata record

DC Field Value Language
dc.contributor.author한정림-
dc.creator한정림-
dc.date.accessioned2016-08-25T04:08:37Z-
dc.date.available2016-08-25T04:08:37Z-
dc.date.issued1995-
dc.identifier.otherOAK-000000022807-
dc.identifier.urihttps://dspace.ewha.ac.kr/handle/2015.oak/180534-
dc.identifier.urihttp://dcollection.ewha.ac.kr/jsp/common/DcLoOrgPer.jsp?sItemId=000000022807-
dc.description.abstractWe compare the Block-Lanczos and the Davidson methods for computing a basis of a singular subspace associated with the smallest singular values of large matrices. In numerical experiments, we apply a large sparse matrix for the Block-Lanczos' and the Davidson's method.;Large matrix의 몇개의 가장 작은 singular value들과, 관련된 singular 부분공간의 기저를 계산하는데 있어서 Block-Lanczos 방법과 Davidson 방법을 비교한다. 실제로, large sparse 행렬을 Block-Lanczos 방법과 Davidson 방법에 적용시켜 본다.-
dc.description.tableofcontentsABSTRACT = 1 CONTENTS = 2 1. INTRODUCTION = 3 2. Block Lanczos method = 6 2.1 Block Bidiagonalization Algorithm = 7 2.2 2.2 Error Bounds For The Singular-Value Approximations = 11 3. Davidson method = 15 3.1 Algorithm = 15 3.2 Choice of preconditioning = 16 4. Numerical Algorithms and Example = 19 REFERENCE = 25 논문초록 = 27-
dc.formatapplication/pdf-
dc.format.extent636398 bytes-
dc.languageeng-
dc.publisher이화여자대학교 대학원-
dc.subjectNUMERICAL-
dc.subjectMETHODS-
dc.subjectSINGULAR-
dc.subjectVALUE DECOMPOSITION-
dc.titleNUMERICAL METHODS FOR SINGULAR VALUE DECOMPOSITION-
dc.typeMaster's Thesis-
dc.format.page27 p.-
dc.identifier.thesisdegreeMaster-
dc.identifier.major대학원 수학과-
dc.date.awarded1996. 2-
Appears in Collections:
일반대학원 > 수학과 > Theses_Master
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

BROWSE