Parallel Partitioned Inverse Method for Least-Squares Adjustment
Publication: Journal of Surveying Engineering
Volume 126, Issue 4
Abstract
Parallel computing is undoubtedly the trend in numerical applications of highly intensive computation. There has been much related research and development on parallel computer architecture, algorithm design, and supplementary packages. However, computational technology has seen little interest in the surveying area since the North American Datum of 1983 adjustment. In this research, a parallel partitioned inverse algorithm is implemented and applied to a least-squares adjustment of horizontal survey networks to present the potential of parallel computing methods for surveying data. Two observation data sets with 2,412 and 1,902 unknowns were used for the test. To improve performance of the algorithm, two different partitioning schemes also were investigated with the data sets. The computational experiment presents the good scalability of the algorithm and better partitioning approach with the improved speed. However, it is noted that parallel factorization of sparse matrices is required to fully utilize the proposed approach.
Get full access to this article
View all available purchase options and get full access to this article.
References
1.
Alvarado, F. L., Pothen, A., and Schreiber, R. ( 1993). “Highly parallel sparse triangular solution.” Graph theory and sparse matrix computation, A. George, J. Gilbert, and W. H. Liu, eds., Springer, New York, 141–157.
2.
Alvarado, F. L., Tinney, W. F., and Enns, M. K. ( 1991). “Sparsity in large-scale network computation.” Advances in electric power and energy conversion system dynamics and control, C. T. Londes, ed., Academic, London.
3.
Betancourt, R. ( 1988). “An efficient heuristic ordering algorithm for partial matrix refactorization.” IEEE Trans. on Power Sys., 3(3), 1181–1187.
4.
Geist, A., Beguelin, A., and Dongarra, J. ( 1994). PVM (Parallel Virtual Machine): A users' guide and tutorial for networked parallel computing, MIT Press, Cambridge, Mass.
5.
Gomez, A., and Franquelo, L. ( 1988). “Node ordering algorithms for sparse vector method improvement.”IEEE Trans. on Power Sys., 3(1), 73–79.
6.
JaJa, J. ( 1992). An introduction to parallel algorithms, Addison-Wesley, Reading, Mass.
7.
Kumer, V., Grama, A., Gupta, A., and Karypis, G. ( 1994). Introduction to parallel computing: Design and analysis of algorithm, Benjamin-Cummings, Redwood City, Calif.
8.
Liu, J. W. H. ( 1985). “Modification of the minimum degree algorithm by multiple elimination.” ACM Trans. on Math. Software, 11, 141–153.
9.
Pacheco, P. ( 1996). Parallel programming with MPI, Academic, London.
10.
Schwarz, C. R., ed. ( 1989). “North American datum of 1983.” NOAA Profl. Paper NOS 2, U.S. Department of Commerce, Rockville, MD.
11.
Snay, R. A. ( 1976). “Reducing the profile of sparse symmetric matrices.” NOAA Tech. Memo. NOS NGS-4, National Geodetic Survey, Rockville, MD.
12.
Wolf, P. R., and Ghilani, C. D. ( 1997). Adjustment computations: Statistics and least squares in surveying and GIS, Wiley, New York.
Information & Authors
Information
Published In
Journal of Surveying Engineering
Volume 126 • Issue 4 • November 2000
Pages: 163 - 176
History
Received: Sep 13, 1999
Published online: Nov 1, 2000
Published in print: Nov 2000
Authors
Metrics & Citations
Metrics
Citations
Download citation
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.