• GenASPI

  • Referenced in 5 articles [sw19575]
  • propose a Generic Approximate Sparse Inverse (GenASPI) matrix algorithm based on ILU(0) factorization ... Generic Approximate Banded Inverse (GenAbI), which is a banded approximate inverse used in conjunction with ... systems. The proposed GenASPI matrix algorithm, is based on Approximate Inverse Sparsity patterns, derived from...
  • CMA-ES

  • Referenced in 124 articles [sw05063]
  • evolutionary algorithms and evolutionary computation. An evolutionary algorithm is broadly based on the principle ... matrix. The covariance matrix adaptation (CMA) is a method to update the covariance matrix ... conditioned. Adaptation of the covariance matrix amounts to learning a second order model ... objective function similar to the approximation of the inverse Hessian matrix in the Quasi-Newton...
  • QUIC

  • Referenced in 34 articles [sw11795]
  • QUIC: quadratic approximation for sparse inverse covariance estimation. The ℓ 1 -regularized Gaussian maximum likelihood ... statistical guarantees in recovering a sparse inverse covariance matrix, or alternatively the underlying graph structure ... very limited samples. We propose a novel algorithm for solving the resulting optimization problem which ... algorithm is based on Newton’s method and employs a quadratic approximation, but with some...
  • ADMiRA

  • Referenced in 35 articles [sw31664]
  • rank matrix posing the inverse problem as an approximation problem with a specified target rank ... minimum rank solution satisfying a prescribed data approximation bound. We propose an atomic decomposition providing ... rank matrix and extending efficient greedy algorithms from the vector to the matrix case...
  • PaFiBo-OBGAIM

  • Referenced in 2 articles [sw19565]
  • Optimized Banded Generalized Approximate Inverse Matrix (OBGAIM) algorithm is achieved based on the concept...
  • PEPBICG-STAB

  • Referenced in 2 articles [sw19566]
  • Optimized Banded Generalized Approximate Inverse Matrix (OBGAIM) algorithm is achieved based on the concept...
  • FaIMS

  • Referenced in 9 articles [sw06425]
  • Helmholtz equation We propose an algorithm to compute an approximate singular value decomposition ... accelerate matrix-vector multiplications and to precondition iterative solvers.par We describe the algorithm ... context of an inverse scattering problem for the low-frequency time-harmonic wave equation with ... background medium and, by invoking the Born approximation, we obtain a linear least-squares problem...
  • DGMRES

  • Referenced in 15 articles [sw02839]
  • Krylov subspace methods were derived for Drazin-inverse solution of consistent or inconsistent linear systems ... singular and in general non-hermitian matrix that has arbitrary index. One of these methods ... approximations produced by DGCR exist, and a GMRES like algorithm, denoted DGMRES, for its implementation...
  • DFEM

  • Referenced in 1 article [sw03191]
  • speed up a DFEM algorithm mainly through approximate matrix inversion and optimization...
  • BCCG+FAI

  • Referenced in 10 articles [sw12124]
  • based on the Conjugate Gradients (CG) algorithm and that uses FFTs. A first novel aspect ... based Approximate Inverse” preconditioner. The underlying idea is that the inverse matrix can be approximated...
  • lbfgs

  • Referenced in 2 articles [sw26415]
  • iteratively computing approximations of the inverse Hessian matrix. The OWL-QN algorithm finds the optimum...
  • Exa-Dune

  • Referenced in 13 articles [sw32962]
  • have developed, implemented and optimised numerical algorithms and software for the scalable solution of partial ... methods have included GPU-based sparse approximate inverses, matrix-free sum-factorisation for high-order ... discontinuous Galerkin discretisations as well as partially matrix-free preconditioners. On top of that, additional ... multiscale methods and the multilevel Monte-Carlo algorithm. Finally, some of the concepts are applied...
  • VASP

  • Referenced in 16 articles [sw19550]
  • equations, or within the Hartree-Fock (HF) approximation, solving the Roothaan equations. Hybrid functionals that ... efficient iterative matrix diagonalisation techniques, like the residual minimisation method with direct inversion ... iterative subspace (RMM-DIIS) or blocked Davidson algorithms. These are coupled to highly efficient Broyden...
  • AlgoPy

  • Referenced in 10 articles [sw16107]
  • compute derivatives of arbitrary order and Taylor approximations of such programs. The approach is based ... polynomial arithmetic and matrix calculus in the (combined) forward/reverse mode of Algorithmic Differentiation ... elementary functions. Instead, dedicated algorithms for the matrix product, matrix inverse and the Cholesky...
  • DynaThinLayer

  • Referenced in 5 articles [sw08738]
  • wide applications in petroleum exploration, geophysical inversion, nondestructive evaluation of highway and airport pavement structures ... propagation in stratified media. It approximates the stiffness matrix involving transcendental functions by truncating ... Taylor series of the stiffness matrix to the fourth order term. A generalized eigenvalue problem ... then formulated, which allows an efficient numerical algorithm to be designed in a computer program...
  • FIDAP

  • Referenced in 37 articles [sw00006]
  • FIDAP (A Fluid Dynamics Analysis Program). This paper...
  • 2LEV-D2P4

  • Referenced in 11 articles [sw00009]
  • We present a package of parallel preconditioners which...
  • ADOL-C

  • Referenced in 257 articles [sw00019]
  • ADOL-C: Automatic Differentiation of C/C++. We present...