Abstract
We analyze the linear algebraic transition system (LATS) using algebraic theory. For transiting computing of linear algebraic transition system (LATS), we propose a concept of k-times maximum approximate transiting about (B, ε) which B is used to approximating compute for powers of the matrix A of the LATS. ε is maximum absolute error. This method can improve computational speed and conserve memory of computer program which can be modeled by the algebraic transition system. Further more, the theory and its function are verified by a practical example.
This Work is Support by Grants (HCIC201101 ) of Guangxi Key Laboratory of Hybrid Computational and IC Design Analysis Open Fund, the National Natural Science Foundation of China under Grant No. 60873118 and 60973147, the Natural Science Foundation of Guangxi under Grant No. 2011GXNSFA018154, the Science and Technology Foundation of Guangxi under Grant No. 10169-1, and Guangxi Scientific Research Project No.201012MS274.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hochbruck, M.: On Krylov Subspace Approximations to the Matrix Exponential Operator. SIAM Journal on Numerical Analysis, 1911–1925 (1994)
Frieze, A., Kanna, R.: Fast Monte-Carlo Algorithms For Finding Low-Rank Approximations. Journal of the ACM (JACM), 1025–1041 (2004)
Drineas, P., Kannan, R., Mahoney, M.W.: Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition. SIAM Journal on Computing, 184–206 (2006)
Drineas, P., Kannan, R.: Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication. SIAM Journal on Computing, 132–157 (2006)
Van, J., Eshof, D.: Preconditioning Lanczos Approximations To The Matrix Exponential. SIAM Journal on Scientific Computing, 1438–1457 (2006)
Moret, I.: RD-Rational Approximations of The Matrix Exponential. BIT Numerical Mathematics, 595–615 (2004)
Zanna, A.: Generalized Polar Decompositions For The Approximation of The Matrix Exponential. SIAM Journal on Matrix Analysis and Applications 23, 840–862 (2002)
Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems: Safety. Springer, New York (1995)
Meyer, C.D.: Convergent Powers of a Matrix with Applications to Iterative Methods for Singular Linear Systems. SIAM Journal on Numerical Analysis, 699–712 (1977)
Thomason, M.G.: Convergence of Powers of a Fuzzy Matrix. Journal of Mathematical Analysis and Applications, 476–480 (1977)
Hashimoto, H.: Convergence Of Powers Of A Fuzzy Transitive Matrix. Fuzzy Sets and Systems, 153–160 (1983)
Sriram, S.: Non-linear Loop Invariant Generation using GROBNER Bases. ACM SIGPLAN Notices, 318–329 (2004)
Stewart, G.W.: Matrix Perturbation Theory (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, Z., Wu, JZ., Yang, H. (2012). Approximation to Linear Algebraic Transition System. In: Huang, DS., Gupta, P., Zhang, X., Premaratne, P. (eds) Emerging Intelligent Computing Technology and Applications. ICIC 2012. Communications in Computer and Information Science, vol 304. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31837-5_49
Download citation
DOI: https://doi.org/10.1007/978-3-642-31837-5_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31836-8
Online ISBN: 978-3-642-31837-5
eBook Packages: Computer ScienceComputer Science (R0)