A scalable Kalman filter algorithm: Trustworthy analysis on constrained least square model. (5th October 2020)

• Record Type: Journal Article
• Authors: D'Amore, Luisa; Cacciapuoti, Rosalba; Mele, Valeria
• Other Names: Jeon Gwanggil guestEditor.; Abdellah Chehri guestEditor.; Cuomo Salvatore guestEditor.; Din Sadia guestEditor.; Jabbar Sohail guestEditor.; Kosta Sokol guestEditor.; Laccetti Giuliano guestEditor.; Lapegna Marco guestEditor.; Mele Valeria guestEditor.; Montella Raffaele guestEditor.
• Is Part Of: Concurrency and computation. Volume 33:Number 4(2021)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2020-10-05
• Subjects: data assimilation -- domain decomposition -- Kalman filter -- scalability; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.6022
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: Kalman filter (KF) is one of the most important and common estimation algorithms. We introduce an innovative designing of Kalman filter algorithm based on domain decomposition (we call it DD‐KF). DD‐KF involves decomposition of the whole computational problem, partitioning of the solution and a slight modification of KF algorithm allowing a correction at run‐time of local solutions. The resulted parallel algorithm consists of concurrent copies of KF algorithm, each one requiring the same amount of computations on each subdomain and an exchange of boundary conditions between adjacent subdomains. Main advantage of this approach is that it can be potentially applied in a moderately nonintrusive manner to existing codes for tracking and controlling systems in location, navigation, in computer graphics and in much more state estimation problems. To highlight the capability of DD‐KF of exploiting the computing power provided by future designs of microprocessors based on multi/many‐cores CPU/GPU technologies, we consider DD both at physical core level and at microprocessor level and we discuss scalability of DD‐KF algorithm at coarse and fine grained level. Throughout the present work, we derive and discuss DD‐KF algorithm for solving constrained least square model, which underlies any data sampling and estimation problem.