Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 강서연 | - |
dc.creator | 강서연 | - |
dc.date.accessioned | 2016-08-25T04:08:20Z | - |
dc.date.available | 2016-08-25T04:08:20Z | - |
dc.date.issued | 1996 | - |
dc.identifier.other | OAK-000000022823 | - |
dc.identifier.uri | https://dspace.ewha.ac.kr/handle/2015.oak/180673 | - |
dc.identifier.uri | http://dcollection.ewha.ac.kr/jsp/common/DcLoOrgPer.jsp?sItemId=000000022823 | - |
dc.description.abstract | 비선형 최소 자승 문제들은 공학, 환경, 지구 물리학 등과 같은 많은 응용 분야에 있어서 나타난다. 그 문제는 종종 물리 현상을 묘사하는 선형 체계 안에서 ill-conditioned 행렬을 포함한다. 이 논문에서는 ill-conditioned 행렬을 찾는 선형체계를 푸는 법에 대하여 연구한다. 우리는 새로운 알고리즘을 제시하고, Elden의 접근방식[4]과 비교한다.;Nonlinear least Squares problems arise in many applications such as engineering, environment, geophysics. The problems often include ill-conditioned matrix in their linear systems describing the physical phenomenon. We study to solve the linear systems with ill-conditioned matrix. New algorithms are given and compared with Elden's〔4〕 approach. | - |
dc.description.tableofcontents | CONTENTS Abstract = ⅰ § 1. Basic Definitions, Notations and Backgrounds = 1 § 2. Elden´s Algorithms = 6 2.1 R1 and R2 methods = 7 2.2 Transformation into standardform = 9 2.3 Algorithms for R1 and R2 in standardform = 16 § 3. Proposed Algorithm = 23 3.1 Process of Matrix factorization = 23 3.2 Stability of Proposed Algorithm = 24 § 4. Numerical Results = 28 References = 31 논문초록 = 33 | - |
dc.format | application/pdf | - |
dc.format.extent | 931021 bytes | - |
dc.language | eng | - |
dc.publisher | 이화여자대학교 대학원 | - |
dc.subject | Ill-posed Problems | - |
dc.subject | Algorithms | - |
dc.subject | Matrix Factorization Techniques | - |
dc.title | Algorithms using Matrix Factorization Techniques for Soving Ill-posed Problems | - |
dc.type | Master's Thesis | - |
dc.format.page | i, 33 p. | - |
dc.identifier.thesisdegree | Master | - |
dc.identifier.major | 대학원 수학과 | - |
dc.date.awarded | 1996. 8 | - |