Filip Bělík's Webpage

About Me

My name is Filip Bělík and I am a PhD student at the University of Utah studying Applied Mathematics with an intended graduation of May 2027. I am generally interested in computational mathematics, scientific computing, and modeling; my current projects include parameteric model order reduction, blood flow modeling, methods for Carathéodory pruning, and uncertainty quantification for decision-based models. Outside of my studies, I enjoy spending time outdoors including running, walking, hiking, playing tennis, biking, or snowboarding. I also enjoy music, board games, and coding in the Julia programming language.

Contact Information

Email: belik@math.utah.edu
Office: LCB 302
My CV
My LinkedIn
My GitHub

Education

University of Utah, PhD Mathematics, August 2022 - Present
Gustavus Adolphus College, BA Honors Mathematics, BA Computer Science, September 2018 - May 2022

Publications / Preprints

Henry Crandall et al. Cuffless, calibration-free hemodynamic monitoring with physics-informed machine learning models. [arXiv]
Filip Bělík, Yanlai Chen, & Akil Narayan (2025). Greedy Rational Approximation for Frequency-Domain Model Reduction of Parametric LTI Systems. [arXiv]
Filip Bělík, Jesse Chan, & Akil Narayan (2025). Efficient and Robust Carathéodory-Steinitz Pruning of Positive Discrete Measures. [arXiv]
Filip Bělík, Ha Le, & Jacob Siehler (2020). One-dimenensional Port-and-Sweep Solitaire Armies. [PDF]

Other

Play some snake!

Having trouble with the wordle?

Parametric Model Order Reduction (PMOR)

Study of PMOR methods for linear stationary and nonstationary parametric problems.
Implementation of proper orthogonal decomposition, strong greedy, and weak greedy methods for stationary parametric problems.
Implementation of balanced truncation and RB method for linear time-invariant dynamical systems.
Open source package development of Julia package ModelOrderReductionToolkit.jl with documentation.
Goal of expanding to nonlinear and transport dominated problems.
Advised by Dr. Akil Narayan (U of Utah Scientific Computing and Imaging Institute (SCI) and Mathematics), collaboration with Dr. Yanlai Chen (UMass Mathematics).

Blood Flow Modeling for Conductivity and UQ

Analytical modeling of arterial blood flow and wall displacement.
Relate blood shear-stresses to red blood cell orientation and deformation
Use of electrical theory on ellipsiods and Maxwell-Fricke theory to compute an averaged bulk conductivity in the artery.
Goal of better understanding relationship between blood pressure and blood-driven electrical properties at the wrist.
Work to understand impacts of various parameters and nondimensional constants through local and (Sobol-based) global sensitivity analyses.
Also working to model and understand propagation of pressure waves through an arterial tree along with required boundary conditions to cause peaking seen in wrist blood pressures.
Advised by Dr. Christel Hohenegger (U of Utah), collaboration with Henry Crandall and Dr. Benjamin Sanchez (U of Utah Electrical Engineering) and Tyler Schuessler and Dr. Braxton Osting (U of Utah Mathematics).

Carathéodory Pruning

Theorem about minimum number of points in a d-dimensional space required to enclose another point.
Useful for quadrature and MOR applications where we wish to form a non-negative linear combination of a few points to meet some target.
Implementation of various QR-based methods for Carathéodory pruning.
Open source package development of (to be released) Julia package CaratheodoryPruning.jl with documentation.
Discussion of complexity of various algorithms.
Advised by Dr. Akil Narayan (U of Utah SCI and Mathematics), collaboration with Dr. Jesse Chan (Rice Computational & Applied Mathematics).

Modeling Closed Vortices as Self-Avoiding Polygons (Undergrad Honors Project)

Extend on former work by modeling closed-loop vortices, such as dolphin bubble rings or smoke rings, as self-avoiding polygons (SAPs) in the cubic lattice.
Use of a discrete approximation of an integral form of kinetic energy to study the maximum, minumum, and average energies of different length configurations.
Implemented sets of transformations for use in Metropolis Markov Chain Monte-Carlo methods for sampling SAPs of longer lengths.
Approximated average energies across various statistical temperatures.
Discovered interesting and nonintuitive pattern of high-energy configurations.
Our results suggested that the model applied to closed-loop vortices could be helpful in finding near minimum energy open vortices and that sampling from closed vortices in the cubiclattice may be trickier than open vortices for high statistical temperature.
Here is my honor's thesis presentation which was advised by Dr Pavel Bělík (Augsburg University Mathematics) and Dr. Thomas LoFaro (Gustavus Adolphus College Mathematics).

Age Informed Modeling of Carbon Sequestration in Forests (2022 MCM/ICM)

We developed a discrete age-structured model that tracks the number of trees over time subject to planting and harvesting.
Tracked the number of carbon sequestered (stored) by trees and by harvested wood products over time to understand the climate impact of different amounts of harvesting.
Implemented sets of transformations for use in Metropolis Markov Chain Monte-Carlo methods for sampling SAPs of longer lengths.
Approximated average energies across various statistical temperatures.
We use this model to understand strategies for harvesting and planting cycles that help to try to optimize the amount of carbon sequestration.
Collaboration with Sophia Nelson (Northwestern Engineering Sciences & Applied Mathematics) and Abigayle Paulson.
Here is our submission.

Port-and-Sweep Solitaire Army Problem

Peg solitaire is a puzzle game with extensive mathematical research and literature revealing connections to modular 3 invariants, the Fibonacci numbers, the golden ratio, and more.
Port-and-Sweep Solitaire (PaSS) was created in 2010 and differs from peg solitaire in the number of pegs or counters that can be on a single space and the type of moves available to the player.
The one-dimensional army problem involves working with configurations of pegs and using valid solitaire moves in the proper order to advance the army of pegs as far to the left of its starting position as possible.
With the use of a non-increasing board value function, deduction, and linear algebra, we present a definite upper-bound on the advances of PaSS armies, minimal configurations of armies that progress as far as has been shown possible, and a solution to the PaSS army problem given assumptions that match all current army advances.
Advised by Dr. Jacob Siehler (Gustavus Adolphus College Mathematics).

Propagation of Health-Related Habits on Twitter

Continuation of works trying to quantify social selection and social influence in online relationships.
Worked to answer question: How do an individual's exercise habits on Twitter influence that user's followers.
Implemented and compared various machine learning algorithms towards text classification (scikit learn Naive-Bayes, Decision Trees, Random Forests, Neural Networks) to identify tweets related to exercise.
Advised by Dr. Louis Yu (Gustavus Adolphus College Computer Science) and work with Jeffery Engelhardt (Gustavus Adolphus College Computer Science).

Filip Bělík