Abstract

An algorithm for solving the inverse problem for determining the parameters of a buried archaeological object in the form of an elliptical cylinder (as a model of a typical burial or pit) is proposed. The estimation of accuracy of determination of parameters of the buried archaeological objects on the basis of the numerical solution of the inverse problem of magnetic prospecting for synthetic model is carried out. Its implementation included, firstly, the stage of modeling the magnetic field from a synthetic model of the archaeological site at three different heights for different parameters of the grid density and the size of the magnetic survey site and, secondly, the stage of solving the inverse problem from synthetic data at different heights, for different parameters of the magnetic survey and assessing the accuracy of the solution of the inverse problem. It is found that the accuracy of determining the parameters of the anomalous body is more affected by the size of the survey area than the density of the measurement network. There is also a tendency to increase the accuracy of determining parameters when using data of different heights. Approbation of the algorithm for solving the inverse problem on real data of different-altitude magnetic survey over the burial at the archaeological site Tartas-1 showed quite good results. The average error in determining the geometric parameters of the body and its occurrence is ~ 15 %.

Full Text
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

Disclaimer: 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.