arXiv subjects

Matthew J. Morse

Publications and source records attributed to Matthew J. Morse.

4 recordsLinked to original sources

arXiv2023

A Sparse Fast Chebyshev Transform for High-Dimensional Approximation

We present the Fast Chebyshev Transform (FCT), a fast, randomized algorithm to compute a Chebyshev approximation of functions in high-dimensions from the knowledge of the location of its nonzero Chebyshev coefficients. Rather than sampling a full-resolution Chebyshev grid in each dimension, we randomly sample several grids with varied resolutions and solve a least-squares problem in coefficient space in order to compute a polynomial approximating the function of interest across all grids simultaneously. We theoretically and empirically show that the FCT exhibits quasi-linear scaling and high numerical accuracy on challenging and complex high-dimensional problems. We demonstrate the effectiveness of our approach compared to alternative Chebyshev approximation schemes. In particular, we highlight our algorithm's effectiveness in high dimensions, demonstrating significant speedups over commonly-used alternative techniques.

math.NA↗

arXiv2021

Distance and intersection number in the curve graph of a surface

In this work, we study the cellular decomposition of $S$ induced by a filling pair of curves $v$ and $w$, $Dec_{v,w}(S) = S - (v \cup w)$, and its connection to the distance function $d(v,w)$ in the curve graph of a closed orientable surface $S$ of genus $g$. Efficient geodesics were introduced by the first author in joint work with Margalit and Menasco in 2016, giving an algorithm that begins with a pair of non-separating filling curves that determine vertices $(v,w)$ in the curve graph of a closed orientable surface $S$ and computing from them a finite set of efficient geodesics. We extend the tools of efficient geodesics to study the relationship between distance $d(v,w)$, intersection number $i(v,w)$, and $Dec_{v,w}(S)$. The main result is the development and analysis of particular configurations of rectangles in $Dec_{v,w}(S)$ called spirals. We are able to show that, in some special cases, the efficient geodesic algorithm can be used to build an algorithm that reduces $i(v,w)$ while preserving $d(v,w)$. At the end of the paper, we note a connection of our work to the notion of extending geodesics.

math.GT↗

arXiv2021

A robust solver for elliptic PDEs in 3D complex geometries

We develop a boundary integral equation solver for elliptic partial differential equations on complex \threed geometries. Our method is efficient, high-order accurate and robustly handles complex geometries. A key component is our singular and near-singular layer potential evaluation scheme, \qbkix: a simple extrapolation of the solution along a line to the boundary. We present a series of geometry-processing algorithms required for \qbkix to run efficiently with accuracy guarantees on arbitrary geometries and an adaptive upsampling scheme based on a iteration-free heuristic for quadrature error. We validate the accuracy and performance with a series of numerical tests and compare our approach to a competing local evaluation method.

math.NA↗

arXiv2019

Scalable Simulation of Realistic Volume Fraction Red Blood Cell Flows through Vascular Networks

High-resolution blood flow simulations have potential for developing better understanding biophysical phenomena at the microscale, such as vasodilation, vasoconstriction and overall vascular resistance. To this end, we present a scalable platform for the simulation of red blood cell (RBC) flows through complex capillaries by modeling the physical system as a viscous fluid with immersed deformable particles. We describe a parallel boundary integral equation solver for general elliptic partial differential equations, which we apply to Stokes flow through blood vessels. We also detail a parallel collision avoiding algorithm to ensure RBCs and the blood vessel remain contact-free. We have scaled our code on Stampede2 at the Texas Advanced Computing Center up to 34,816 cores. Our largest simulation enforces a contact-free state between four billion surface elements and solves for three billion degrees of freedom on one million RBCs and a blood vessel composed from two million patches.

cs.CE↗