Author:
M. Eshagh Royal Institute of Technology Division of Geodesy Stockholm SE 10044 Sweden

Search for other papers by M. Eshagh in
Current site
Google Scholar
PubMed
Close
Restricted access

Computational time is an important matter in numerical aspects and it depends on the algorithm and computer that is used. An inappropriate algorithm can increase computation time and cost. The main goal of this paper is to present a vectorization algorithm to speed up the global gradiometric synthesis and analysis. The paper discusses details of this technique and its very high capabilities. Numerical computations show that the global gradiometric synthesis with 0.5° × 0.5° resolution can be done in a few minutes (6 minutes) by vectorization, which is considerable less compared to several hours (9 hours) by an inappropriate algorithm. The global gradiometric analysis of representation by spherical harmonics up to degree and order of 360, can be performed within one hour using vectorization, but if an inconvenient algorithm is used it can be delayed more than 1 day. Here we present the vectorization technique to gradiometric synthesis and analysis, but it can also be used in many other computational aspects and disciplines.

  • Collapse
  • Expand

To see the editorial board, please visit the website of Springer Nature.

Manuscript Submission: HERE

For subscription options, please visit the website of Springer Nature.

Acta Geodaetica et Geophysica
Language English
Size B5
Year of
Foundation
2013
Volumes
per Year
1
Issues
per Year
4
Founder Magyar Tudományos Akadémia
Founder's
Address
H-1051 Budapest, Hungary, Széchenyi István tér 9.
Publisher Akadémiai Kiadó Springer
Nature Switzerland AG
Publisher's
Address
H-1117 Budapest, Hungary 1516 Budapest, PO Box 245.
CH-6330 Cham, Switzerland Gewerbestrasse 11.
Responsible
Publisher
Chief Executive Officer, Akadémiai Kiadó
ISSN 2213-5812 (Print)
ISSN 2213-5820 (Online)

Monthly Content Usage

Abstract Views Full Text Views PDF Downloads
Nov 2024 6 0 0
Dec 2024 5 0 0
Jan 2025 15 0 0
Feb 2025 9 0 0
Mar 2025 20 0 0
Apr 2025 8 0 0
May 2025 1 0 0