×

Computational matrix representation modules for linear operators with explicit constructions for a class of Lie operators. (English) Zbl 0932.65052

The authors develop a procedure for constructing matrix representations for a class of linear operators on finite-dimensional spaces. First serial number functions for locating basis monomials in the linear space of homogeneous polynomials of fixed degree, ordered under structural lexicographic are presented. Next basic lemmas describing the modular structure of matrix representations for operators constructed conically from elementary operators are presented.
Using these results, explicit matrix representations are then given for the Lie derivative and Lie-Poisson bracket operators defined on spaces of homogeneous polynomials. In particular, they are comprized of blocks obtained as Kronecker sums of modular components, each corresponding to specific Jordan blocks. At an implementation level, recursive programming is applied to construct these modular components explicitly.
The results are also applied to computing power series approximations for the center manifold of a dynamical system. In this setting, the linear operator of interest is parameterized by two matrices, a generalization of the Lie-Poisson bracket.
Reviewer: P.Narain (Bombay)

MSC:

65F30 Other matrix algorithms (MSC2010)
15A60 Norms of matrices, numerical range, applications of functional analysis to matrix theory
37M15 Discretization methods and integrators (symplectic, variational, geometric, etc.) for dynamical systems
65P10 Numerical methods for Hamiltonian systems including symplectic integrators
Full Text: DOI

References:

[1] Ashkenazi, M.; Chow, S.-N., Normal forms near critical points for differential equations and maps, IEEE Trans. Circuits Systems, 35, 850-862 (1988) · Zbl 0702.34033
[2] Abraham, R.; Marsden, J. E., Foundations of Mechanics (1978), Benjamin/Cumming: Benjamin/Cumming Menlo Park, CA · Zbl 0393.70001
[3] Arnold, V. I., Geometric Methods in the Theory of Ordinary Differential Equations (1983), Springer: Springer New York · Zbl 0507.34003
[4] Casti, J. L., Nonlinear Systems Theory (1985), Academic Press: Academic Press Orlando · Zbl 0555.93028
[5] Fu, J.-H.; Miller, D. F., On the matrix method for generalized Poincaré normal form reduction, Random Comput. Dynam., 5, 124-144 (1997) · Zbl 0885.65084
[6] Fu, J.-H.; Miller, D. F., Optimal near identity transformation scheduling for generalized Poincaré normal form reduction, Random Comput. Dynam., 5, 144-158 (1997) · Zbl 0884.65071
[7] Guckenheimer, J.; Holmes, P., Nonlinear Oscillations, Dynamical Systems, and Bifurcation of Vector Fields (1985), Springer: Springer New York
[8] Isidori, A., Nonlinear Control Systems: An Introduction (1985), Springer: Springer Berlin · Zbl 0569.93034
[9] de Jager, B., The use of symbolic computation in nonlinear control: is it viable?, IEEE Trans. Automat. Control, AC-40, 1, 84-89 (1995) · Zbl 0925.93215
[10] (Kowalik, J. S., Coupling Symbolic and Numerical Computing in Expert Systems (1986), Elsevier Science: Elsevier Science New York)
[11] Knuth, D. E., The Art of Computer Programming, vol. 1: Fundamental Algorithms (1975), Addison-Wesley: Addison-Wesley Pasadena · Zbl 0191.17903
[12] Sontag, E. D., Mathematical Control Theory (1990), Springer: Springer New York · Zbl 0844.93012
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.