• # 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...
• # 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...
• # 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]