Results 21 to 40 of 91
Sort by:

  • QSHEP2D
  • Referenced in 17 articles [sw00761]
  • Algorithm 660 QSHEP2D: Quadratic Shepard method for bivariate...

  • rbMIT
  • Referenced in 146 articles [sw00784]
  • The rbMIT © MIT Software package implements in Matlab...

  • RKC
  • Referenced in 120 articles [sw00808]
  • RKC: An explicit solver for parabolic PDEs. An...

  • UMFPACK
  • Referenced in 415 articles [sw00989]
  • An ANSI C code for sparse LU factorization...

  • ALBERTA
  • Referenced in 179 articles [sw01061]
  • ALBERTA is an Adaptive multiLevel finite element toolbox...

  • CLAWPACK
  • Referenced in 138 articles [sw01069]
  • Clawpack stands for “Conservation Laws Package” and was...

  • CUDA
  • Referenced in 1325 articles [sw03258]
  • The NVIDIA® CUDA® Toolkit provides a comprehensive development...

  • TR-BDF2
  • Referenced in 33 articles [sw03446]
  • Analysis and implementation of TR-BDF2 This paper...

  • deal.ii
  • Referenced in 643 articles [sw03516]
  • deal.II is a C++ program library targeted at...

  • PETSc
  • Referenced in 1584 articles [sw04012]
  • The Portable, Extensible Toolkit for Scientific Computation (PETSc...

  • Trilinos
  • Referenced in 409 articles [sw04028]
  • Each Trilinos package is a self-contained, independent...

  • CPLEX
  • Referenced in 2773 articles [sw04082]
  • IBM® ILOG® CPLEX® offers C, C++, Java, .NET...

  • METIS
  • Referenced in 468 articles [sw04089]
  • METIS is a set of serial programs for...

  • CUBIT
  • Referenced in 79 articles [sw04109]
  • The CUBIT Geometry and Mesh Generation Toolkit: For...

  • RODAS
  • Referenced in 1695 articles [sw04112]
  • Rosenbrock method of order 4(3), for problems...

  • FFTW
  • Referenced in 549 articles [sw04126]
  • FFTW is a C subroutine library for computing...

  • BOXMG
  • Referenced in 5 articles [sw04222]
  • A set of three drivers for BOXMG: A...

  • Chombo
  • Referenced in 69 articles [sw04316]
  • Chombo - Software for Adaptive Solutions of Partial Differential...

  • Knapsack
  • Referenced in 488 articles [sw04723]
  • Knapsack problems are the simplest NP-hard problems...