{"title":"磁场计算中积分和边界元方程的多分辨率算法","authors":"J.C. Yang, K. Shao, H. Yu, J. Lavers","doi":"10.1109/INTMAG.1999.837673","DOIUrl":null,"url":null,"abstract":"Wavelet algorithm far integral equations was first studied in [I] . In magwetic field computations, previously plblished p a p utilized the standard scheme to gel a dense ma& and then applied the fast wavelet vansfonii to appvimate it to a sparse one. Therefore, one have to allccate extra metnon for the transformed matrix. Mnmver, the t r d d mabix did not appear to have beuer condition number lhan the original one. In this paper, we use wavelet functions as bath basis functions and weight funnions. It is a reasonable trade-olf between tbe entire domain and subsstiM basis functions. The whole dornais may be divided iiib several subsections, while in each subsection the higher resolution basis is incorporated, whsch preserve the merits of entire domain basis functions. A sparse matrix thus is derived","PeriodicalId":425017,"journal":{"name":"IEEE International Magnetics Conference","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multiresolution algorithm for integral and boundary element equations in magnetic field computations\",\"authors\":\"J.C. Yang, K. Shao, H. Yu, J. Lavers\",\"doi\":\"10.1109/INTMAG.1999.837673\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Wavelet algorithm far integral equations was first studied in [I] . In magwetic field computations, previously plblished p a p utilized the standard scheme to gel a dense ma& and then applied the fast wavelet vansfonii to appvimate it to a sparse one. Therefore, one have to allccate extra metnon for the transformed matrix. Mnmver, the t r d d mabix did not appear to have beuer condition number lhan the original one. In this paper, we use wavelet functions as bath basis functions and weight funnions. It is a reasonable trade-olf between tbe entire domain and subsstiM basis functions. The whole dornais may be divided iiib several subsections, while in each subsection the higher resolution basis is incorporated, whsch preserve the merits of entire domain basis functions. A sparse matrix thus is derived\",\"PeriodicalId\":425017,\"journal\":{\"name\":\"IEEE International Magnetics Conference\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-05-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE International Magnetics Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INTMAG.1999.837673\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE International Magnetics Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INTMAG.1999.837673","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Multiresolution algorithm for integral and boundary element equations in magnetic field computations
Wavelet algorithm far integral equations was first studied in [I] . In magwetic field computations, previously plblished p a p utilized the standard scheme to gel a dense ma& and then applied the fast wavelet vansfonii to appvimate it to a sparse one. Therefore, one have to allccate extra metnon for the transformed matrix. Mnmver, the t r d d mabix did not appear to have beuer condition number lhan the original one. In this paper, we use wavelet functions as bath basis functions and weight funnions. It is a reasonable trade-olf between tbe entire domain and subsstiM basis functions. The whole dornais may be divided iiib several subsections, while in each subsection the higher resolution basis is incorporated, whsch preserve the merits of entire domain basis functions. A sparse matrix thus is derived