Abstract
In this paper we consider a series of algorithms for calculating radicals of matrix polynomial equations. A particular aspect of this problem arise in author’s work, concerning parameter identification of linear dynamic stochastic system. Special attention is given to searching the solution of an equation in a neighbourhood of some initial approximation.
The offered approaches and algorithms allow us to receive fast and quite exact solution. We give some recommendations for application of given algorithms.
Similar content being viewed by others
References
R.A. Horn, C.R. Johnson,Matrix Analysis, Cambrige Univ. Press, Cambrige, 1986.
R. Iserman, U. Baur, W. Bamberger, P. Kneppo, H. Siebert,Comparision of six on line identification and parameter estimation methods, Automatica, 1984, vol. 10, No. 1, pp. 81–103.
D. Kahaner, C. Moler, S. Nash,Numerical Methods and Software, Prentice-Hall Inc., New York, 1989.
R.K. Mehra,On line identification of linear dynamic systems with applications to Kalman filtering, IEEE Transactions on Automatic Control, 1971, vol. AC-16, No. 1, pp. 12–21.
J.M. Ortega,Introduction to Parallel and Vector Solution of Linear Systems, Plenum Press, New York, 1988.
G.W. Stewart,Introduction to matrix computations, Acadimic Press, Orlando, Florida, 1973.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Dulov, E.V. Algorithms for solving matrix polynomial equations of special form. Korean J. Comput. & Appl. Math 7, 41–60 (2000). https://doi.org/10.1007/BF03009927
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF03009927