• KELLEY

  • Referenced in 493 articles [sw04829]
  • Iterative methods for optimization This book gives an introduction to optimization methods for unconstrained ... devoted to line-search and trust-region methods, which are used to globalize convergence ... optimization iteration is sufficiently close to a solution. par The BFGS method is studied...
  • LSQR

  • Referenced in 230 articles [sw00530]
  • Equations and Least Squares Problems. An iterative method is given for solving...
  • Wesseling

  • Referenced in 223 articles [sw09677]
  • multigrid cycles, transfer operators, smoothing methods, and nested iteration, and defect correction. Cell centered ... Unix based computers. The methods used are fully described in the following book: An Introduction...
  • eigs

  • Referenced in 269 articles [sw03702]
  • method in the symmetric case). Using a truncated variant of the implicitly shifted QR-iteration ... Lanczos) vector on each iteration. This approach generalizes explicit restart methods. Advantages of the method...
  • GpBiCg

  • Referenced in 49 articles [sw07030]
  • iterative method which is a hybrid of the BiCGSTAB and GPBiCG methods is proposed ... parameters of the BiCGSTAB method are adopted at even iteration step, and those ... GPBiCG method are used at odd iteration step. In the present GPBiCG(m,ℓ) method ... parameters of the BiCGSTAB method are adopted at consecutive m iteration steps, and afterwards those...
  • svdpack

  • Referenced in 54 articles [sw04819]
  • SVDPACK comprises four numerical (iterative) methods for computing the singular value decomposition (SVD) of large ... software package implements Lanczos and subspace iteration-based methods for determining several of the largest...
  • ODEPACK

  • Referenced in 128 articles [sw08341]
  • that arise. Two others use iterative (preconditioned Krylov) methods instead of direct methods for these...
  • GQTPAR

  • Referenced in 238 articles [sw07451]
  • optimal solution in a finite number of iterations. We also consider the use of this ... algorithm in a trust region Newton’s method. In particular, we prove that under reasonable ... region method. In our tests a call to GQTPAR only required 1.6 iterations...
  • DEVEX

  • Referenced in 94 articles [sw08378]
  • code. Pivot column and row selection methods used by the Devex code since ... time. After a fresh look at the iteration process, the author introduces dynamic column weighting ... overall time and iteration advantages over the standard simplex methods used today. The final ... illustration highlights why these standard methods take so many iterations. These algorithms were originally coded...
  • tn

  • Referenced in 99 articles [sw05140]
  • exploited to define a modified Newton method which can be applied to problems that ... modified Lanczos algorithm requires up to n iterations to compute the search direction, where ... truncated Newton method is to terminate the iterations earlier. A preconditioned truncated Newton method...
  • BILUM

  • Referenced in 47 articles [sw04015]
  • direct method or a preconditioned iterative method...
  • RestoreTools

  • Referenced in 42 articles [sw04822]
  • Iterative methods for image deblurring: A Matlab object-oriented approach In iterative image restoration methods...
  • NSPCG

  • Referenced in 28 articles [sw00636]
  • equations by a variety of different iterative methods. One of the main purposes ... common modular structure for research on iterative methods for nonsymmetric matrices. Another purpose ... investigate the suitability of several iterative methods for vector computers.\parSince the vectorizability ... iterative method depends greatly on the matrix structure, NSPCG allows great flexibility in the operator...
  • IRAM

  • Referenced in 136 articles [sw08795]
  • method in the symmetric case). Using a truncated variant of the implicitly shifted QR-iteration ... Lanczos) vector on each iteration. This approach generalizes explicit restart methods. Advantages of the method...
  • SQPlab

  • Referenced in 76 articles [sw05161]
  • stands for Sequential Quadratic Programming, a method invented in the mid-seventies, which ... optimality conditions of the optimization problem. Each iteration of the SQP algorithm requires finding ... Newton method, the SQP algorithm converges very rapidly, meaning that it requires few iterations (hence ... from the small number of iterations required by the method. If the rule above does...
  • QMRPACK

  • Referenced in 72 articles [sw00754]
  • algorithm is a Krylov-subspace method for the iterative solution of large non-Hermitian linear...
  • HSL_MI20

  • Referenced in 32 articles [sw07246]
  • most effective iterative methods for the solution of large, sparse linear systems obtained from...
  • CVODES

  • Referenced in 28 articles [sw04946]
  • corresponding nonlinear iteration methods, as well as all linear solver and preconditioner modules are available...
  • PHYSALIS

  • Referenced in 25 articles [sw02386]
  • PHYSALIS: A new method for particle flow simulation. III: Convergence analysis of two-dimensional flows ... space. PHYSALIS is a recently proposed iterative method which computes the solution without imposing ... addressed is the convergence properties of the iterative procedure. In this paper, we present ... shown that convergence of the method can be achieved but the rate of convergence depends...
  • Fastcap

  • Referenced in 24 articles [sw08926]
  • with a multipole approximation to compute the iterates. This combination reduces the complexity so that ... conductors the multipole accelerated boundary element method can be nearly 500 times faster than Gaussian ... times faster than the iterative method alone, depending on required accuracy...