相关论文: Nonlinear Krylov Acceleration Applied to a Discret…

This paper introduces a nonlinear acceleration technique that accelerates the convergence of solution of transport problems with highly forward-peaked scattering. The technique is similar to a conventional high-order/low-order (HOLO)…

Although Anderson acceleration (AA) is known to speed up fixed-point iterations, it is rarely applied in constrained optimization, in particular sequential quadratic programming (SQP). We show that the local convergence behavior of a…

In this work we investigate the use of the Analytical Discrete Ordinates (ADO) method when solving the spectral approximation of the nonclassical transport equation. The spectral approximation is a recently developed method based on the…

We propose two techniques aimed at improving the convergence rate of steady state and eigenvalue solvers preconditioned by the inverse Stokes operator and realized via time-stepping. First, we suggest a generalization of the Stokes operator…

Probabilistic estimates on linear combinations of eigenvalues of the one dimensional Anderson model are derived. So far only estimates on the density of eigenvalues and of pairs were found by Wegner and by Minami. Our work was motivated by…

The problem of finding roots or solutions of a nonlinear partial differential equation may be formulated as the problem of minimizing a sum of squared residuals. One then defines an evolution equation so that in the asymptotic limit a…

Empirical results show that Anderson acceleration (AA) can be a powerful mechanism to improve the asymptotic linear convergence speed of the Alternating Direction Method of Multipliers (ADMM) when ADMM by itself converges linearly. However,…

This paper primarily presents numerical results for the Anderson accelerated Newton method on a set of benchmark problems. The results demonstrate superlinear convergence to solutions of both degenerate and nondegenerate problems. The…

We consider Broyden's method and some accelerated schemes for nonlinear equations having a strongly regular singularity of first order with a one-dimensional nullspace. Our two main results are as follows. First, we show that the use of a…

We apply the recently proposed quasi-classical approach for a second quantized many-electron Hamiltonian in Cartesian coordinates [J. Chem. Phys. 137, 154107 (2012)] to correlated nonequilibrium quantum transport. The approach provides…

In this paper, we propose an Anderson-accelerated stochastic extragradient algorithm for solving a class of stochastic variational inequalities, by incorporating Anderson acceleration into the stochastic extragradient method under a…

A novel theoretical convergence rate estimate for a Balancing Domain Decomposition by Constraints algorithm is proven for the solution of the cardiac Bidomain model, describing the propagation of the electric impulse in the cardiac tissue.…

We consider a multimarginal optimal transport, which includes as a particular case the Wasserstein barycenter problem. In this problem one has to find an optimal coupling between $m$ probability measures, which amounts to finding a tensor…

The alternating direction multiplier method (ADMM) is widely used in computer graphics for solving optimization problems that can be nonsmooth and nonconvex. It converges quickly to an approximate solution, but can take a long time to…

In this paper, by introducing a class of relaxed filtered Krylov subspaces, we propose the relaxed filtered Krylov subspace method for computing the eigenvalues with the largest real parts and the corresponding eigenvectors of non-symmetric…

This contribution introduces a model order reduction approach for an advection-reaction problem with a parametrized reaction function. The underlying discretization uses an ultraweak formulation with an $L^2$-like trial space and an…

We provide rigorous theoretical bounds for Anderson acceleration (AA) that allow for approximate calculations when applied to solve linear problems. We show that, when the approximate calculations satisfy the provided error bounds, the…

In this paper, an inexact Newton method for solving real-valued nonlinear eigenvalue problems with eigenvector dependency (NEPv) is introduced that is able to solve the problem on a matrix level. Our main contribution is to derive a variant…

We formulate two classes of first-order algorithms more general than previously studied for minimizing smooth and strongly convex or, respectively, smooth and convex functions. We establish sufficient conditions, via new discrete Lyapunov…

In the paper possible local and nonlocal reductions of the Ablowitz-Kaup-Newell-Suger (AKNS) hierarchy are collected, including the Korteweg-de Vries (KdV) hierarchy, modified KdV hierarchy and their nonlocal versions, nonlinear…