Convergence of the EDIIS algorithm for nonlinear equations
From MaRDI portal
Recommendations
- Convergence analysis of adaptive DIIS algorithms with application to electronic ground state calculations
- On one-point iterations and DIIS
- An analysis for the DIIS acceleration method used in quantum chemistry calculations
- Convergence analysis for Anderson acceleration
- Anderson acceleration for fixed-point iterations
Cites work
- scientific article; zbMATH DE number 3147499 (Why is no real title available?)
- scientific article; zbMATH DE number 3523319 (Why is no real title available?)
- scientific article; zbMATH DE number 781821 (Why is no real title available?)
- A characterization of the behavior of the Anderson acceleration on linear problems
- Algorithms for bound constrained quadratic programming problems
- An analysis for the DIIS acceleration method used in quantum chemistry calculations
- An assessment of coupling algorithms for nuclear reactor core physics simulations
- Anderson acceleration for fixed-point iterations
- Convergence analysis for Anderson acceleration
- Design and Application of a Gradient-Weighted Moving Finite Element Code I: in One Dimension
- Direct minimization for calculating invariant subspaces in density functional computations of the electronic structure
- Elliptic preconditioner for accelerating the self-consistent field iteration in Kohn-Sham density functional theory
- Iterative Procedures for Nonlinear Integral Equations
- Krylov Subspace Acceleration of Nonlinear Multigrid with Application to Recirculating Flows
- Krylov subspace acceleration for nonlinear multigrid schemes
- Local improvement results for Anderson acceleration with inaccurate function evaluations
- Nonlinear Krylov and moving nodes in the method of lines
- Numerical methods for electronic structure calculations of materials
- Numerical methods in bifurcation problems. Lectures delivered at the Indian Institute of Science, Bangalore, under the T.I.F.R.-I.I.Sc. Programme in Applications of Mathematics. Notes by A. K. Nandakumaran and Mythily Ramaswamy
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds
- Solution by iteration of H-equations in multigroup neutron transport
- Solution ofH-Equations by Iteration
- Some probability distributions for neutron transport in a half-space
- The quasi-Newton least squares method: A new and fast secant method analyzed for linear systems
- Two classes of multisecant methods for nonlinear acceleration
Cited in
(12)- Anderson acceleration preconditioned tensor splitting approach for tensor absolute value equation
- Anderson Acceleration for Nonsmooth Fixed Point Problems
- Dynamic systems coupled with solutions of stochastic nonsmooth convex optimization
- Anderson acceleration of gradient methods with energy for optimization problems
- Anderson Accelerated Douglas--Rachford Splitting
- Secant Acceleration of Sequential Residual Methods for Solving Large-Scale Nonlinear Systems of Equations
- An extra gradient Anderson-accelerated algorithm for pseudomonotone variational inequalities
- Anderson acceleration for a class of nonsmooth fixed-point problems
- Convergence of a Constrained Vector Extrapolation Scheme
- Dynamic Stochastic Variational Inequalities and Convergence of Discrete Approximation
- Anderson accelerating the preconditioned modulus approach for linear complementarity problems on second-order cones
- Convergence analysis of adaptive DIIS algorithms with application to electronic ground state calculations
Describes a project that uses
Uses Software
This page was built for publication: Convergence of the EDIIS algorithm for nonlinear equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4613510)
