• CSparse

  • Referenced in 237 articles [sw20382]
  • requiring the solution of sparse systems of linear equations. Attacking these problems efficiently requires ... strong emphasis on MATLAB and the C programming language, Direct Methods for Sparse Linear Systems...
  • Camellia

  • Referenced in 89 articles [sw09731]
  • confirmed that Camellia provides strong security against differential and linear cryptanalyses. Compared...
  • PLAPACK

  • Referenced in 61 articles [sw04268]
  • apart from other parallel linear algebra libraries, allowing for strong performance and significanltly less programming...
  • MINTO

  • Referenced in 135 articles [sw04587]
  • branch-and-bound algorithm with linear programming relaxations. It also provides automatic constraint classification, preprocessing ... preprocessing and probing; construct feasible solutions generate strong valid inequalities perform variable fixing based ... reduced prices control the size of the linear programs by managing active constraints...
  • CRYPTIM

  • Referenced in 28 articles [sw02442]
  • walks has a strong similarity with the classical scheme of linear coding. The algorithm...
  • Saga

  • Referenced in 104 articles [sw39677]
  • Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectives. In this work ... recently proposed incremental gradient algorithms with fast linear convergence rates. SAGA improves on the theory ... regulariser. Unlike SDCA, SAGA supports non-strongly convex problems directly, and is adaptive...
  • ImplicitLNLMethods

  • Referenced in 10 articles [sw23184]
  • preserving Runge-Kutta methods with high linear order. Strong stability preserving (SSP) time discretizations preserve ... step restriction. The search for high order strong stability preserving time-stepping methods with high ... restrict ourselves to solving only linear autonomous problems, the order conditions simplify...
  • iPiasco

  • Referenced in 44 articles [sw13492]
  • optimization problem of a certain type. The strongly convex objective function is assumed ... proved to be an optimal algorithm with linear rate of convergence. For certain problems this ... linear rate of convergence is better than the provably optimal worst-case rate of convergence ... smooth strongly convex functions. We demonstrate the efficiency of the proposed algorithm in numerical experiments...
  • SuLQ

  • Referenced in 128 articles [sw11355]
  • Dinur, Dwork, and Nissim show that a strong form of privacy can be maintained using ... slightly) noisy reply the SuLQ (Sub-Linear Queries) primitive. The assumption of sublinearity becomes reasonable...
  • KADATH

  • Referenced in 9 articles [sw09575]
  • KADATH is able to deal with strongly non-linear situations. The algorithms are validated...
  • CTH

  • Referenced in 22 articles [sw08719]
  • material, large deformation, strong shock wave physics. One-dimensional recti-linear, cylindrical, and spherical meshes ... several models that are useful for simulating strong shock, large deformation events. Both tabular...
  • imexLNL

  • Referenced in 10 articles [sw23185]
  • imexLNL Implicit-Explicit Strong Stability Preserving Runge–Kutta Methods with High Linear Order...
  • glinternet

  • Referenced in 13 articles [sw18380]
  • Lasso INTERaction-NET. Fits linear pairwise-interaction models that satisfy strong hierarchy: if an interaction...
  • FOX

  • Referenced in 23 articles [sw13586]
  • strong and efficient key-schedule algorithms. We provide evidence that FOX is immune to linear...
  • IRMHD

  • Referenced in 4 articles [sw08878]
  • astrophysical problems is much larger. For example, strongly time-dependent, quasi-stationary and steady-state ... sought on a non-linearly distributed and strongly stretched mesh. As most of the numerical...
  • PPROJ

  • Referenced in 9 articles [sw21258]
  • linear convergence result is established for SpaRSA that does not require the strong concavity...
  • SPARSE-QR

  • Referenced in 17 articles [sw05215]
  • routine for sparse QR factorization. Sparse linear least squares problems are instead solved ... method. The accuracy in computed solutions is strongly dependent on a scaling parameter ... methods for the solution of sparse linear least squares problems and compare these with...
  • S-ROCK

  • Referenced in 42 articles [sw11792]
  • Runge-Kutta Chebyshev), are explicit and of strong order 1 and possess large stability domains ... allows one to handle large systems without linear algebra problems usually encountered with implicit methods...
  • CULA

  • Referenced in 11 articles [sw12745]
  • CULA, a GPU accelerated implementation of linear algebra routines. We present results from factorizations such ... NVIDIA GPUs based on CUDA demands very strong parallelism, requiring between hundreds and thousands ... achieve high performance. Some constructs from linear algebra map extremely well...