# The most beautiful line you can draw with Kalman filter (2/2)

- Institution: CERN
- Department: Inverted CSC
- Speaker: Valeriia Lukashenko
- Year: 2023
- Language: English
- Subjects: Computer science
- Source: [CERN](https://videos.cern.ch/record/3000226)
- Licence: [CERN](http://copyright.web.cern.ch)
- Who can watch: Tweens profiles and older (sources give no ratings; placed by Invisible Network from the source's own words)

Track fitting is an everyday repetitive task in the high energy physics detector reconstruction chains. The precision and stability of the fitter depend on the available computing resources. A fit might cost up to half of the CPU time, that is spent on reconstruction. Kalman filters are a widespread solution for the track fitting. A classical Kalman filter is a powerful tool, that is applicable to the linear problems with Gaussian-like errors. However, in reality one has to deal with non-linear problems and sometimes with non-Gaussian errors. The numerical overheat results in instabilities and slows down the convergence. Physics and reparametrisation can help to improve the fit performance. Starting from the simple Kalman filter, we build up a more realistic Kalman filter, discussing practical tricks and possible issues of implementation. We then talk about implementation differences if using CPU or GPU.

In these two lectures, we start from the points on planes and follow the entire track-fitting chain up to the high-level particle parameters. We discuss the connection between the geometry of the detector and the track model, as well as, the track-fitting chain. We also discuss physics-driven optimization of the algorithms based on the effect of the changes on the high-level parameters. In the end, we discuss possible implementations of track fitting on CPU and GPU, highlighting the importance of a trade-off between speed and precision..

0:00:00 Slide 1

0:01:44 Slide 2

0:03:12 Slide 3

0:05:30 Slide 4

0:06:52 Slide 5

0:08:04 Slide 6

0:09:21 Slide 7

0:11:09 Slide 8

0:14:25 Slide 9

0:16:27 Slide 10

0:18:11 Slide 11

0:20:18 Slide 12

0:21:49 Slide 13

0:26:27 Slide 14

0:28:17 Slide 15

0:29:31 Slide 16

0:30:53 Slide 17

0:32:13 Slide 18

0:33:43 Slide 19

0:35:24 Slide 20

0:37:04 Slide 21

0:39:07 Slide 22

0:41:13 Slide 23

0:42:21 Slide 24

0:44:35 Slide 25

0:46:27 Slide 26

0:48:00 Slide 27

0:49:04 Slide 28

0:58:04 Slide 29

0:59:21 Slide 30

## Lectures

1. [The most beautiful line you can draw with Kalman filter (2/2)](https://invisiblenetwork.ai/learn/cern/3000226/6eced023fe44), 1 h 5 min (CERN's player)