<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Xianzhi: Portfolio Site</title>
    <link>https://xianzhiwang1.github.io/</link>
    <description>Recent content on Xianzhi: Portfolio Site</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Wed, 13 May 2026 11:07:06 -0500</lastBuildDate>
    <atom:link href="https://xianzhiwang1.github.io/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Solving a Saddle Point Problem</title>
      <link>https://xianzhiwang1.github.io/posts/saddle-point-deal-ii/</link>
      <pubDate>Wed, 13 May 2026 11:07:06 -0500</pubDate>
      <guid>https://xianzhiwang1.github.io/posts/saddle-point-deal-ii/</guid>
      <description>&lt;h3 id=&#34;a-finite-element-saddle-point-solver-written-with-dealii&#34;&gt;A finite-element saddle-point solver written with deal.II&lt;/h3&gt;&#xA;&lt;p&gt;This post walks through a research/coursework project&#xA;that I worked on this&#xA;during spring 2025 semester:&#xA;a two-component finite-element solver, written in C++ using&#xA;the &lt;a href=&#34;https://www.dealii.org/&#34;&gt;deal.II&lt;/a&gt; library, for a saddle-point system that&#xA;arises when one tries to compute the harmonic Riesz representation of a given&#xA;functional in the dual of $H^1$. The full code documentation lives at&#xA;&lt;a href=&#34;https://xianzhiwang1.github.io/math676-project/&#34;&gt;&lt;code&gt;saddle-point-project&lt;/code&gt;&lt;/a&gt;&#xA;url, it is grown out of the MATH 676 project that I completed in spring 2025.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Tech Notebook: A Machine Learning &amp; Deep Learning Journey</title>
      <link>https://xianzhiwang1.github.io/posts/my-tech-blog/</link>
      <pubDate>Sat, 03 Jan 2026 22:34:22 -0500</pubDate>
      <guid>https://xianzhiwang1.github.io/posts/my-tech-blog/</guid>
      <description>&lt;p&gt;&lt;strong&gt;The actual blog (with code) is at:&lt;/strong&gt; &lt;a href=&#34;https://xianzhiwang1.github.io/tech-blog/&#34;&gt;https://xianzhiwang1.github.io/tech-blog/&lt;/a&gt;&lt;/p&gt;&#xA;&lt;p&gt;I maintain a personal technical blog where I write up what I learn as I work&#xA;through machine learning and deep learning, both inside coursework and on my&#xA;own. This project grows out of the CS0451 Machine Learning class&#xA;I took at Middlebury College.&#xA;The overarching theme of this tech blog&#xA;is &lt;em&gt;understanding by building&lt;/em&gt;: each post takes a&#xA;single idea, walks through the math behind it, implements it in Python&#xA;(usually from scratch first, then alongside a library reference), and then&#xA;puts the implementation to work on a real dataset. The site is built with&#xA;&lt;a href=&#34;https://quarto.org/&#34;&gt;Quarto&lt;/a&gt; and published from a stack of Jupyter&#xA;notebooks, so every post is a fully reproducible mix of derivations,&#xA;explanations, code, plots, and embedded source files.&lt;/p&gt;</description>
    </item>
    <item>
      <title>About</title>
      <link>https://xianzhiwang1.github.io/about/</link>
      <pubDate>Tue, 14 Jan 2025 12:56:23 -0600</pubDate>
      <guid>https://xianzhiwang1.github.io/about/</guid>
      <description>&lt;p&gt;My name is Xianzhi Wang. I am a Graduate student in Mathematics at Texas A&amp;amp;M University with a strong foundation in applied mathematics, optimization, and software development. I am passionate about leveraging my analytical skills and programming expertise to solve complex problems in data science and software engineering.&lt;/p&gt;&#xA;&lt;h3 id=&#34;skills&#34;&gt;SKILLS&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;Programming Languages:&lt;/strong&gt; Python, C++, MATLAB&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Technologies &amp;amp; Frameworks:&lt;/strong&gt; Git, deal.II, ParaView, MOSEK, PyTorch, Docker, NumPy, SymPy, Linux/Ubuntu&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Core Competencies:&lt;/strong&gt; Bayesian Statistics, Minimax Theory, Deep Learning, Machine Learning, Probability Theory, Optimal Recovery, Optimization, Numerical Methods, Finite Element Methods, Algorithm Design&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3 id=&#34;education&#34;&gt;EDUCATION&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;PhD in Mathematics&lt;/strong&gt; | Texas A&amp;amp;M University | &lt;em&gt;Expected Spring 2028&lt;/em&gt;&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Master of Science in Mathematics&lt;/strong&gt; | Texas A&amp;amp;M University | &lt;em&gt;2025&lt;/em&gt; | GPA: 3.785&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Bachelor of Arts in Mathematics&lt;/strong&gt; | Middlebury College | &lt;em&gt;Aug 2023&lt;/em&gt; | Summa Cum Laude&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Study Abroad&lt;/strong&gt; | Budapest Semesters in Mathematics | &lt;em&gt;Aug 2021 - Aug 2022&lt;/em&gt; | Highest Honors&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h3 id=&#34;experience&#34;&gt;EXPERIENCE&lt;/h3&gt;&#xA;&lt;p&gt;&lt;strong&gt;Research Assistant&lt;/strong&gt; | Middlebury College &amp;amp; Budapest Semesters in Mathematics | &lt;em&gt;May 2021 - May 2023&lt;/em&gt;&lt;/p&gt;</description>
    </item>
    <item>
      <title>Neovim (Lua) authoring: Packer.nvim, Markdown preview, and TeX Live</title>
      <link>https://xianzhiwang1.github.io/posts/neovim-lua-packer-texlive-markdown-latex-workflow/</link>
      <pubDate>Tue, 14 Jan 2025 12:54:45 -0600</pubDate>
      <guid>https://xianzhiwang1.github.io/posts/neovim-lua-packer-texlive-markdown-latex-workflow/</guid>
      <description>&lt;p&gt;Neovim is my primary &lt;strong&gt;modal editor&lt;/strong&gt; for technical writing and lightweight IDE-style tasks. Configuration is expressed in &lt;strong&gt;Lua&lt;/strong&gt; and versioned in &lt;a href=&#34;https://github.com/Xianzhiwang1/my-neovim-config-from-scratch&#34;&gt;this repository&lt;/a&gt;. The setup is intentionally incremental: curated plugins, predictable keymaps, and a reproducible local toolchain rather than a monolithic distribution.&lt;/p&gt;&#xA;&lt;p&gt;Plugin management uses &lt;a href=&#34;https://github.com/wbthomason/packer.nvim&#34;&gt;Packer.nvim&lt;/a&gt; today; I am evaluating &lt;strong&gt;Lazy.nvim&lt;/strong&gt; for faster startup and declarative spec loading (see below). For Markdown, &lt;code&gt;Alt+k&lt;/code&gt; triggers &lt;strong&gt;markdown-preview.nvim&lt;/strong&gt; in an existing browser session—equivalent to &lt;code&gt;:MarkdownPreview&lt;/code&gt;—via Packer declarations such as:&lt;/p&gt;</description>
    </item>
    <item>
      <title>Terminal email with Mutt: Gmail, OAuth 2.0, IMAP, and SMTP</title>
      <link>https://xianzhiwang1.github.io/posts/mutt-oauth2-gmail-imap-smtp-terminal-email/</link>
      <pubDate>Tue, 14 Jan 2025 12:51:24 -0600</pubDate>
      <guid>https://xianzhiwang1.github.io/posts/mutt-oauth2-gmail-imap-smtp-terminal-email/</guid>
      <description>&lt;p&gt;This write-up summarizes a &lt;strong&gt;CLI-first email stack&lt;/strong&gt; built around &lt;a href=&#34;http://www.mutt.org/&#34;&gt;Mutt&lt;/a&gt; on Linux, with &lt;strong&gt;Google Gmail&lt;/strong&gt; over &lt;strong&gt;IMAP/SMTP&lt;/strong&gt; and &lt;strong&gt;OAuth 2.0&lt;/strong&gt; for authentication—relevant when &lt;strong&gt;Google Workspace&lt;/strong&gt; or policy blocks legacy &lt;strong&gt;app passwords&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;p&gt;For a personal Gmail account where &lt;strong&gt;app passwords&lt;/strong&gt; remain available, &lt;a href=&#34;https://github.com/LukeSmithxyz/mutt-wizard&#34;&gt;mutt-wizard&lt;/a&gt; plus an app password is the fastest path: generate credentials in the Google Account security UI, install the wizard from GitHub, and follow its prompts. That flow assumes comfort with the shell and a working &lt;code&gt;muttrc&lt;/code&gt; layout.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Layered keyboard layout with KMonad on Linux (i3)</title>
      <link>https://xianzhiwang1.github.io/posts/kmonad-layered-keymaps-linux-i3-workstation/</link>
      <pubDate>Tue, 14 Jan 2025 12:48:18 -0600</pubDate>
      <guid>https://xianzhiwang1.github.io/posts/kmonad-layered-keymaps-linux-i3-workstation/</guid>
      <description>&lt;p&gt;This note documents how I use &lt;a href=&#34;https://github.com/kmonad/kmonad&#34;&gt;KMonad&lt;/a&gt;, a cross-platform, user-space keyboard remapping daemon written in Haskell, to implement a &lt;strong&gt;layered keymap&lt;/strong&gt; on a Linux workstation. The configuration lives alongside my window manager setup in &lt;a href=&#34;https://github.com/Xianzhiwang1/i3-config/&#34;&gt;this i3 repository&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Compared to QMK/ZMK firmware, KMonad runs in &lt;strong&gt;user space&lt;/strong&gt; on the host OS, which makes it easy to iterate on declarative layout definitions without flashing hardware. The mental model is similar to embedded keymaps: &lt;strong&gt;layers&lt;/strong&gt;, &lt;strong&gt;tap-hold&lt;/strong&gt; behaviors, and modifier chords, expressed as structured configuration rather than ad hoc desktop shortcuts.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Research</title>
      <link>https://xianzhiwang1.github.io/pages/research/</link>
      <pubDate>Sat, 17 Aug 2024 16:16:13 -0500</pubDate>
      <guid>https://xianzhiwang1.github.io/pages/research/</guid>
      <description>&lt;h1 id=&#34;current-research&#34;&gt;Current Research&lt;/h1&gt;&#xA;&lt;h3 id=&#34;solving-poisson-equation-with-incomplete-noisy-information&#34;&gt;Solving Poisson equation with incomplete noisy information&lt;/h3&gt;&#xA;&lt;p&gt;Current research project advised by Dr. Andrea Bonito:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Algorithmic Development: Engineered C++ code to implement complex minimization algorithms, utilizing the MOSEK C++ FUSION API for high-performance optimization.&lt;/li&gt;&#xA;&lt;li&gt;Numerical Experiments: Conducted numerical simulations to validate algorithm accuracy and performance, utilizing ParaView for data visualization, Docker for containerization and tmux for efficient CLI-based workflows.&lt;/li&gt;&#xA;&lt;li&gt;Software Rigor: Applied best practices in memory safety, debugging, and version control to ensure the reliability of mathematical software.&lt;/li&gt;&#xA;&lt;li&gt;Theory Translation: Translated mathematical frameworks into computationally efficient code, bridging the gap between theoretical research and practical application.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h1 id=&#34;past-research&#34;&gt;Past Research&lt;/h1&gt;&#xA;&lt;h3 id=&#34;applying-combinatorial-nullstellensatz-to-no-3-in-a-line-problem&#34;&gt;Applying Combinatorial Nullstellensatz to no-3-in-a-line problem&lt;/h3&gt;&#xA;&lt;p&gt;&lt;em&gt;Repeatedly applying the Combinatorial Nullstellensatz&#xA;for Zero-sum Grids to Martin Gardner&amp;rsquo;s minimum&#xA;no-3-in-a-line problem&lt;/em&gt;&lt;br&gt;&#xA;Published Version:&#xA;&lt;!-- raw HTML omitted --&gt;&lt;a href=&#34;https://doi.org/10.1016/j.ejc.2024.104095&#34;&gt;https://doi.org/10.1016/j.ejc.2024.104095&lt;/a&gt;&lt;!-- raw HTML omitted --&gt;;&lt;br&gt;&#xA;ArXiv Link:&lt;br&gt;&#xA;&lt;!-- raw HTML omitted --&gt;&lt;a href=&#34;https://arxiv.org/abs/2401.03119&#34;&gt;https://arxiv.org/abs/2401.03119&lt;/a&gt;&lt;!-- raw HTML omitted --&gt;;\&lt;/p&gt;</description>
    </item>
    <item>
      <title>Teaching Assistantship</title>
      <link>https://xianzhiwang1.github.io/pages/teaching-assistantship/</link>
      <pubDate>Sat, 17 Aug 2024 16:15:51 -0500</pubDate>
      <guid>https://xianzhiwang1.github.io/pages/teaching-assistantship/</guid>
      <description>&lt;h1 id=&#34;teaching-experience&#34;&gt;Teaching Experience&lt;/h1&gt;&#xA;&lt;h3 id=&#34;spring-2026&#34;&gt;Spring 2026&lt;/h3&gt;&#xA;&lt;h3 id=&#34;fall-2025&#34;&gt;Fall 2025&lt;/h3&gt;&#xA;&lt;h3 id=&#34;spring-2025&#34;&gt;Spring 2025&lt;/h3&gt;&#xA;&lt;p&gt;Teaching Assistant for Math 151, Engineering Mathematics I, lead weekly labs and recitation sections.&lt;/p&gt;&#xA;&lt;h3 id=&#34;fall-2024&#34;&gt;Fall 2024&lt;/h3&gt;&#xA;&lt;p&gt;Teaching Assistant for Math 151, Engineering Mathematics I, lead weekly labs and recitation sections.&lt;/p&gt;&#xA;&lt;h3 id=&#34;summer-2024&#34;&gt;Summer 2024&lt;/h3&gt;&#xA;&lt;p&gt;Grader for Undergraduate Linear Algebra Course at TAMU.&lt;/p&gt;&#xA;&lt;h3 id=&#34;spring-2024&#34;&gt;Spring 2024&lt;/h3&gt;&#xA;&lt;p&gt;Teaching Assistant for Math 152, Engineering Mathematics II, lead weekly labs and recitation sections.&lt;/p&gt;&#xA;&lt;h3 id=&#34;fall-2023&#34;&gt;Fall 2023&lt;/h3&gt;&#xA;&lt;p&gt;Teaching Assistant for Math 151, Engineering Mathematics I, lead weekly labs and recitation sections.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
