On complete set of solutions for polynomial matrix equations
✍ Scribed by L. Jódar; E. Navarro
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 245 KB
- Volume
- 3
- Category
- Article
- ISSN
- 0893-9659
No coin nor oath required. For personal study only.
✦ Synopsis
In this paper we introduce the concept of co-solution of a polynomial matrix equation which permits us to obtain necessary and suthcient conditions so that a set of solutions be a complete set.
📜 SIMILAR VOLUMES
In this paper we introduce the concept of rectangular co-solution of a polynomial matrix equation which permit us to obtain a description of the general solution of systems of higher order differential equations with constant coefficients in a way analogous to the scalar case.
We present a complete and practical algorithm which can determine the number of distinct real solutions of a given polynomial system of equations and inequalities with integer coefficients mechanically. Based on this algorithm, a program called nearsolve has been implemented in Maple. The algorithm
The genuine multireference approaches, including multireference coupled-cluster (MRCC) methods of the state-universal and valence-universal type, are based on the generalized Bloch equation. Unlike the Schrödinger equation, the Bloch equation is nonlinear and has multiple solutions. In this study, t