2014
DOI: 10.1007/s10543-014-0514-0
|View full text |Cite
|
Sign up to set email alerts
|

A damped semismooth Newton method for the Brugnano–Casulli piecewise linear system

Abstract: The piecewise linear system is a nonsmooth but semismooth equation. In this paper, a damped semismooth Newton method is presented for solving a class of piecewise linear systems. Under appropriate conditions, both monotone convergence and finite termination properties are investigated for the proposed method.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 8 publications
(1 citation statement)
references
References 25 publications
0
1
0
Order By: Relevance
“…Generalized Newton methods have been extensively studied for solving piecewise linear systems, such as linear complementarity problems arising from the discretization of American options pricing problems [23] and obstacle problems [16], the discrete HJB equation [2,29] and piecewise linear systems arising in the numerical solution of the free-surface hydrodynamics models [3,4,28]. It has been verified that this type of methods possess a finite termination property, i.e., they are able to find a solution in a finite number of iterations under suitable conditions [2,3,10,12,27,28]. In addition, if the generalized Jacobi matrix is an M-matrix, these methods converge globally.…”
Section: Introductionmentioning
confidence: 99%
“…Generalized Newton methods have been extensively studied for solving piecewise linear systems, such as linear complementarity problems arising from the discretization of American options pricing problems [23] and obstacle problems [16], the discrete HJB equation [2,29] and piecewise linear systems arising in the numerical solution of the free-surface hydrodynamics models [3,4,28]. It has been verified that this type of methods possess a finite termination property, i.e., they are able to find a solution in a finite number of iterations under suitable conditions [2,3,10,12,27,28]. In addition, if the generalized Jacobi matrix is an M-matrix, these methods converge globally.…”
Section: Introductionmentioning
confidence: 99%