Open Access. Powered by Scholars. Published by Universities.®

Numerical Analysis and Computation Commons™

Open Access. Powered by Scholars. Published by Universities.®

Mathematics

2005

Articles 1 - 3 of 3

Full-Text Articles in Numerical Analysis and Computation

Remarks On Risk-Sensitive Control Problems, José Luis Menaldi, Maurice Robin Oct 2005

Remarks On Risk-Sensitive Control Problems, José Luis Menaldi, Maurice Robin

Mathematics Faculty Research Publications

The main purpose of this paper is to investigate the asymptotic behavior of the discounted risk-sensitive control problem for periodic diffusion processes when the discount factor α goes to zero. If uα(θ, x) denotes the optimal cost function, being the risk factor, then it is shown that limα→0αuα(θ, x) = ξ(θ) where ξ(θ) is the average on ]0, θ[ of the optimal cost of the (usual) in nite horizon risk-sensitive control problem.

Go to article

Time-Dependent Thermal Imaging Of Circular Inclusions, Donald L. Brouwn, Mark Hubenthal Jul 2005

Time-Dependent Thermal Imaging Of Circular Inclusions, Donald L. Brouwn, Mark Hubenthal

Mathematical Sciences Technical Reports (MSTR)

This paper considers the inverse problem of locating one or more circular inclusions in a two-dimensional domain using thermal boundary data, specifically, the input heat flux and measured boundary temperature. The forward problem is governed by the heat equation. We show how the position and size of such defects can be recovered using the boundary data and various approximations of the solution to the forward problem. We also consider the stability of the algorithm involved to recover the defects.

Go to article

Lower Bounds For Simplicial Covers And Triangulations Of Cubes, Adam Bliss '03, Francis E. Su Apr 2005

Lower Bounds For Simplicial Covers And Triangulations Of Cubes, Adam Bliss '03, Francis E. Su

All HMC Faculty Publications and Research

We show that the size of a minimal simplicial cover of a polytope P is a lower bound for the size of a minimal triangulation of P, including ones with extra vertices. We then use this fact to study minimal triangulations of cubes, and we improve lower bounds for covers and triangulations in dimensions 4 through at least 12 (and possibly more dimensions as well). Important ingredients are an analysis of the number of exterior faces that a simplex in the cube can have of a specified dimension and volume, and a characterization of corner simplices in terms of their …

Go to article