𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An explicit formula for the generalized Hermitian interpolation problem

✍ Scribed by El-Zafrany, A. M. ;Cookson, R. A.

Publisher
Wiley (John Wiley & Sons)
Year
1985
Tongue
English
Weight
206 KB
Volume
1
Category
Article
ISSN
0748-8025

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

CLOSED FORMULAE FOR THE GENERALIZED β„‹βˆž S
CLOSED FORMULAE FOR THE GENERALIZED β„‹βˆž SENSITIVITY MINIMIZATION PROBLEM
✍ Keith G. Woodgate πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 258 KB

The paper presents a complete solution for the multivariable, continuous-time Generalized H (GH ) sensitivity minimization problem. In contrast with existing solutions, derived via polynomial methods, the state-space solution given here is essentially non-iterative. Closed formulae for the minimum a

An explicit closed-form solution to the
An explicit closed-form solution to the limited-angle discrete tomography problem for finite-support objects
✍ Andrew E. Yagle πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 101 KB πŸ‘ 2 views

An explicit formula is presented for reconstructing a This article derives an explicit formula for the integer values finite-support object defined on a lattice of points and taking on inteof a finite support object, defined on a lattice, from its projections ger values from a finite number of its d

An Incremental Algorithm for a Generaliz
An Incremental Algorithm for a Generalization of the Shortest-Path Problem
✍ G. Ramalingam; Thomas Reps πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 363 KB

The grammar problem, a generalization of the single-source shortest-path prob-Ž Ž . Ž . . lem introduced by D. E. Knuth Inform. Process. Lett. 6 1 1977 , 1᎐5 is to compute the minimum-cost derivation of a terminal string from each nonterminal of a given context-free grammar, with the cost of a deriv