Abstract
In this paper, the expression of V klm(I) in the Gooding method is rewritten to be the form convenient for calculation, and a standard recursive lm procedure is used to calculate Aklm(I). We have rewritten the Gooding's program under the assumption that l and k have the same odd-even parity, this makes the program be shorten for one half, the computational effciency and readability of the program be raised, the computing time be shortened for 41%, and the computational accuracy and stability are also slightly improved.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
