0
Your cart

Your cart is empty

Books

Buy Now

Kalman Filtering Under Information Theoretic Criteria (1st ed. 2023) Loot Price: R3,272
Discovery Miles 32 720
Kalman Filtering Under Information Theoretic Criteria (1st ed. 2023): Badong Chen, Lujuan Dang, Nanning Zheng, Jose C. Principe

Kalman Filtering Under Information Theoretic Criteria (1st ed. 2023)

Badong Chen, Lujuan Dang, Nanning Zheng, Jose C. Principe

 (sign in to rate)
Loot Price R3,272 Discovery Miles 32 720 | Repayment Terms: R307 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

This book provides several efficient Kalman filters (linear or nonlinear) under information theoretic criteria. They achieve excellent performance in complicated non-Gaussian noises with low computation complexity and have great practical application potential. The book combines all these perspectives and results in a single resource for students and practitioners in relevant application fields. Each chapter starts with a brief review of fundamentals, presents the material focused on the most important properties and evaluates comparatively the models discussing free parameters and their effect on the results. Proofs are provided at the end of each chapter. The book is geared to senior undergraduates with a basic understanding of linear algebra, signal processing and statistics, as well as graduate students or practitioners with experience in Kalman filtering.

General

Imprint: Springer International Publishing AG
Country of origin: Switzerland
Release date: August 2023
Authors: Badong Chen • Lujuan Dang • Nanning Zheng • Jose C. Principe
Dimensions: 235 x 155mm (L x W)
Pages: 294
Edition: 1st ed. 2023
ISBN-13: 978-3-03-133763-5
Categories: Books
LSN: 3-03-133763-8
Barcode: 9783031337635

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners