• SINGULAR

  • Referenced in 1412 articles [sw00866]
  • rationals, floats, algebraic extensions, transcendental extensions), or localizations thereof, or quotient rings with respect...
  • KELLEY

  • Referenced in 609 articles [sw04829]
  • first part. Chapter 2 studies the local convergence of Newton’s method, inexact Newton methods ... method is studied in chapter 4. A local convergence analysis is provided and implementation details...
  • Ipopt

  • Referenced in 648 articles [sw04808]
  • nonlinear optimization. It is designed to find (local) solutions of mathematical optimization problems...
  • LINPACK

  • Referenced in 514 articles [sw04209]
  • oriented algorithms to increase efficiency by preserving locality of reference. LINPACK was designed for supercomputers...
  • XFEM

  • Referenced in 370 articles [sw01026]
  • fracture mechanics for hundreds of cracks with local near-tip refinement, and crack propagation...
  • CGAL

  • Referenced in 362 articles [sw00118]
  • parameterization, as well as estimation of local differential properties, and approximation of ridges and umbilics...
  • AUSM

  • Referenced in 274 articles [sw06367]
  • solution remains stable, even if no local preconditioning matrix is included in the time derivative...
  • SVMlight

  • Referenced in 261 articles [sw04076]
  • bounding the solution using a form of local search. A detailed description of the algorithm...
  • BLAST

  • Referenced in 245 articles [sw17334]
  • Basic Local Alignment Search Tool. BLAST finds regions of similarity between biological sequences. The program...
  • lobpcg.m

  • Referenced in 127 articles [sw24008]
  • lobpcg.m, MATLAB implementation of the locally optimal block preconditioned conjugate gradient method: Toward the optimal ... preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method. We describe new algorithms ... locally optimal block preconditioned conjugate gradient (LOBPCG) method for symmetric eigenvalue problems, based ... local optimization of a three-term recurrence, and suggest several other new methods...
  • Walksat

  • Referenced in 206 articles [sw04328]
  • GSAT and WalkSat are local search algorithms to solve Boolean satisfiability problems. Both algorithms work...
  • ve08

  • Referenced in 146 articles [sw05141]
  • only hope to locate a local minimum of f within the usual limitations on storage ... traditional approach of approximating f by local quadratic models, which is computationally feasible even...
  • UG

  • Referenced in 190 articles [sw04596]
  • developed. We are especially interested in adaptive local grid refinement on unstructured meshes, multigrid solvers...
  • ns-2

  • Referenced in 189 articles [sw11690]
  • multicast protocols over wired and wireless (local and satellite) networks. Ns began as a variant...
  • Globus Toolkit

  • Referenced in 175 articles [sw09648]
  • corporate, institutional, and geographic boundaries without sacrificing local autonomy. The toolkit includes software services...
  • TetGen

  • Referenced in 161 articles [sw04046]
  • mesh data structure, a set of enhanced local mesh operations (combination of flips and edge...
  • KANT/KASH

  • Referenced in 156 articles [sw00481]
  • algebraic number fields, algebraic function fields and local fields. In the number field case, algebraic...
  • LOF

  • Referenced in 90 articles [sw19311]
  • Identifying density-based local outliers. For many KDD applications, such as detecting criminal activities ... outlier. This degree is called the local outlier factor (LOF) of an object ... local in that the degree depends on how isolated the object is with respect ... show that our approach of finding local outliers can be practical...
  • GradSamp

  • Referenced in 109 articles [sw05270]
  • practical and robust algorithm for computing the local minima of a continuously differentiable function ... which is not convex and not even locally Lipschitz. The only request formulated is that...
  • Pastry

  • Referenced in 108 articles [sw11775]
  • recoveries. Pastry takes into account network locality; it seeks to minimize the distance messages travel ... node failures, and its good network locality properties...