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