𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A counter example for the conjecture in ‘an algorithm for interpolation with units in H∞’

✍ Scribed by Vijay V. Patel; K.B. Datta

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
93 KB
Volume
31
Category
Article
ISSN
0005-1098

No coin nor oath required. For personal study only.

✦ Synopsis

It is conjectured by

Dorato et al. [Automatica, 25, 427-430 (1989)

], that the algorithm given by them for interpolation with units in H,, gives the lowest possible degree unit. A counter example presented in this technical communication shows that this is not the case for real as well as complex interpolation data.

📜 SIMILAR VOLUMES

An algorithm for interpolation with unit
An algorithm for interpolation with units in H∞, with applications to feedback stabilization
✍ Peter Dorato; Hong-Bae Park; Yunzhi Li 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 370 KB

AIwlr~tmThe problem of finding a unit in/-/~, i.e. an function the inverse of which is also/-/~, which interpolates to given points in the right-half plane has important applications in a number of feedback stabilization problems, i.e. strong stabilization and simultaneous stabilization. An algorith

An Algorithm for the Calculation of the
An Algorithm for the Calculation of the Electrical Potential Distribution in a Charged Capillary with General Electrolytes
✍ Yongxian Qian; Guangzheng Yang; W.Richard Bowen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 129 KB

restriction that the double layer thickness (k 01 ) was small Knowledge of the electrical potential distribution is an essential compared with the capillary radius r c . Rice and Whitehead basis for analyzing the flow behavior of electrolytes in a charged (2) extended Smoluchowski's results to narro

An exact algorithm for the batch sequenc
An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer
✍ A. Agnetis; F. Rossi; G. Gristina 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 295 KB 👁 2 views

This paper deals with the problem of makespan minimization in a flow shop with two machines when the input buffer of the second machine can only host a limited number of parts. Here we analyze the problem in the context of batch processing, i.e., when identical parts must be processed consecutively.

On the efficiency of VBSCF algorithms, a
On the efficiency of VBSCF algorithms, a comment on “An efficient algorithm for energy gradients and orbital optimization in valence bond theory”
✍ J. H. van Lenthe; H. B. Broer-Braam; Z. Rashid 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 726 KB

## Abstract We comment on the paper [Song et al., J. Comput. Chem. 2009, 30, 399]. and discuss the efficiency of the orbital optimization and gradient evaluation in the Valence Bond Self Consistent Field (VBSCF) method. We note that Song et al. neglect to properly reference Broer et al., who publis

A remark on the pressure for the Navier–
A remark on the pressure for the Navier–Stokes flows in 2-D straight channel with an obstacle
✍ H. Morimoto 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 136 KB

## Abstract Let T=ℝ×(‐1,1) and &ℴ⊂ℝ^2^ be a smoothly bounded open set, closure of which is contained in __T__. We consider the stationary Navier–Stokes flows in $\Omega {:=} T \backslash \bar{\scriptstyle{O}}$. In general, the pressure is determined up to a constant. Since Ω has two extremities, we