Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 한정림 | - |
dc.creator | 한정림 | - |
dc.date.accessioned | 2016-08-25T04:08:37Z | - |
dc.date.available | 2016-08-25T04:08:37Z | - |
dc.date.issued | 1995 | - |
dc.identifier.other | OAK-000000022807 | - |
dc.identifier.uri | https://dspace.ewha.ac.kr/handle/2015.oak/180534 | - |
dc.identifier.uri | http://dcollection.ewha.ac.kr/jsp/common/DcLoOrgPer.jsp?sItemId=000000022807 | - |
dc.description.abstract | We 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.tableofcontents | ABSTRACT = 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.format | application/pdf | - |
dc.format.extent | 636398 bytes | - |
dc.language | eng | - |
dc.publisher | 이화여자대학교 대학원 | - |
dc.subject | NUMERICAL | - |
dc.subject | METHODS | - |
dc.subject | SINGULAR | - |
dc.subject | VALUE DECOMPOSITION | - |
dc.title | NUMERICAL METHODS FOR SINGULAR VALUE DECOMPOSITION | - |
dc.type | Master's Thesis | - |
dc.format.page | 27 p. | - |
dc.identifier.thesisdegree | Master | - |
dc.identifier.major | 대학원 수학과 | - |
dc.date.awarded | 1996. 2 | - |