• CGS

  • Referenced in 308 articles [sw08225]
  • algorithm (a “squared” conjugate gradient method) with a preconditioning called ILLU (an incomplete line ... equations in two dimensions is roughly O(N...
  • QUALEX

  • Referenced in 51 articles [sw04742]
  • such a point. The developed method has complexity O(n 3 ), where...
  • EPnP

  • Referenced in 13 articles [sw29721]
  • EPnP: An Accurate O(n) Solution to the PnP Problem. We propose a non-iterative ... state-of-the-art methods that are O(n 5) or even ... O(n 8), without being more accurate. Our method is applicable ... referential, which can be done in O(n) time by expressing these coordinates as weighted...
  • CDMA/OVSF

  • Referenced in 12 articles [sw03215]
  • also presented. All our methods use only $O (n)$ total messages (each with...
  • CONQUEST

  • Referenced in 4 articles [sw02551]
  • where N is the number of atoms). The principles necessary to develop methods with linear ... with system size ([MATHEMATICAL SCRIPT CAPITAL O](N ) methods) have been established for more than ... code, which performs [MATHEMATICAL SCRIPT CAPITAL O](N ) DFT calculations on parallel computers...
  • reducedLP

  • Referenced in 12 articles [sw04821]
  • constraint matrix A is m×n, with n≫m≫1. Such problems arise, for example ... dual interior-point methods on such problems is O(m 2 n). We propose ... result in a speedup of close to n/|Q| at each iteration. Promising numerical results ... algorithm and of Mehrotra’s predictor-corrector method [S. Mehrotra, SIAM J. Optim...
  • CircularMap

  • Referenced in 7 articles [sw34751]
  • computational cost of the method is O(mnlnn) where n is the number of nodes ... accuracy and efficiency of the presented method are demonstrated by several numerical examples. These examples...
  • FaIMS

  • Referenced in 9 articles [sw06425]
  • vector.par If $N_{omega }$ is the number of illumination frequencies, $N_{s}$ the number ... illumination locations, $N_{d}$ the number of detectors, and N the discretization size ... vector requires $O(N_{omega }N_{s}mu (N))$ work, where $mu (N ... applying the Born operator becomes $O(mu (N)N_{omega })$. We provide numerical results that...
  • MOLT

  • Referenced in 7 articles [sw34473]
  • based formulation combined with an explicit SSP method indicate that the combined scheme is unconditionally ... with a fast ({mathcal{O}}(N)) summation algorithm. The new method allows for much larger...
  • PetRBF

  • Referenced in 20 articles [sw12862]
  • that exhibits O(N) complexity, requires O(N) storage, and scales excellently ... method (rasm) as a preconditioner and a fast matrix-vector algorithm. Previous fast rbf methods ... achieving at most O(NlogN) complexity — were developed using multiquadric and polyharmonic basis functions...
  • smerfs

  • Referenced in 8 articles [sw23987]
  • n grid in O(n2logn) . Furthermore, an efficient method to set up the necessary conditional...
  • BADMM

  • Referenced in 32 articles [sw20288]
  • paper, we similarly generalize the alternating direction method of multipliers (ADMM) to Bregman ADMM (BADMM ... establish the global convergence and the O(1/T) iteration complexity for BADMM. In some cases ... than ADMM by a factor of O(n/log(n)). In solving the linear program...
  • PPS

  • Referenced in 3 articles [sw18337]
  • addition, performance tests indicate that the PPS method is more effective and efficient than ... algorithm is $mathrm{O}(N)$. Therefore, the PPS method may have a broad range...
  • FRSDE

  • Referenced in 15 articles [sw08762]
  • computational time compared with several existing methods, it still faces the critical challenge for practical ... high time complexity (no less than O(N 2 )) and space complexity...
  • PartTree

  • Referenced in 4 articles [sw17112]
  • time complexity of O(N log N). The new MSA method with the PartTree algorithm...
  • ExaGeoStat

  • Referenced in 6 articles [sw30062]
  • mathcal O}(n^3)$ operations are required. While many approximation methods have been devised from...
  • MIMD-SIMD

  • Referenced in 1 article [sw03126]
  • simulated using a direct summation $(O(N^2))$ method and a heterogeneous platform. Preliminary simulations...
  • TABI

  • Referenced in 29 articles [sw18194]
  • linear Poisson-Boltzmann equation. The method employs a well-conditioned boundary integral formulation ... treecode which reduces the cost from $O(N^2)$ to $O(Nlog N)$, where...
  • PhySIC

  • Referenced in 8 articles [sw08376]
  • n taxa, this method produces a supertree that satisfies the above-mentioned properties in O...
  • L2CXFT

  • Referenced in 9 articles [sw00498]
  • n$ measurements of a convex function contaminated by random errors. The method minimizes ... optimum is derived in $O(n)$ operations. Then, this approximation is used as the starting...