Browsing UMBC Mathematics and Statistics Department by Title
Now showing items 140159 of 230

On adaptive BDDC for the flow in heterogeneous porous media
(20190107)We study a method based on Balancing Domain Decomposition by Constraints (BDDC) for a numerical solution of a singlephase flow in heterogenous porous media. The method solves for both flux and pressure variables. The ... 
On Surrogate Learning for Linear Stability Assessment of NavierStokes Equations with Stochastic Viscosity
(20210228)We study linear stability of solutions to the Navier\textendash Stokes equations with stochastic viscosity. Specifically, we assume that the viscosity is given in the form of a~stochastic expansion. Stability analysis ... 
On the connectedness of spectral sets and irreducibility of spectral cones in Euclidean Jordan algebras
(2018)Let V be a Euclidean Jordan algebra of rank n. A set E in V is said to be a spectral set if there exists a permutation invariant set Q in Rn such that E = λ−1(Q), where λ : V → Rn is the eigenvalue map that takes x ∈ V to ... 
On the construction of unbiased estimators for the group testing problem
(2018)Debiased estimation has long been an area of research in the group testing literature. This has led to the development of many estimators minimizing bias and, most recently, an unbiased estimator based on sequential ... 
On the Validity of the Girsanov Transformation Method for Sensitivity Analysis of Stochastic Chemical Reaction Networks
We investigate the validity of the Girsanov Transformation (GT) method for parametric sensitivity analysis of stochastic models of chemical reaction networks. The validity depends on the likelihood ratio process being a ... 
The Optimal Relaxation Parameter for the SOR Method Applied to the Poisson Equation in Any Space Dimensions
(Elsevier Ltd, 20090324)The finite difference discretization of the Poisson equation with Dirichlet boundary conditions leads to a large, sparse system of linear equations for the solution values at the interior mesh points. This problem is a ... 
Optimization of Computations Used in Information Theory Applied to Base Pair Analysis
(2011)Information theory is used in biology as an approach to analyzing and discovering enzyme binding sites in DNA. By using entropy, a measure of uncertainty, to analyze samples, information can be gained to make predictions ... 
Parallel Hyperparameter Tuning of Accuracy for Deep Learning based Tornado Predictions
Predicting violent storms and dangerous weather conditions with current physics based weather models can take a long time due to the immense complexity associated with numerical simulations. Machine learning has the potential ... 
Parallel Performance Studies for a 3D Elliptic Test Problem on the 2018 Portion of the Taki Cluster
The new 2018 nodes in the CPU cluster taki in the UMBC High Performance Computing Facility contain two 18core Intel Skylake CPUs and 384 GB of memory per node, connected by an EDR (Enhanced Data Rate) InfiniBand interconnect. ... 
Parallel Performance Studies for a Clustering Algorithm
(2008)Affinity propagation is a clustering algorithm that functions by identifying similar datapoints in an iterative process. Its structure allows for taking full advantage of parallel computing by enabling the solution of ... 
Parallel Performance Studies for a Hyperbolic Test Problem
(2008)The performance of parallel computer code depends on an intricate interplay of the processors, the architecture of the compute nodes, their interconnect network, the numerical algorithm, and the scheduling policy used. ... 
Parallel Performance Studies for a Maximum Likelihood Estimation Problem Using TAO
(2009)In this report, we present an application of parallel computing to an estimation procedure in statistics. The method of maximum likelihood estimation (MLE) is based on the ability to perform maximizations of probability ... 
Parallel Performance Studies for a Parabolic Test Problem
(2008)The performance of a parallel computer depends on an intricate interplay of the processors, the architecture of the compute nodes, their interconnect network, the numerical algorithm, and the scheduling policy used. This ... 
Parallel Performance Studies for a Parabolic Test Problem on maya 2013
(2014)We report parallel performance studies on the newest portion of the cluster maya in the UMBC High Performance Computing Facility (HPCF), referred to as maya 2013, for a parabolic test problem given by a timedependent, ... 
Parallel Performance Studies for a Parabolic Test Problem on the Cluster maya
(2015)We report parallel performance studies on each of the three uniform portions, from 2009, 2010, and 2013, of the cluster maya in the UMBC High Performance Computing Facility (HPCF) for a parabolic test problem given by a ... 
Parallel Performance Studies for a Parabolic Test Problem on the Cluster tara
(2010)The performance of parallel computer code depends on the intricate interplay of processors, the architecture of the computer nodes, their interconnect network, the numerical algorithm, and its implementation. The solution ... 
Parallel Performance Studies for a ThreeSpecies Application Problem on maya 2013
(2014)High performance parallel computing depends on the interaction of a number of factors including the processors, the architecture of the compute nodes, their interconnect network, and the numerical method, and its implication. ... 
Parallel Performance Studies for a ThreeSpecies Application Problem on the Cluster maya
(2015)High performance parallel computing depends on the interaction of a number of factors including the processors, the architecture of the compute nodes, their interconnect network, and the numerical method, and its implication. ... 
Parallel Performance Studies for a ThreeSpecies Application Problem on the Cluster tara
(2010)High performance parallel computing depends on the interaction of a number of factors including the processors, the architecture of the compute nodes, their interconnect network, and the numerical code. In this note, we ... 
Parallel Performance Studies for an Elliptic Test Problem
(2008)The performance of parallel computer code depends on an intricate interplay of the processors, the architecture of the compute nodes, their interconnect network, the numerical algorithm, and the scheduling policy used. The ...