FAST SOLUTION OF THE OBSTACLE PROBLEM

被引:0
作者
MEDINA, MA [1 ]
GONZALEZ, RLV [1 ]
机构
[1] UNIV NACL ROSARIO,FAC CIENCIAS EXACTAS INGN & AGRIMENSURA,DEPT MATEMAT,ROSARIO,ARGENTINA
关键词
OBSTACLE PROBLEM; FAST ALGORITHMS; NUMERICAL SOLUTIONS; VARIATIONAL INEQUALITIES;
D O I
10.1007/BF00941893
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
The purpose of this paper is to present a fast algorithm for the numerical solution of the one-dimensional obstacle problem. It is proven that the algorithm converges in a finite number of steps; application examples showing its efficiency are presented.
引用
收藏
页码:183 / 195
页数:13
相关论文
共 4 条
[1]  
Glowinski R., 1984, SPRINGER SERIES COMP
[2]  
Glowinski R., 1981, NUMERICAL ANAL VARIA
[3]   ON DETERMINISTIC CONTROL-PROBLEMS - AN APPROXIMATION PROCEDURE FOR THE OPTIMAL COST .1. THE STATIONARY PROBLEM [J].
GONZALEZ, R ;
ROFMAN, E .
SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 1985, 23 (02) :242-266
[4]  
Mosco U., 1971, CONSTRUCTIVE ASPECTS, VII, P497