Physical Sciences and Mathematics Commons^™

Locally Convex Words And Permutations, Christopher Coscia, Jonathan Dewitt

Dartmouth Scholarship

We introduce some new classes of words and permutations characterized by the second difference condition pi(i - 1) + pi(i + 1) - 2 pi(i)

Modeling Neurovascular Coupling From Clustered Parameter Sets For Multimodal Eeg-Nirs, M. Tanveer Talukdar, H. Robert Frost, Solomon G. G. Diamond

Dartmouth Scholarship

Despite significant improvements in neuroimaging technologies and analysis methods, the fundamental relationship between local changes in cerebral hemodynamics and the underlying neural activity remains largely unknown. In this study, a data driven approach is proposed for modeling this neurovascular coupling relationship from simultaneously acquired electroencephalographic (EEG) and near-infrared spectroscopic (NIRS) data. The approach uses gamma transfer functions to map EEG spectral envelopes that reflect time-varying power variations in neural rhythms to hemodynamics measured with NIRS during median nerve stimulation. The approach is evaluated first with simulated EEG-NIRS data and then by applying the method to experimental EEG-NIRS data measured from …

Spectrally Accurate Quadratures For Evaluation Of Layer Potentials Close To The Boundary For The 2d Stokes And Laplace Equations, Alex Barnett, Bowei Wu, Shravan Veerapaneni

Dartmouth Scholarship

Dense particulate flow simulations using integral equation methods demand accurate evaluation of Stokes layer potentials on arbitrarily close interfaces. In this paper, we generalize techniques for close evaluation of Laplace double-layer potentials in [J. Helsing and R. Ojala, J. Comput. Phys., 227 (2008), pp. 2899--2921]. We create a “globally compensated” trapezoid rule quadrature for the Laplace single-layer potential on the interior and exterior of smooth curves. This exploits a complex representation, a product quadrature (in the style of Kress) for the sawtooth function, careful attention to branch cuts, and second-kind barycentric-type formulae for Cauchy integrals and their derivatives. Upon …

A Comparison Of Five Malaria Transmission Models: Benchmark Tests And Implications For Disease Control, Dorothy I. Wallace, Ben S. Southworth, Xun Shi, Jonathan W. Chipman, Andrew K. Githeko

Dartmouth Scholarship

Background: Models for malaria transmission are usually compared based on the quantities tracked, the form taken by each term in the equations, and the qualitative properties of the systems at equilibrium. Here five models are compared in detail in order to develop a set of performance measures that further illuminate the differences among models.

Methods: Five models of malaria transmission are compared. Parameters are adjusted to correspond to similar biological quantities across models. Nine choices of parameter sets/initial conditions are tested for all five models. The relationship between malaria incidence in humans and (1) malaria incidence in vectors, (2) man-biting …

A Direct Solver With O(N) Complexity For Variable Coefficient Elliptic Pdes Discretized Via A High-Order Composite Spectral Collocation Method, A. Gillman, P. G. Martinsson

Dartmouth Scholarship

A numerical method for solving elliptic PDEs with variable coefficients on two-dimensional domains is presented. The method is based on high-order composite spectral approximations and is designed for problems with smooth solutions. The resulting system of linear equations is solved using a direct (as opposed to iterative) solver that has optimal $O(N)$ complexity for all stages of the computation when applied to problems with nonoscillatory solutions such as the Laplace and the Stokes equations. Numerical examples demonstrate that the scheme is capable of computing solutions with a relative accuracy of $10^{-10}$ or better for challenging problems such as highly oscillatory …

Multiple Subject Barycentric Discriminant Analysis (Musubada): How To Assign Scans To Categories Without Using Spatial Normalization, Hervé Abdi, Lynne J. Williams, Andrew C. Connolly, M. Ida Gobbini

Dartmouth Scholarship

We present a new discriminant analysis (DA) method called Multiple Subject Barycentric Discriminant Analysis (MUSUBADA) suited for analyzing fMRI data because it handles datasets with multiple participants that each provides different number of variables (i.e., voxels) that are themselves grouped into regions of interest (ROIs). Like DA, MUSUBADA (1) assigns observations to predefined categories, (2) gives factorial maps displaying observations and categories, and (3) optimally assigns observations to categories. MUSUBADA handles cases with more variables than observations and can project portions of the data table (e.g., subtables, which can represent participants or ROIs) on the factorial maps. Therefore MUSUBADA can …

Computing Isotypic Projections With The Lanczos Iteration, David K. Maslen, Michael E. Orrison, Daniel N. Rockmore

Dartmouth Scholarship

When the isotypic subspaces of a representation are viewed as the eigenspaces of a symmetric linear transformation, isotypic projections may be achieved as eigenspace projections and computed using the Lanczos iteration. In this paper, we show how this approach gives rise to an efficient isotypic projection method for permutation representations of distance transitive graphs and the symmetric group.

Asymptotically Tight Bounds For Performing Bmmc Permutations On Parallel Disk Systems, Thomas H. Cormen, Thomas Sundquist, Leonard F. Wisniewski

Dartmouth Scholarship

This paper presents asymptotically equal lower and upper bounds for the number of parallel I/O operations required to perform bit-matrix-multiply/complement (BMMC) permutations on the Parallel Disk Model proposed by Vitter and Shriver. A BMMC permutation maps a source index to a target index by an affine transformation over GF(2), where the source and target indices are treated as bit vectors. The class of BMMC permutations includes many common permutations, such as matrix transposition (when dimensions are powers of 2), bit-reversal permutations, vector-reversal permutations, hypercube permutations, matrix reblocking, Gray-code permutations, and inverse Gray-code permutations. The upper bound improves upon the asymptotic …

Fast Discrete Polynomial Transforms With Applications To Data Analysis For Distance Transitive Graphs, J. R. Driscoll, D. M. Healy, D. N. Rockmore

Dartmouth Scholarship

Let $\poly = \{P_0,\dots,P_{n-1}\}$ denote a set of polynomials with complex coefficients. Let $\pts = \{z_0,\dots,z_{n-1}\}\subset \cplx$ denote any set of {\it sample points}. For any $f = (f_0,\dots,f_{n-1}) \in \cplx^n$, the {\it discrete polynomial transform} of f (with respect to $\poly$ and $\pts$) is defined as the collection of sums, $\{\fhat(P_0),\dots,\fhat(P_{n-1})\}$, where $\fhat(P_j) = \langle f,P_j \rangle = \sum_{i=0}^{n-1} f_iP_j(z_i)w(i)$ for some associated weight function w. These sorts of transforms find important applications in areas such as medical imaging and signal processing.

In this paper, we present fast algorithms for computing discrete orthogonal polynomial transforms. For a system …

Decay Of The Relative Error In The Formation Of Acoustic Bullets, Harry E. Moses, Reese T. Prosser

Dartmouth Scholarship

In a previous paper, the authors showed how to construct certain solutions of the acoustic and electromagnetic wave equations in three dimensions, which are constrained asymptotically to a narrow conical sector of an outgoing spherical shell, i.e., which behave like “bullets.” In this paper, it is shownthat, in the acoustic case, the magnitude of the relative error between the true solution and its asymptotic form decays in time according to an inverse square root law.
Read More: https://epubs.siam.org/doi/10.1137/0153025