Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Netlib

Netlib is a repository of software for scientific computing maintained by AT&T, Bell Laboratories, the University of Tennessee and Oak Ridge… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
We describe the new version 2.00d of the code hfbtho that solves the nuclear Skyrme Hartree-Fock (HF) or Skyrme Hartree-Fock… Expand
  • figure 1
  • table 1
  • table 2
  • figure 2
  • table 3
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Abstract One perceived deficiency of interior-point methods in comparison to active set methods is their inability to efficiently… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
2004
2004
  • T. Koch
  • Oper. Res. Lett.
  • 2004
  • Corpus ID: 6972263
With standard linear programming solvers there is always some uncertainty about the precise values of the optimal solutions. We… Expand
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2002
Highly Cited
2002
This article describes the design rationale, a C implementation, and conformance testing of a subset of the new Standard for the… Expand
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Abstract.Optimal solutions of Linear Programming problems may become severely infeasible if the nominal data is slightly… Expand
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We present a highly optimized method for the elimination of linear variables from a Boolean combination of polynomial equations… Expand
Is this relevant?
1997
1997
This paper describes FFTW, a portable C package for computing the oneand multidimensional complex discrete Fourier transform (DFT… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1995
Highly Cited
1995
We present a simple new algorithm for triangulating polygons and planar straightline graphs, It provides "shape" and "size… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Robust software with error bounds for computing the generalized Schur decomposition of an arbitrary matrix pencil A – λB (regular… Expand
  • figure 1
  • table I
  • table III
  • figure 2
Is this relevant?
Highly Cited
1993
Highly Cited
1993
We present a simple new algorithm for triangulating polygons and planar straightline graphs. It provides "shape" and "size… Expand
  • figure 1
  • figure 3
  • figure 2
  • figure 7
  • figure 4
Is this relevant?