<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Projects | Zachary R. Atkins</title><link>https://zatkins.dev/projects/</link><atom:link href="https://zatkins.dev/projects/index.xml" rel="self" type="application/rss+xml"/><description>Projects</description><generator>HugoBlox Kit (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Mon, 02 Feb 2026 00:00:00 +0000</lastBuildDate><image><url>https://zatkins.dev/media/icon_hu_2065462c9f2b35c4.png</url><title>Projects</title><link>https://zatkins.dev/projects/</link></image><item><title>Graph Viz</title><link>https://zatkins.dev/projects/graphviz/</link><pubDate>Mon, 02 Feb 2026 00:00:00 +0000</pubDate><guid>https://zatkins.dev/projects/graphviz/</guid><description>&lt;p&gt;Graph Viz is a standalone app for visualizing common graph algorithms.
.&lt;/p&gt;</description></item><item><title>ChordDyn</title><link>https://zatkins.dev/projects/chorddyn/</link><pubDate>Sun, 31 Aug 2025 00:00:00 +0000</pubDate><guid>https://zatkins.dev/projects/chorddyn/</guid><description>&lt;div style="position: relative; padding-bottom: 56.25%; height: 0; overflow: hidden;"&gt;
&lt;iframe allow="accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share; fullscreen" loading="eager" referrerpolicy="strict-origin-when-cross-origin" src="https://www.youtube.com/embed/_BFsdcbie_0?autoplay=0&amp;amp;controls=1&amp;amp;end=0&amp;amp;loop=0&amp;amp;mute=0&amp;amp;start=0" style="position: absolute; top: 0; left: 0; width: 100%; height: 100%; border:0;" title="YouTube video"&gt;&lt;/iframe&gt;
&lt;/div&gt;
&lt;p&gt;ChordDyn is a software library and collection of scripts written in Python 3 and Julia to generate novel chord progressions using chaotic trajectories overlaid onto a Tonnetz.&lt;/p&gt;
&lt;p&gt;To see ChordDyn in action, watch the video linked above!&lt;/p&gt;</description></item><item><title>Ratel-Runner</title><link>https://zatkins.dev/projects/ratel-runner/</link><pubDate>Thu, 28 Aug 2025 00:00:00 +0000</pubDate><guid>https://zatkins.dev/projects/ratel-runner/</guid><description>&lt;p&gt;Ratel-Runner is a tool for optimized building and running of Ratel on high-performance computing systems.&lt;/p&gt;</description></item><item><title>Ratel Implicit Material Point Method (iMPM)</title><link>https://zatkins.dev/projects/ratel-impm/</link><pubDate>Sat, 01 Jun 2024 00:00:00 +0000</pubDate><guid>https://zatkins.dev/projects/ratel-impm/</guid><description>&lt;p&gt;Ratel iMPM is a fast, powerful material point method solver implemented in the Ratel application, capable of simulating billions of material points on thousands of GPUs.&lt;/p&gt;</description></item><item><title>Arc Length Continuation in PETSc</title><link>https://zatkins.dev/projects/arclengthcontinuation/</link><pubDate>Tue, 07 May 2024 00:00:00 +0000</pubDate><guid>https://zatkins.dev/projects/arclengthcontinuation/</guid><description>&lt;h3 id="abstract"&gt;Abstract:&lt;/h3&gt;
&lt;blockquote class="border-l-4 border-neutral-300 dark:border-neutral-600 pl-4 italic text-neutral-600 dark:text-neutral-400 my-6"&gt;
&lt;p&gt;Traditional Newton methods with load and displacement control are unable to solve problems with limit points, bifurcations, and snap-through instabilities.
Arc-length continuation methods are a powerful tool for solving these problems, but are not natively supported in PETSc (Portable, Extensible Toolkit for Scientific Computation).
This work implements two arc-length continuation methods in PETSc: Crisfield&amp;rsquo;s method with partial corrections and the normal-plane constraint method.
Due to the composable nature of PETSc solvers, these methods can be used as a replacement for pseudo-time stepping approaches to static problems or as a composed solver for quasistatic and dynamic problems with time integration.
To support the latter, this work implements a novel method for bounding the load parameter with a hybrid arc-length and Newton method in the final increment.
The implementations are verified using a 3D large deformation buckling test, where they outperform the standard Newton method with pseudo-time stepping in terms of convergence and accuracy.&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;See the
and
!&lt;/p&gt;</description></item><item><title>libCEED</title><link>https://zatkins.dev/projects/libceed/</link><pubDate>Thu, 26 Oct 2023 00:00:00 +0000</pubDate><guid>https://zatkins.dev/projects/libceed/</guid><description>&lt;p&gt;libCEED is a fast and portable matrix-free finite element code. It allows the same kernels to be run on CPU and GPU without rewriting source code.&lt;/p&gt;
&lt;p&gt;
&lt;figure &gt;
&lt;div class="flex justify-center "&gt;
&lt;div class="w-full" &gt;&lt;img alt="Diagram of libCEED At-Points operators"
src="https://zatkins.dev/projects/libceed/diagram.svg"
loading="lazy" data-zoomable /&gt;&lt;/div&gt;
&lt;/div&gt;&lt;/figure&gt;
&lt;/p&gt;
&lt;p&gt;My contributions include assembly of at-points operators on GPU, a necessary feature for Ratel iMPM, and various performance and usability enhancements.&lt;/p&gt;</description></item></channel></rss>