Manipulation of Matrices Symbolically
暂无分享,去创建一个
Traditionally, matrix algebra in computer algebra systems is “implemented” in three ways: • numeric explicit computation in a special arithmetic domain: exact rational or integer, highprecision software floating-point, interval, or conventional hardware floating-point. • ‘symbolic’ explicit computation with polynomial or other expression entries, • (implicit) matrix computation with symbols defined over a (non-commuting) ring. Manipulations which involve matrices of indefinite size (n ×m) or perhaps have components which are block submatrices of indefinite size have little or no support in general-purpose computer algebra systems, in spite of their importance in theorems, proofs, and generation of programs. We describe some efforts to design and implement tools for this mode of thinking about matrices in computer systems.
[1] Daniel Richardson,et al. Some undecidable problems involving elementary functions of a real variable , 1969, Journal of Symbolic Logic.
[2] John R. Pierce,et al. Symbols, Signals, and Noise: The Nature and Process of Communication. , 1961 .