• GQTPAR

  • Referenced in 303 articles [sw07451]
  • produce a nearly optimal solution in a finite number of iterations. We also consider ... prove that under reasonable assumptions the sequence generated by Newton’s method has a limit ... point which satisfies the first and second order necessary conditions for a minimizer...
  • r2d2lri

  • Referenced in 10 articles [sw00772]
  • integrator uses a sixth-order Sidi transformation applied to a sequence of embedded lattice rules ... computational overhead. Even for integrals over non-finite domains, for which several non-finite...
  • FDEXTR

  • Referenced in 1 article [sw00269]
  • differential equations by the finite difference method of the second order using the iterative Richardson ... extrapolation of the difference eigensolutions on a sequence of doubly condensed meshes. The same extrapolational...
  • Well Quasi Orders

  • Referenced in 1 article [sw28605]
  • well-quasi-orders (wqo) which is characterized by the absence of ”bad” sequences (our proofs ... list type, and a type of finite trees, which (almost) directly follow from our proofs...
  • Stuttering Equivalence

  • Referenced in 1 article [sw28575]
  • omega-sequences are stuttering equivalent if they differ only by finite repetitions of elements. Stuttering ... such systems should be insensitive to finite stuttering. Peled and Wilke showed that all PLTL ... certain verification techniques such as partial-order reduction for model checking. We formalize stuttering equivalence ... functions that may skip blocks of identical sequence elements. We also encode PLTL and prove...
  • VeriCon

  • Referenced in 2 articles [sw16297]
  • much effort has been invested in applying finite state model checking to check that ... admissible topologies and for all possible (infinite) sequences of network events. VeriCon either confirms ... outputs a concrete counterexample. VeriCon uses first-order logic to specify admissible network topologies...
  • Decombinator

  • Referenced in 1 article [sw23150]
  • novel application of finite-state automaton to map Illumina short-read sequence data for individual ... single-base pair mismatches arising from sequencing error. The software package, named Decombinator, is tested ... sequences and then on a set of published human TcR-β sequences. Decombinator assigned sequences ... rate more than two orders of magnitude faster than that achieved by classical pairwise alignment...
  • BoomerAMG

  • Referenced in 143 articles [sw00086]
  • BoomerAMG: A parallel algebraic multigrid solver and preconditioner...
  • CARP-CG

  • Referenced in 8 articles [sw00105]
  • CARP-CG is a conjugate gradient (CG) acceleration...
  • CoCoA

  • Referenced in 601 articles [sw00143]
  • CoCoA is a system for Computations in Commutative...
  • Coq

  • Referenced in 1748 articles [sw00161]
  • Coq is a formal proof management system. It...
  • CSDP

  • Referenced in 194 articles [sw00169]
  • CSDP, A C Library for Semidefinite Programming. This...
  • Expokit

  • Referenced in 170 articles [sw00258]
  • Expokit provides a set of routines aimed at...
  • FGb

  • Referenced in 234 articles [sw00286]
  • FGb/Gb libraryGb is a program (191 420 lines...
  • GAP

  • Referenced in 2702 articles [sw00320]
  • GAP is a system for computational discrete algebra...
  • gfun

  • Referenced in 126 articles [sw00344]
  • The gfun package provides tools for determining and...
  • gmp

  • Referenced in 255 articles [sw00363]
  • GMP is a free library for arbitrary precision...
  • Grail

  • Referenced in 19 articles [sw00374]
  • Grail is a symbolic computation environment for finite...
  • HSL

  • Referenced in 260 articles [sw00418]
  • HSL (formerly the Harwell Subroutine Library) is a...
  • hypre

  • Referenced in 247 articles [sw00426]
  • hypre is a software library for the solution...