Fast Algorithms for Nonsmooth Compact Fixed-Point Problems

DOI10.1137/0729099zbMath0763.65040OpenAlexW2092855431WikidataQ58048171 ScholiaQ58048171MaRDI QIDQ4031692

No author found.

Publication date: 1 April 1993

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0729099

zbMATH Keywords

convergencenumerical examplesintegral equationsfast algorithmmultilevel algorithmscompetitive systemscombat modelingcompact fixed point problemsnondifferentiable nonlinear equations

Mathematics Subject Classification ID

Iterative procedures involving nonlinear operators (47J25) Numerical methods for integral equations (65R20) Other nonlinear integral equations (45G10) Fixed-point theorems (47H10) Numerical solutions to equations with nonlinear operators (65J15)

Related Items (18)

A parameterized Newton method and a quasi-Newton method for nonsmooth equations ⋮ Globally convergent algorithms for nonsmooth nonlinear equations in computational fluid dynamics. ⋮ Newton-like methods for solving underdetermined nonlinear equations with nondifferentiable terms ⋮ Superlinear convergence of smoothing quasi-Newton methods for nonsmooth equations ⋮ A verification method for solutions of nonsmooth equations ⋮ A convergence ball for multistep simplified newton-like methods ⋮ Convergence estimates for solution of integral equations with GMRES ⋮ Multilevel source iteration accelerators for the linear transport equation in slab geometry ⋮ The numerical solution of a control problem governed by a phase filed model ⋮ A modification of Newton's method for nondifferentiable equations. ⋮ On the convergence of some quasi-Newton methods for nonlinear equations with nondifferentiable operators ⋮ Anderson Acceleration for a Class of Nonsmooth Fixed-Point Problems ⋮ Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities ⋮ A minimax problem for semilinear nonlocal competitive systems ⋮ Smoothing methods for nonsmooth, nonconvex minimization ⋮ Numerical methods for nonlinear equations ⋮ On preconditioned Uzawa methods and SOR methods for saddle-point problems ⋮ Historical developments in convergence analysis for Newton's and Newton-like methods

This page was built for publication: Fast Algorithms for Nonsmooth Compact Fixed-Point Problems