Parallel Cholesky-based reduction for the weighted integer least squares problem
DOI10.1007/S00190-011-0490-YzbMATH Open1351.86027OpenAlexW2142591555MaRDI QIDQ727439FDOQ727439
Authors: Peiliang Xu
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
Recommendations
- Efficient and optimal parallel algorithms for Cholesky decomposition
- Parallel algorithms for the iterative solution of sparse least-squares problems
- scientific article; zbMATH DE number 4056886
- A parallel Cholesky algorithm for the solution of symmetric linear systems
- A parallel multisplitting solution of the least squares problem
- scientific article; zbMATH DE number 1302627
- Parallel multisplitting methods with optimal weighting matrices for linear systems
- scientific article; zbMATH DE number 3967813
- Publication:4860184
- Parallel solution of certain Toeplitz least-squares problems
global positioning system (GPS)integer linear modelclosest point probleminteger least squaresLLL reductionmultiple-input-multiple-outputreduction of quadratic forms
Geodesy, mapping problems (86A30) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Computational methods for problems pertaining to geophysics (86-08)
Cites Work
- A hierarchy of polynomial time lattice basis reduction algorithms
- Geometric algorithms and combinatorial optimization
- Title not available (Why is that?)
- Factoring polynomials with rational coefficients
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Nonlinear integer programming
- On lattices, learning with errors, random linear codes, and cryptography
- On the computational complexity of reconstructing lattice sets from their \(X\)-rays
- Title not available (Why is that?)
- On Lovász' lattice reduction and the nearest lattice point problem
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- An LLL algorithm with quadratic complexity
- Closest point search in lattices
- Fast LLL-type lattice reduction
- Random simulation and GPS decorrelation.
- On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications
- On the complexity of decoding lattices using the Korkin-Zolotarev reduced basis
- On Voronoi reduction of positive definite quadratic forms
- Gauss' algorithm revisited
- On maximum-likelihood detection and the search for the closest lattice point
- Calculation of Minkowski-reduced lattice bases
- Lattice reduction: a toolbox for the cryptoanalyst
- Simultaneous reduction of a lattice basis and its reciprocal basis
- Stabilizing ill-conditioned linear complementarity problems
- Venkov's reduction theory of positive quadratic forms
- Algorithms to construct Minkowski reduced and Hermite reduced lattice bases
- 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
- An upper bound on the average number of iterations of the LLL algorithm
- An algorithm reconstructing convex lattice sets.
- Random lattices, threshold phenomena and efficient reduction algorithms.
- An improved LLL algorithm
- Mixed integer linear models
- Voronoi cells, probabilistic bounds, and hypothesis testing in mixed integer linear models
- Fixed Complexity LLL Algorithm
- 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
Cited In (2)
This page was built for publication: Parallel Cholesky-based reduction for the weighted integer least squares problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q727439)