Parallel Cholesky-based reduction for the weighted integer least squares problem

DOI10.1007/s00190-011-0490-yzbMath1351.86027OpenAlexW2142591555MaRDI QIDQ727439

Publication date: 6 December 2016

Published in: Journal of Geodesy (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2433/152556

zbMATH Keywords

global positioning system (GPS)integer linear model closest point problem integer least squares LLL reduction multiple-input-multiple-output reduction of quadratic forms

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Computational methods for problems pertaining to geophysics (86-08) Geodesy, mapping problems (86A30)

Cites Work

Unnamed Item
Unnamed Item
Stabilizing ill-conditioned linear complementarity problems
Calculation of Minkowski-reduced lattice bases
Venkov's reduction theory of positive quadratic forms
On Lovász' lattice reduction and the nearest lattice point problem
Algorithms to construct Minkowski reduced and Hermite reduced lattice bases
A hierarchy of polynomial time lattice basis reduction algorithms
Factoring polynomials with rational coefficients
Geometric algorithms and combinatorial optimization
The theory of Hermite-Minkowski reduction of positive definite quadratic forms
The Hermite-Minkowski domain of reduction of positive definite quadratic forms in six variables
Reduction theory of positive quadratic forms
Lattice reduction: a toolbox for the cryptoanalyst
On the computational complexity of reconstructing lattice sets from their \(X\)-rays
Simultaneous reduction of a lattice basis and its reciprocal basis
An upper bound on the average number of iterations of the LLL algorithm
Lattice basis reduction: Improved practical algorithms and solving subset sum problems
An algorithm reconstructing convex lattice sets.
Random lattices, threshold phenomena and efficient reduction algorithms.
Random simulation and GPS decorrelation.
An improved LLL algorithm
Fast LLL-type lattice reduction
Nonlinear integer programming
On Voronoi reduction of positive definite quadratic forms
Mixed Integer Linear Models
Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
On maximum-likelihood detection and the search for the closest lattice point
Voronoi cells, probabilistic bounds, and hypothesis testing in mixed integer linear models
An LLL Algorithm with Quadratic Complexity
On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications
Gauss' algorithm revisited
On the complexity of decoding lattices using the Korkin-Zolotarev reduced basis
Fixed Complexity LLL Algorithm
Closest point search in lattices
Efficient detection algorithms for mimo channels: a geometrical approach to approximate ml detection
Noise-predictive decision-feedback detection for multiple-input multiple-output channels
A sufficient condition for an extreme covering of n-space by spheres
ON MINKOWSKI'S THEORY OF REDUCTION OF POSITIVE DEFINITE QUADRATIC FORMS
On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Parallel Cholesky-based reduction for the weighted integer least squares problem