| ID | 30274 |
| FullText URL | |
| Author |
Fujiwara, Koji
Nakata, Takayoshi
Okamoto, N.
Muramatsu, Kazuhiro
|
| Abstract | In order to reduce the CPU time for the modified Newton-Raphson method which introduces a relaxation factor, the effect of the relaxation factor on the residual of the Galerkin method is examined in detail. It is shown that a relaxation factor which always provides convergent solutions can be easily searched. Various methods of searching for the relaxation factor to be used are compared |
| Keywords | convergence of numerical methods
iterative methods
magnetic fields
relaxation theory
|
| Note | Digital Object Identifier: 10.1109/20.250793
Published with permission from the copyright holder. This is the institute's copy, as published in Magnetics, IEEE Transactions on, Mar 1993, Volume 29, Issue 2, Pages 1962-1965. Publisher URL:http://dx.doi.org/10.1109/20.250793 Copyright © 1993 IEEE. All rights reserved. |
| Published Date | 1992-10-06
|
| Publication Title |
Magnetics
|
| Volume | volume29
|
| Issue | issue2
|
| Start Page | 1962
|
| End Page | 1965
|
| Content Type |
Journal Article
|
| language |
English
|
| Refereed |
True
|
| DOI | |
| Submission Path | electricity_and_magnetism/128
|
