Semantic Scholar uses AI to extract papers important to this topic.
We describe the new version 2.00d of the code hfbtho that solves the nuclear Skyrme Hartree-Fock (HF) or Skyrme Hartree-Fock… Expand Abstract
One perceived deficiency of interior-point methods in comparison to active set methods is their inability to efficiently… Expand Abstract A new non-simplex active-set method for solving linear programs is presented. This method uses a “global” viewpoint of… Expand With standard linear programming solvers there is always some uncertainty about the precise values of the optimal solutions. We… Expand Abstract.Optimal solutions of Linear Programming problems may become severely infeasible if the nominal data is slightly… Expand 1 Overview Solving sparse linear systems of equations is a common and important component of a multitude of scientific and… Expand We present a simple new algorithm for triangulating polygons and planar straightline graphs, It provides "shape" and "size… Expand Robust software with error bounds for computing the generalized Schur decomposition of an arbitrary matrix pencil A – λB (regular… Expand State space caching is a state space exploration method that stores all states of just one execution sequence plus as many… Expand A collection of 100 Fortran loops used to test the effectiveness of an automatic vectorizing compiler is described. The results… Expand