Do you want to publish a course? Click here

Conjugate gradient heatbath for ill-conditioned actions

105   0   0.0 ( 0 )
 Added by Giovanni Bussi
 Publication date 2008
  fields Physics
and research's language is English




Ask ChatGPT about the research

We present a method for performing sampling from a Boltzmann distribution of an ill-conditioned quadratic action. This method is based on heatbath thermalization along a set of conjugate directions, generated via a conjugate-gradient procedure. The resulting scheme outperforms local updates for matrices with very high condition number, since it avoids the slowing down of modes with lower eigenvalue, and has some advantages over the global heatbath approach, compared to which it is more stable and allows for more freedom in devising case-specific optimizations.



rate research

Read More

Fast computation of demagnetization curves is essential for the computational design of soft magnetic sensors or permanent magnet materials. We show that a sparse preconditioner for a nonlinear conjugate gradient energy minimizer can lead to a speed up by a factor of 3 and 7 for computing hysteresis in soft magnetic and hard magnetic materials, respectively. As a preconditioner an approximation of the Hessian of the Lagrangian is used, which only takes local field terms into account. Preconditioning requires a few additional sparse matrix vector multiplications per iteration of the nonlinear conjugate gradient method, which is used for minimizing the energy for a given external field. The time to solution for computing the demagnetization curve scales almost linearly with problem size.
Classical iterative algorithms for linear system solving and regression are brittle to the condition number of the data matrix. Even a semi-random adversary, constrained to only give additional consistent information, can arbitrarily hinder the resulting computational guarantees of existing solvers. We show how to overcome this barrier by developing a framework which takes state-of-the-art solvers and robustifies them to achieve comparable guarantees against a semi-random adversary. Given a matrix which contains an (unknown) well-conditioned submatrix, our methods obtain computational and statistical guarantees as if the entire matrix was well-conditioned. We complement our theoretical results with preliminary experimental evidence, showing that our methods are effective in practice.
Conjugate gradient methods for energy minimization in micromagnetics are compared. When the step length in the line search is controlled, conjugate gradient techniques are a fast and reliable way to compute the hysteresis properties of permanent magnets. The method is applied to investigate demagnetizing effects in NdFe12 based permanent magnets. The reduction of the coercive field by demagnetizing effects is 1.4 T at 450 K.
In this short note, we present a new technique to accelerate the convergence of a FFT-based solver for numerical homogenization of complex periodic media proposed by Moulinec and Suquet in 1994. The approach proceeds from discretization of the governing integral equation by the trigonometric collocation method due to Vainikko (2000), to give a linear system which can be efficiently solved by conjugate gradient methods. Computational experiments confirm robustness of the algorithm with respect to its internal parameters and demonstrate significant increase of the convergence rate for problems with high-contrast coefficients at a low overhead per iteration.
In this paper, we extend to the block case, the a posteriori bound showing superlinear convergence of Conjugate Gradients developed in [J. Comput. Applied Math., 48 (1993), pp. 327- 341], that is, we obtain similar bounds, but now for block Conjugate Gradients. We also present a series of computational experiments, illustrating the validity of the bound developed here, as well as the bound from [SIAM Review, 47 (2005), pp. 247-272] using angles between subspaces. Using these bounds, we make some observations on the onset of superlinearity, and how this onset depends on the eigenvalue distribution and the block size.
comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا