3,879 research outputs found
A Self-learning Algebraic Multigrid Method for Extremal Singular Triplets and Eigenpairs
A self-learning algebraic multigrid method for dominant and minimal singular
triplets and eigenpairs is described. The method consists of two multilevel
phases. In the first, multiplicative phase (setup phase), tentative singular
triplets are calculated along with a multigrid hierarchy of interpolation
operators that approximately fit the tentative singular vectors in a collective
and self-learning manner, using multiplicative update formulas. In the second,
additive phase (solve phase), the tentative singular triplets are improved up
to the desired accuracy by using an additive correction scheme with fixed
interpolation operators, combined with a Ritz update. A suitable generalization
of the singular value decomposition is formulated that applies to the coarse
levels of the multilevel cycles. The proposed algorithm combines and extends
two existing multigrid approaches for symmetric positive definite eigenvalue
problems to the case of dominant and minimal singular triplets. Numerical tests
on model problems from different areas show that the algorithm converges to
high accuracy in a modest number of iterations, and is flexible enough to deal
with a variety of problems due to its self-learning properties.Comment: 29 page
Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method
Given the matrix polynomial , we
consider the associated polynomial eigenvalue problem. This problem, viewed in
terms of computing the roots of the scalar polynomial , is treated
in polynomial form rather than in matrix form by means of the Ehrlich-Aberth
iteration. The main computational issues are discussed, namely, the choice of
the starting approximations needed to start the Ehrlich-Aberth iteration, the
computation of the Newton correction, the halting criterion, and the treatment
of eigenvalues at infinity. We arrive at an effective implementation which
provides more accurate approximations to the eigenvalues with respect to the
methods based on the QZ algorithm. The case of polynomials having special
structures, like palindromic, Hamiltonian, symplectic, etc., where the
eigenvalues have special symmetries in the complex plane, is considered. A
general way to adapt the Ehrlich-Aberth iteration to structured matrix
polynomial is introduced. Numerical experiments which confirm the effectiveness
of this approach are reported.Comment: Submitted to Linear Algebra App
Logarithmic link smearing for full QCD
A Lie-algebra based recipe for smoothing gauge links in lattice field theory
is presented, building on the matrix logarithm. With or without hypercubic
nesting, this LOG/HYL smearing yields fat links which are differentiable w.r.t.
the original ones. This is essential for defining UV-filtered ("fat link")
fermion actions which may be simulated with a HMC-type algorithm. The effect of
this smearing on the distribution of plaquettes and on the residual mass of
tree-level O(a)-improved clover fermions in quenched QCD is studied.Comment: 29 pages, 7 figures; v2: improved text, includes comparison of
APE/EXP/LOG with optimized parameters, 3 references adde
Nonlinear Eigenvalues and Bifurcation Problems for Pucci's Operator
In this paper we extend existing results concerning generalized eigenvalues
of Pucci's extremal operators. In the radial case, we also give a complete
description of their spectrum, together with an equivalent of Rabinowitz's
Global Bifurcation Theorem. This allows us to solve equations involving Pucci's
operators
- …