Researcher profile

Clint Dawson

Clint Dawson contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
9works
0followers
9topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

9 published item(s)

preprint2026arXiv

HyCOP: Hybrid Composition Operators for Interpretable Learning of PDEs

We introduce HyCOP, a modular framework that learns parametric PDE solution operators by composing simple modules (advection, diffusion, learned closures, boundary handling) in a query-conditioned way. Rather than learning a monolithic map, HyCOP learns a policy over short programs - which module to apply and for how long - conditioned on regime features and state statistics. Modules may be numerical sub-solvers or learned components, enabling hybrid surrogates evaluated at arbitrary query times without autoregressive rollout. Across diverse PDE benchmarks, HyCOP produces interpretable programs, delivers order-of-magnitude OOD improvements over monolithic neural operators, and supports modular transfer through dictionary updates (e.g., boundary swaps, residual enrichment). Our theory characterizes expressivity and gives an error decomposition that separates composition error from module error and doubles as a process-level diagnostic.

preprint2026arXiv

Towards Multi-Agent Autonomous Reasoning in Hydrodynamics

Single-agent systems (SAS) have become the default pattern for LLM-driven scientific workflows, but routing planning, tool use, and synthesis through a single context window comes with a well-known cost: as tool specifications and observational traces accumulate, the effective context available for each decision shrinks, and end-to-end reliability suffers. We present a multi-agent system (MAS) prototype for hydrodynamics in which specialized agents are coordinated through a Layer Execution Graph (LEG). A planner agent constructs query-specific execution topologies from natural-language routing heuristics that capture domain knowledge without hard-coding it as rigid control logic; specialist agents operate under strict tool allowlists and occupy complementary data-class roles. Between layers, consolidator agents fuse parallel outputs into concise briefs, and a reporter agent synthesizes the final response, while the runtime logs provenance for every tool invocation to support auditability. All benchmarks, ablations, and stress tests use Claude Sonnet~4.6 as the backbone model for both specialist and general-purpose agents. Evaluated on 37 queries spanning six complexity categories, the prototype achieves 93.6% factual precision with a 100% pass rate. Accuracy remains above 90% across runs from single-threaded to five independent parallel tracks, and under simulated loss of individual data sources the system degrades gracefully, still returning substantive partial answers. Together, these results suggest that planner-guided, graph-structured multi-agent orchestration can meaningfully alleviate the context-saturation bottlenecks that constrain monolithic single-agent architectures.

preprint2023arXiv

Automatic Variationally Stable Analysis for Finite Element Computations: Transient Convection-Diffusion Problems

We establish stable finite element (FE) approximations of convection-diffusion initial boundary value problems using the automatic variationally stable finite element (AVS-FE) method. The transient convection-diffusion problem leads to issues in classical FE methods as the differential operator can be considered singular perturbation in both space and time. The unconditional stability of the AVS-FE method, regardless of the underlying differential operator, allows us significant flexibility in the construction of FE approximations. We take two distinct approaches to the FE discretization of the convection-diffusion problem: i) considering a space-time approach in which the temporal discretization is established using finite elements, and ii) a method of lines approach in which we employ the AVS-FE method in space whereas the temporal domain is discretized using the generalized-alpha method. In the generalized-alpha method, we discretize the temporal domain into finite sized time-steps and adopt the generalized-alpha method as time integrator. Then, we derive a corresponding norm for the obtained operator to guarantee the temporal stability of the method. We present numerical verifications for both approaches, including numerical asymptotic convergence studies highlighting optimal convergence properties. Furthermore, in the spirit of the discontinuous Petrov-Galerkin method by Demkowicz and Gopalakrishnan, the AVS-FE method also leads to readily available a posteriori error estimates through a Riesz representer of the residual of the AVS-FE approximations. Hence, the norm of the resulting local restrictions of these estimates serve as error indicators in both space and time for which we present multiple numerical verifications adaptive strategies.

preprint2022arXiv

Cross-mode Stabilized Stochastic Shallow Water Systems Using Stochastic Finite Element Methods

The development of surrogate models to study uncertainties in hydrologic systems requires significant effort in the development of sampling strategies and forward model simulations. Furthermore, in applications where prediction time is critical, such as prediction of hurricane storm surge, the predictions of system response and uncertainties can be required within short time frames. Here, we develop an efficient stochastic shallow water model to address these issues. To discretize the physical and probability spaces we use a Stochastic Galerkin method and a Incremental Pressure Correction scheme to advance the solution in time. To overcome discrete stability issues, we propose cross-mode stabilization methods which employs existing stabilization methods in the probability space by adding stabilization terms to every stochastic mode in a modes-coupled way. We extensively verify the developed method for both idealized shallow water test cases and hindcasting of past hurricanes. We subsequently use the developed and verified method to perform a comprehensive statistical analysis of the established shallow water surrogate models. Finally, we propose a predictor for hurricane storm surge under uncertain wind drag coefficients and demonstrate its effectivity for Hurricanes Ike and Harvey.

preprint2022arXiv

Extending FEniCS to Work in Higher Dimensions Using Tensor Product Finite Elements

We present a method to extend the finite element library FEniCS to solve problems with domains in dimensions above three by constructing tensor product finite elements. This methodology only requires that the high dimensional domain is structured as a Cartesian product of two lower dimensional subdomains. In this study we consider Dirichlet problems for scalar linear partial differential equations, though the methodology can be extended to non-linear problems. The utilization of tensor product finite elements allows us to construct a global system of linear algebraic equations that only relies on the finite element infrastructure of the lower dimensional subdomains contained in FEniCS. We demonstrate the effectiveness of our methodology in four distinctive test cases. The first test case is a Poisson equation posed in a four dimensional domain which is a Cartesian product of two unit squares solved using the classical Galerkin finite element method. The second test case is the wave equation in space-time, where the computational domain is a Cartesian product of a two dimensional space grid and a one dimensional time interval. In this second case we also employ the Galerkin method. The third test case is an advection dominated advection-diffusion equation where the global domain is a Cartesian product of two one dimensional intervals in which the streamline upwind Petrov-Galerkin method is applied to ensure discrete stability. The final test case uses the Galerkin approach to solve a Poisson problem on a Cartesian product of two intervals with a spatially varying, non-separable diffusivity term. In all cases, a p=1 basis is used and optimal L^2 convergence rates of order h^{p+1} of the errors are achieved with respect to h refinement

preprint2021arXiv

A Hybrid 2-stage Neural Optimization for Pareto Front Extraction

Classification, recommendation, and ranking problems often involve competing goals with additional constraints (e.g., to satisfy fairness or diversity criteria). Such optimization problems are quite challenging, often involving non-convex functions along with considerations of user preferences in balancing trade-offs. Pareto solutions represent optimal frontiers for jointly optimizing multiple competing objectives. A major obstacle for frequently used linear-scalarization strategies is that the resulting optimization problem might not always converge to a global optimum. Furthermore, such methods only return one solution point per run. A Pareto solution set is a subset of all such global optima over multiple runs for different trade-off choices. Therefore, a Pareto front can only be guaranteed with multiple runs of the linear-scalarization problem, where all runs converge to their respective global optima. Consequently, extracting a Pareto front for practical problems is computationally intractable with substantial computational overheads, limited scalability, and reduced accuracy. We propose a robust, low cost, two-stage, hybrid neural Pareto optimization approach that is accurate and scales (compute space and time) with data dimensions, as well as number of functions and constraints. The first stage (neural network) efficiently extracts a weak Pareto front, using Fritz-John conditions as the discriminator, with no assumptions of convexity on the objectives or constraints. The second stage (efficient Pareto filter) extracts the strong Pareto optimal subset given the weak front from stage 1. Fritz-John conditions provide us with theoretical bounds on approximation error between the true and network extracted weak Pareto front. Numerical experiments demonstrates the accuracy and efficiency on a canonical set of benchmark problems and a fairness optimization task from prior works.

preprint2020arXiv

Adaptive Total Variation Stable Local Timestepping for Conservation Laws

This paper proposes a first-order total variation diminishing (TVD) treatment for coarsening and refining of local timestep size in response to dynamic local variations in wave speeds for nonlinear conservation laws. The algorithm is accompanied with a proof of formal correctness showing that given a sufficiently small minimum timestep the algorithm will produce TVD solution for nonlinear scalar conservation laws. A key feature of the algorithm is its formulation as a discrete event simulation, which allows for easy and efficient parallelization using existing software. Numerical results demonstrate the stability and adaptivity of the method for the shallow water equations. We also introduce a performance model to load balance and explain the observed performance gains. Performance results are presented for a single node on Stampede2's Skylake partition using an optimistic parallel discrete event simulator. Results show the proposed algorithm recovering 59%-77% of the theoretically achievable speed-up with the discrepancies being attributed to the cost of computing the CFL condition and load imbalance.

preprint2020arXiv

Discontinuous Galerkin methods for a dispersive wave hydro-morphodynamic model with bed-load transport

A dispersive wave hydro-morphodynamic model coupling the Green-Naghdi equations (the hydrodynamic part) with the sediment continuity Exner equation (the morphodynamic part) is presented. Numerical solution algorithms based on discontinuous Galerkin finite element discretizations of the model are proposed. The algorithms include both coupled and decoupled approaches for solving the hydrodynamic and morphodynamic parts simultaneously and separately from each other, respectively. The Strang operator splitting technique is employed to treat the dispersive terms separately, and it provides the ability to ignore the dispersive terms in specified regions, such as surf zones. Algorithms that can handle wetting-drying and detect wave breaking are presented. The numerical solution algorithms are validated with numerical experiments to demonstrate the ability of the algorithms to accurately resolve hydrodynamics of solitary and regular waves, and morphodynamic changes induced by such waves. The results indicate that the model has the potential to be used in studies of coastal morphodynamics driven by dispersive water waves, given that the hydrodynamic part resolves the water motion and dispersive wave effects with sufficient accuracy up to swash zones, and the morphodynamic model can capture the major features of bed erosion and deposition.

preprint2020arXiv

Discontinuous Galerkin methods for a dispersive wave hydro-sediment-morphodynamic model

A dispersive wave hydro-sediment-morphodynamic model developed by complementing the shallow water hydro-sediment-morphodynamic (SHSM) equations with the dispersive term from the Green-Naghdi equations is presented. A numerical solution algorithm for the model based on the second-order Strang operator splitting is presented. The model is partitioned into two parts, (1) the SHSM equations and (2) the dispersive correction part, which are discretized using discontinuous Galerkin finite element methods. This splitting technique provides a facility to select dynamically regions of a problem domain where the dispersive term is not applied, e.g. wave breaking regions where the dispersive wave model is no longer valid. Algorithms that can handle wetting-drying and detect wave breaking are provided and a number of numerical examples are presented to validate the developed numerical solution algorithm. The results of the simulations indicate that the model is capable of predicting sediment transport and bed morphodynamic processes correctly provided that the empirical models for the suspended and bed load transport are properly calibrated. Moreover, the developed model is able to accurately capture hydrodynamics and wave dispersion effects up to swash zones, and its application is justified for simulations where dispersive wave effects are prevalent.