• UMFPACK

  • Referenced in 421 articles [sw00989]
  • ordering and symbolic analysis phase computes an upper bound on fill-in, work, and memory ... ordering and analyzing a sparse matrix, computing the numerical factorization, solving a system with...
  • CoSaMP

  • Referenced in 231 articles [sw08727]
  • approaches. Moreover, this algorithm offers rigorous bounds on computational cost and storage. It is likely...
  • Knapsack

  • Referenced in 511 articles [sw04723]
  • relaxations, bounds, reductions and other algorithmic techniques for the exact solution. Computational results are presented...
  • NQTHM

  • Referenced in 151 articles [sw07543]
  • same authors’ previous book entitled “A computational logic” (1979; Zbl 0448.68020). The truly important changes ... their soundness and the permission of bounded quantification and partial recursive functions. These changes ... proof procedures” [in “The correctness problem in computer science ... addition of bounded quantification and partial functions to a computational logic and its theorem prover...
  • INTLAB

  • Referenced in 472 articles [sw04004]
  • very fast) automatic differentiation (forward mode, vectorized computations, fast) Gradients (to solve systems of nonlinear ... slow) multiple precision interval arithmetic with error bounds (does the job, slow...
  • CiaoPP

  • Referenced in 45 articles [sw12089]
  • variable instantiation properties, non-failure, determinacy, bounds on computational cost, bounds on sizes of terms...
  • INTOPT_90

  • Referenced in 306 articles [sw04705]
  • bound, infeasibility test, interval Newton algorithm applied to the John conditions and computationally executed proofs...
  • ACRITH-XSC

  • Referenced in 49 articles [sw00015]
  • appropriate. A complete sample program for computing continuous bounds on the solution of an initial...
  • Adam

  • Referenced in 948 articles [sw22205]
  • method is straightforward to implement, is computationally efficient, has little memory requirements, is invariant ... algorithm and provide a regret bound on the convergence rate that is comparable...
  • Freshml

  • Referenced in 50 articles [sw08992]
  • explicitly. This may have the computational effect of swapping bound names with freshly generated ones...
  • BARON

  • Referenced in 361 articles [sw00066]
  • BARON is a computational system for solving nonconvex optimization problems to global optimality. Purely continuous ... reduce arsenal with enhanced branch and bound concepts as it winds its way through...
  • Bonmin

  • Referenced in 214 articles [sw04766]
  • bound and polyhedral outer approximation are the two extreme cases, are proposed and implemented. Computational...
  • SDPB

  • Referenced in 105 articles [sw23927]
  • example application, we compute a new rigorous high-precision bound on operator dimensions...
  • MRMC

  • Referenced in 73 articles [sw04129]
  • MRMC are its support for computing time- and reward-bounded reachability probabilities, (property-driven) bisimulation...
  • filib++

  • Referenced in 43 articles [sw06459]
  • latter was the fast computation of guaranteed bounds for interval versions of a comprehensive ... extended” mode, that extends the exception-free computation mode using special values to represent infinities...
  • SuLQ

  • Referenced in 128 articles [sw11355]
  • improving the bounds on noise required for privacy. Second, we examine the computational power...
  • PATRICIA

  • Referenced in 53 articles [sw17325]
  • user with a quantity of computation which has a bound which depends linearly...
  • IR Tools

  • Referenced in 51 articles [sw26721]
  • methods that can impose bound constraints on the computed solutions. All the iterative methods...
  • KELLEY

  • Referenced in 643 articles [sw04829]
  • studies projection methods for the solution of bound constrained problems. All chapters conclude with ... evaluation of the objective function involves computer simulations. In such cases the noise often introduces...
  • VNODE

  • Referenced in 24 articles [sw11946]
  • package for computing rigorous bounds on the solution of an initial value problem...