Abstract
The Gauss-Seidel iteration process is specialised to fit unique surfaces in the least square sense to irregularely spaced data. The Fortran IV version of the specialised algorithm, called iterative one parameter least square process, is described for immediate computer use. The new algorithm requires so few storage locations that a 32 K computer memory without any peripheric device is sufficient to store 3000 data points and to solve a system of normal equations of order up to 1500. The surface fitting is illustrated by a numerical example.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
