ArticleScientific reports2023
Improved GNSS integer ambiguity resolution method based on the column oriented Cholesky decomposition.
Article in Scientific reports, 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
1 citing paper in PubMed.
- Single-Frequency GNSS Integer Ambiguity Solving Based on Adaptive Genetic Particle Swarm Optimization Algorithm.Sensors (Basel, Switzerland) · 2023Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
6 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
Because the traditional Cholesky decomposition algorithm still has some problems such as computational complexity and scattered structure among matrices when solving the GNSS ambiguity, it is the key problem to further improve the computational efficiency of the least squares ambiguity reduction correlation process in the carrier phase integer ambiguity solution. But the traditional matrix decomposition calculation is more complex and time-consuming, to improve the efficiency of the matrix decomposition, in this paper, the decomposition process of traditional matrix elements is divided into two steps: multiplication update and column reduction of square root calculation. The column reduction step is used to perform square root calculation and column division calculation, while the update step is used for the update task of multiplication. Based on the above ideas, the existing Cholesky decomposition algorithm is improved, and a column oriented Cholesky (C-Cholesky) algorithm is proposed to further improve the efficiency of matrix decomposition, so as to shorten the calculation time of integer ambiguity reduction correlation. The results show that this method is effective and superior, and can improve the data processing efficiency by about 12.34% on average without changing the integer ambiguity accuracy of the traditional Cholesky algorithm.
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.