<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Projects on Dmitry Serikov</title><link>https://dmitryserikoff.com/projects/</link><description>Recent content in Projects on Dmitry Serikov</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Mon, 06 Jul 2026 00:00:00 +0300</lastBuildDate><atom:link href="https://dmitryserikoff.com/projects/index.xml" rel="self" type="application/rss+xml"/><item><title>Resona</title><link>https://dmitryserikoff.com/projects/resona/</link><pubDate>Mon, 06 Jul 2026 00:00:00 +0300</pubDate><guid>https://dmitryserikoff.com/projects/resona/</guid><description>&lt;p>&lt;strong>Resona&lt;/strong> is a Python library for comprehensive spectral analysis of operators
without ever constructing or storing the full matrix — &amp;ldquo;the FFT of operators.&amp;rdquo;&lt;/p>
&lt;p>Everything runs on a single primitive: the matrix–vector product &lt;code>v ↦ A·v&lt;/code>.
From that alone, Resona extracts eigenvalues, densities of states, effective
rank, pseudospectra and condition numbers; composes operators algebraically
via free probability (Pastur subordination, Brown measure for non-Hermitian
operators); and even synthesizes new operators matching target spectral
properties.&lt;/p></description></item><item><title>LastSolve</title><link>https://dmitryserikoff.com/projects/lastsolve/</link><pubDate>Mon, 06 Jul 2026 00:00:00 +0300</pubDate><guid>https://dmitryserikoff.com/projects/lastsolve/</guid><description>&lt;p>&lt;strong>LastSolve&lt;/strong> wraps any expensive black-box solver — PDE simulators, legacy
code, subprocess binaries — learns its behavior from roughly ten strategic
calls, and serves the remaining queries in microseconds with validated error
bounds. Hence the name: the last few solves you&amp;rsquo;ll ever pay for.&lt;/p>
&lt;p>A single &lt;code>@accelerate&lt;/code> decorator gives you transparent surrogate caching.
Under it: split-conformal error certification with finite-sample guarantees,
parameter identification with Cramér–Rao bounds, bifurcation detection, and
blind subspace auditing. The Φ₁ &amp;ldquo;dial&amp;rdquo; — &lt;a href="https://dmitryserikoff.com/projects/resona/">Resona&lt;/a>&amp;rsquo;s
effective-rank measurement — flags when a cheap surrogate simply doesn&amp;rsquo;t
exist, so the tool knows when &lt;em>not&lt;/em> to trust itself.&lt;/p></description></item></channel></rss>