On the best approximation matrix problem for integrable matrix functions
✍ Scribed by Defez Emilio; Jódar Lucas
- Publisher
- Springer
- Year
- 2000
- Tongue
- English
- Weight
- 656 KB
- Volume
- 16
- Category
- Article
- ISSN
- 1573-8175
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The four block problem is a generalization of Nehari's problem for matrix functions. It plays an important role in H -optimal control theory. It is well known that Nehari's problem for a continuous scalar function has a unique solution. However, in the matrix case the situation is quite different. V
A best matrix approximation technique for updating the analytical model is developed using the known modal parameters. Firstly, the known modal matrix is decomposed by means of the singular-value decomposition technique. Secondly, the general updating equations for the analytical model are obtained
The papers deals with a finite moment problem for rational matrix-valued functions. We present a necessary and sufficient condition for the solvability of the problem. In the nondegenerate case we construct a particular solution which has interesting extremal properties.
A general expression for the operational matrix of integration P for the case of Bessel functions is derived. Using this P, several problems such as identiJication, analysis and optimal control may be studied. Examples are included to illustrate the theoretical results.
An explicit proof is given that no sequence of quasi-classical adiabatic approximations in which intrinsic symmetry re. strictions are relased in any way can give an approprhtely approximated partition function sm;Fller than the one diRctly obtainable in the absence of such a sequence.