Efficient high-precision matrix algebra on parallel architectures for nonlinear combinatorial optimization
DOI10.1007/s12532-010-0014-4zbMath1200.65045OpenAlexW2113616862WikidataQ114852253 ScholiaQ114852253MaRDI QIDQ708777
Jon Lee, Susan Margulies, John A. Gunnels
Publication date: 14 October 2010
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-010-0014-4
algorithmsnumerical examplesparallel computationhigh-performance computingnonlinear combinatorial optimizationhigh-precision linear algebramatroid optimization
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Accelerating scientific computations with mixed precision algorithms
- Matching is as easy as matrix inversion
- Vandermonde matrices on integer nodes
- Clear two-factor interactions and minimum aberration
- Vandermonde systems on equidistant nodes in \([0,1\): accurate computation]
- Parametric nonlinear discrete optimization over well-described sets and matroid intersections
- Nonlinear Matroid Optimization and Experimental Design
- Minimum Aberration 2 k-p Designs
- Matroid Applications and Algorithms
- Accuracy and Stability of Numerical Algorithms
- Computation in multicriteria matroid optimization
This page was built for publication: Efficient high-precision matrix algebra on parallel architectures for nonlinear combinatorial optimization