Browsing Computational and Applied Mathematics by Title
Now showing items 328347 of 779

Edge Guided Reconstruction for Compressive Imaging
(20120703)We propose EdgeCS—an edge guided compressive sensing reconstruction approach—to recover images of higher quality from fewer measurements than the current methods. Edges are important image features that are used in various ... 
Effective Computation of the Analytic Center of the Solution Set in Linear Programming Using PrimalDual InteriorPoint Methods
(199412)The centrality property satisfied by the analytic center of the solution set makes its computation very valuable for some linear programming applications. One such application coming from the economic and management sciences ... 
Effects of Lag and Maximum Growth in Contaminant Transport and Biodegradation Modeling
(199204)The effects of time lag and maximum microbial growth on biodegradation in contaminant transport are discussed. A mathematical model is formulated that accounts for these effects, and a numerical case study is presented ... 
The Effects of Theta Precession on Spatial Learning and Simplicial Complex Dynamics in a Topological Model of the Hippocampal Spatial Map
(2014)Learning arises through the activity of large ensembles of cells, yet most of the data neuroscientists accumulate is at the level of individual neurons; we need models that can bridge this gap. We have taken spatial learning ... 
Efficient and Accurate Simulation of IntegrateandFire Neuronal Networks in the Hippocampus
(200712)This thesis evaluates a method of computing highly accurate solutions for network simulations of integrateandfire (IAF) neurons. Simulations are typically evolved using timestepping, but since the IAF model is composed ... 
Efficient estimation of coherent risk measures for riskaverse optimization problems governed by partial differential equations with random inputs
(201705)This thesis assesses and designs structureexploiting methods for the efficient estimation of risk measures of quantities of interest in the context of optimization of partial differential equations (PDEs) with random ... 
An Efficient GaussNewton Algorithm for Symmetric LowRank Product Matrix Approximations
(2015)We derive and study a GaussNewton method for computing a symmetric lowrank product $XX^{{T}}$, where $X \in{\mathbb{R}}^{n\times k}$ for $k<n$, that is the closest to a given symmetric matrix $A \in{\mathbb{R}}^{n\times ... 
Efficient mesh management in Firedrake using PETScDMPlex
(2016)The use of composable abstractions allows the application of new and established algorithms to a wide range of problems, while automatically inheriting the benefits of wellknown performance optimizations. This work ... 
Efficient Numerical Methods for LeastNorm Regularization
(201003)The problem min x, s.t. bAx≤ ε arises in the regularization of discrete forms of illposed problems when an estimate of the noise level in the data is available. After deriving necessary and sufficient optimality ... 
Eigenvalue Estimates for Symmetric Matrices
(198712)Symmetric and symmetric positive definite matrices have been extensively studied, and there are good characterizations of these sets. We wish to use the setting that in <em>R^{n × n}</em>, the set of symmetric ... 
Electromagnetic Propagation and Scattering in SphericallySymmetric Terrestrial SystemModels
(198604)A study of the quantitative solutional approaches to boundaryvalue problems associated with terrestrial electromagnetic propagation is carried out, with particular attention given to sphericalsystem models and the frequency ... 
Error Estimates for Godunov Mixed Methods for Nonlinear Parabolic Equations
(198805)Many computational fluids problems are described by nonlinear parabolic partial differential equations. These equations generally involve advection (transport) and a small diffusion term, and in some cases, chemical ... 
Error Forgetting of Bregman Iteration
(201201)This short article analyzes an interesting property of the Bregman iterative procedure for minimizing a convex piecewise linear function J(x) subject to linear constraints Ax=b. The procedure obtains its solution by solving ... 
Exact and Inexact Newton Linesearch InteriorPoint Algorithms for Nonlinear Programming Problems
(199705)In the first part of this research we consider a linesearch globalization of the local primaldual interiorpoint Newton's method for nonlinear programming recently introduced by ElBakry, Tapia, Tsuchiya, and Zhang. Our ... 
Explicit/Implicit, Conservative, Galerkin Domain Decomposition Procedures for Parabolic Problems
(199010)Several domain decomposition methods for approximating solutions of parabolic problems are given. These methods rely on implicit Galerkin procedures in the subdomains and explicit flux calculation on the interdomain ... 
Extending the Farkas Lemma Approach to Necessity Conditions to Infinite Programming
(199107)Under mild assumptions, the classical Farkas lemma approach to Lagrange multiplier theory is extended to an infinite programming formulation. The main result generalizes the usual firstorder necessity conditions to address ... 
Extracting Kinetic and Stationary Distribution Information from Short MD Trajectories via a Collection of Surrogate Diffusion Models
(200810)Lowdimensional stochastic models can summarize dynamical information and make long time predictions associated with observables of complex atomistic systems. Maximum likelihood based techniques for estimating lowdimensional ... 
Extracting Respiratory Signals from Thoracic Cone Beam CT Projections
(201210)Patient respiratory signal associated with the cone beam CT (CBCT) projections is important for lung cancer radiotherapy. In contrast to monitoring an external surrogate of respiration, such signal can be extracted directly ...