Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Simulation Research on ASF Grid Establishment Methods

View through CrossRef
The ASF grid is one of the important methods for improving the performance of the eLoran system. When an ASF grid is established, users can calculate ASF through the ASF grid database and bilinear interpolation algorithms, thereby obtaining high-precision ASF values. However, establishing an ASF grid is a complex process, involving not only extensive data collection tasks but also the cumbersome processing of the collected data. This paper investigates and analyzes algorithms for establishing ASF grids under different conditions. When the number of test points exceeds the number of grid vertices, grids built using interpolation algorithms—particularly the inverse bilinear interpolation algorithm—perform the best, while those constructed using the Kriging algorithm perform second best, and the inverse distance interpolation algorithm yields the largest errors. When the number of test points is less than the number of grid vertices, grids constructed using the Kriging algorithm perform the best, while the inverse distance interpolation algorithm produces the largest errors. As a result, the inverse bilinear interpolation algorithm is the best choice, when the test points are more than the grid points. The Kriging algorithm is recommended, when the test points are sparse.
Title: Simulation Research on ASF Grid Establishment Methods
Description:
The ASF grid is one of the important methods for improving the performance of the eLoran system.
When an ASF grid is established, users can calculate ASF through the ASF grid database and bilinear interpolation algorithms, thereby obtaining high-precision ASF values.
However, establishing an ASF grid is a complex process, involving not only extensive data collection tasks but also the cumbersome processing of the collected data.
This paper investigates and analyzes algorithms for establishing ASF grids under different conditions.
When the number of test points exceeds the number of grid vertices, grids built using interpolation algorithms—particularly the inverse bilinear interpolation algorithm—perform the best, while those constructed using the Kriging algorithm perform second best, and the inverse distance interpolation algorithm yields the largest errors.
When the number of test points is less than the number of grid vertices, grids constructed using the Kriging algorithm perform the best, while the inverse distance interpolation algorithm produces the largest errors.
As a result, the inverse bilinear interpolation algorithm is the best choice, when the test points are more than the grid points.
The Kriging algorithm is recommended, when the test points are sparse.

Related Results

Three Dimensional Simulations in Real Time for Personalized Drug Release Prosthesis Used in Lumbosacral Rehabilitation
Three Dimensional Simulations in Real Time for Personalized Drug Release Prosthesis Used in Lumbosacral Rehabilitation
This paper presents a theoretical method for simulation and three-dimensional reconstruction of the anatomical elements of the spine in order to achieve hydrogel disc prosthesis by...
Grevillea papuana as Traditional Medicine by Lani Ethnic Group in Jayawijaya
Grevillea papuana as Traditional Medicine by Lani Ethnic Group in Jayawijaya
<!--[if gte mso 9]><xml> <w:WordDocument> <w:View>Normal</w:View> <w:Zoom>0</w:Zoom> <w:TrackMoves /> <w:TrackFormatting /> &l...
Traditional Knowledge of Asmat Ethnic Group in Using Woods as Carving Materials at Asmat District
Traditional Knowledge of Asmat Ethnic Group in Using Woods as Carving Materials at Asmat District
<!--[if gte mso 9]><xml> <w:WordDocument> <w:View>Normal</w:View> <w:Zoom>0</w:Zoom> <w:TrackMoves /> <w:TrackFormatting /> &l...
Constantinople as 'New Rome'
Constantinople as 'New Rome'
<!--[if gte mso 9]><xml> <o:DocumentProperties> <o:Revision>0</o:Revision> <o:TotalTime>0</o:TotalTime> <o:Pages>1</o:Pages> &...

Back to Top