Abstract
Complex Kalman filters are used to process complex signals that are ubiquitous in many fields of science and engineering. The augmented complex Riccati equation appears for time-invariant augmented or widely linear models. The augmented complex Lyapunov equation is derived in the infinite measurement noise case. Iterative per step and doubling algorithms for the solution of the complex Lyapunov equation are derived. The computational requirements of the per step and doubling algorithms are derived, leading to the ability to select the faster algorithm.
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
References
Anderson BDO, Moore JB (2005) Optimal filtering. Dover books on engineering, Dover Publ, Mineola, NY, dover ed., unabridged republ edn.
Assimakis N, Adam M (2007) Discrete time Kalman and Lainiotis filters comparison. Int J Math Anal (IJMA) 1(13):635–659
Assimakis N, Adam M (2020) Fast doubling algorithm for the solution of the Riccati equation using cyclic reduction method. In: 2020 international conference on mathematics and computers in science and engineering (MACISE), pp 1–5. https://doi.org/10.1109/MACISE49704.2020.00007
Assimakis N, Adam M (2022) Fast iterative solutions of Riccati and Lyapunov equations. Open Math 20(1):1845–1857. https://doi.org/10.1515/math-2022-0546
Coskun H, Achilles F, DiPietro R, Navab N, Tombari F (2017) Long short-term memory Kalman filters: Recurrent neural estimators for pose regularization. In: 2017 IEEE international conference on computer vision (ICCV). IEEE, Venice, pp 5525–5533. https://doi.org/10.1109/ICCV.2017.589, http://ieeexplore.ieee.org/document/8237851/
Dini DH, Mandic DP (2012) Class of widely linear complex Kalman filters. IEEE Trans Neural Netw Learn Syst 23(5):775–786. https://doi.org/10.1109/TNNLS.2012.2189893
Dong L, Li J (2021) A new class of complex nonsymmetric algebraic Riccati equations with its \(\omega \) -comparison matrix being an irreducible singular m-matrix. Int J Comput Math 98(1):75–105. https://doi.org/10.1080/00207160.2020.1729358
Durrant-Whyte H, Bailey T (2006) Simultaneous localization and map**: part I. IEEE Robot Autom Mag 13(2):99–110. https://doi.org/10.1109/MRA.2006.1638022
Harvey AC (1989) Forecasting, structural time series models, and the Kalman filter. Cambridge University Press, Cambridge, New York
Hernández-Verón M, Romero N (2018) Existence, localization and approximation of solution of symmetric algebraic Riccati equations. Comput Math Appl 76(1):187–203. https://doi.org/10.1016/j.camwa.2018.04.014
Lapidoth A (2009) A foundation in digital communication. Cambridge University Press, Cambridge, New York
Mohammadi A, Plataniotis KN (2015) Structure-induced complex Kalman filter for decentralized sequential Bayesian estimation. IEEE Signal Process Lett 22(9):1419–1423. https://doi.org/10.1109/LSP.2015.2407196
Nakhmani A (2020) Modern control: state-space analysis and design methods. McGraw Hill, New York [NY]
Wang G, Ge SS, Xue R, Zhao J, Li C (2019) Complex-valued Kalman filters based on Gaussian entropy. Signal Process 160:178–189. https://doi.org/10.1016/j.sigpro.2019.02.024
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Polyzos, A., Tsinos, C., Adam, M., Assimakis, N. (2024). Faster Complex Lyapunov Equation Solution Selection. In: Farmanbar, M., Tzamtzi, M., Verma, A.K., Chakravorty, A. (eds) Frontiers of Artificial Intelligence, Ethics, and Multidisciplinary Applications. FAIEMA 2023. Frontiers of Artificial Intelligence, Ethics and Multidisciplinary Applications. Springer, Singapore. https://doi.org/10.1007/978-981-99-9836-4_11
Download citation
DOI: https://doi.org/10.1007/978-981-99-9836-4_11
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-99-9835-7
Online ISBN: 978-981-99-9836-4
eBook Packages: Business and ManagementBusiness and Management (R0)