✦ LIBER ✦

Unresolved computation and optimal predictions

✍ Scribed by Alexandre J. Chorin; Anton P. Kast; Raz Kupferman

Publisher: John Wiley and Sons
Year: 1999
Tongue: English
Weight: 195 KB
Volume: 52
Category: Article
ISSN: 0010-3640
DOI: 10.1002/(sici)1097-0312(199910)52:10<1231::aid-cpa3>3.0.co;2-c

No coin nor oath required. For personal study only.

✦ Synopsis

We present methods for predicting the solution of time-dependent partial differential equations when that solution is so complex that it cannot be properly resolved numerically, but when prior statistical information can be found. The sparse numerical data are viewed as constraints on the solution, and the gist of our proposal is a set of methods for advancing the constraints in time so that regression methods can be used to reconstruct the mean future. For linear equations we offer general recipes for advancing the constraints; the methods are generalized to certain classes of nonlinear problems, and the conditions under which strongly nonlinear problems and partial statistical information can be handled are briefly discussed. Our methods are related to certain data acquisition schemes in oceanography and meteorology.

📜 SIMILAR VOLUMES

On the computation of optimal singular a

On the computation of optimal singular and bang–bang controls

✍ S. A. Dadebo; K. B. McAuley; P. J. McLellan 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 111 KB 👁 2 views

To avoid difficulties associated with the computation of optimal singular/bang-bang controls, a common approach is to add a perturbed energy term. The efficacy of this perturbation method is assessed here via a direct search iterative dynamic programming procedure. A potential limitation of the stra

Optimal predictive densities and fractio

Optimal predictive densities and fractional moments

✍ Emanuele Taufer; Sudip Bose; Aldo Tagliani 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 162 KB 👁 1 views

## Abstract The maximum entropy approach used together with fractional moments has proven to be a flexible and powerful tool for density approximation of a positive random variable. In this paper we consider an optimality criterion based on the Kullback–Leibler distance in order to select appropria

Optimal control computation for integro-

Optimal control computation for integro-differential aerodynamic equations

✍ Gamal N. Elnagar 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 233 KB

Communicated by G

Computation of optimal control trajector

Computation of optimal control trajectories using Chebyshev polynomials: parameterization, and quadratic programming

✍ H. Jaddu; E. Shimemura 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 213 KB 👁 1 views

An algorithm is proposed to solve the optimal control problem for linear and nonlinear systems with quadratic performance index. The method is based on parameterizing the state variables by Chebyshev series. The control variables are obtained from the system state equations as a function of the appr

Individual Sarcomere Lengths in Whole Mu

Individual Sarcomere Lengths in Whole Muscle Fibers and Optimal Fiber Length Computation

✍ Benjamin W. Infantolino; Michael J. Ellis; John H. Challis 📂 Article 📅 2010 🏛 Wiley (John Wiley & Sons) 🌐 English ⚖ 397 KB

Optimal packet fragmentation and routing

Optimal packet fragmentation and routing in computer networks

✍ Orda, Ariel; Rom, Raphael 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 216 KB

The packet fragmentation problem in computer networks is that of breaking a packet into smaller pieces (fragments) due to packet-size limitations along the packet's route. This is a typical internetworking problem. We show that the commonly used simplistic approach whereby the routing and fragmentat