Numerical solution of soap film dual problems.
Previous Page 2
Displaying 21 – 24 of 24
Numerical Solution of the Obstacle Problem by the Penalty Method. Part II. Time-Dependent Problem.
Reinhard Scholz (1986)
Numerische Mathematik
Numerical solutions of the mass transfer problem
Serge Dubuc, Issa Kagabo (2006)
RAIRO - Operations Research
Let μ and ν be two probability measures on the real line and let c be a lower semicontinuous function on the plane. The mass transfer problem consists in determining a measure ξ whose marginals coincide with μ and ν, and whose total cost ∫∫ c(x,y)dξ(x,y) is minimum. In this paper we present three algorithms to solve numerically this Monge-Kantorovitch problem when the commodity being shipped is one-dimensional and not necessarily confined to a bounded interval. We illustrate these numerical...
Numerically stable algorithm for pole assignment of linear single-input systems
Petko Hr. Petkov, Nicolai D. Christov, Michail M. Konstantinov (1986)
Kybernetika
Currently displaying 21 – 24 of 24
Previous Page 2