On the impact of communication complexity in the design of parallel numerical algorithms [PDF]
, 1984 This paper describes two models of the cost of data movement in parallel numerical algorithms. One model is a generalization of an approach due to Hockney, and is suitable for shared memory multiprocessors where each processor has vector capabilities ...
Gannon, D., Vanrosendale, J.
core
Dual-lattice ordering and partial lattice reduction for SIC-based MIMO detection [PDF]
, 2009 This is the author's accepted manuscript. The final published article is available from the link below. Copyright @ 2009 IEEE. Personal use of this material is permitted.
Mow, WH +5 more
core +1 more source
Complexity and performance for two classes of noise-tolerant first-order algorithms [PDF]
Two classes of algorithms for optimization in the presence of noise are presented, thatdo not require the evaluation of the objective function. The first generalizes the well-known Adagrad method.
Toint, Philippe; id_orcid +2 more
core +1 more source
Defining Asymptotic Parallel Time Complexity of Data-dependent Algorithms
, 2021 The scientific research community has reached a stage of maturity where its strong need for high-performance computing has diffused into also everyday life of engineering and industry algorithms.
Fritzsche, Paula Cecilia +2 more
core
Data detection algorithms for perpendicular magnetic recording in the presence of strong media noise [PDF]
As the throughput and density requirements increase for perpendicular magnetic recording channels, the presence of strong media noise degrades performance.
Jackson, Robert Charles
core
A Mathematical Analysis of the Long-run Behavior of Genetic Algorithms for Social Modeling [PDF]
We present a mathematical analysis of the long-run behavior of genetic algorithms that are used for modeling social phenomena. The analysis relies on commonly used mathematical techniques in evolutionary game theory.
Waltman, L.R., Eck, N.J.P. van
core
First-Order Objective-Function-Free Optimization Algorithms and Their Complexity
, 2022 3 figuresA class of algorithms for unconstrained nonconvex optimization is considered where the value of the objective function is never computed.
Gratton, Serge +2 more
core
The Prediction Performance Analysis of the Lasso Model with Convex Non-Convex Sparse Regularization
The incorporation of ℓ1 regularization in Lasso regression plays a crucial role by inducing convexity to the objective function, thereby facilitating its minimization; when compared to non-convex regularization, the utilization of ℓ1 ...
Hancong Li +3 more
core +1 more source
Boundary SPH for Robust Particle–Mesh Interaction in Three Dimensions
This paper introduces an algorithm to tackle the boundary condition (BC) problem, which has long persisted in the numerical and computational treatment of smoothed particle hydrodynamics (SPH).
Ryan Kim, Paul M. Torrens
core +1 more source
Efficient and practical Hamiltonian simulation from time-dependent product formulas
Nature CommunicationsIn this work we propose an approach for implementing time-evolution of a quantum system using product formulas. The quantum algorithms we develop have provably better scaling (in terms of gate complexity and circuit depth) than a naive application of ...
Jan Lukas Bosse +5 more
doaj +1 more source