Matching Items (17)
Filtering by
- All Subjects: Applied Mathematics
- Creators: Ringhofer, Christian
- Creators: Gelb, Anne
- Status: Published
Description
Advances in experimental techniques have allowed for investigation of molecular dynamics at ever smaller temporal and spatial scales. There is currently a varied and growing body of literature which demonstrates the phenomenon of \emph{anomalous diffusion} in physics, engineering, and biology. In particular many diffusive type processes in the cell have been observed to follow a power law $\left \propto t^\alpha$ scaling of the mean square displacement of a particle. This contrasts with the expected linear behavior of particles undergoing normal diffusion. \emph{Anomalous sub-diffusion} ($\alpha<1$) has been attributed to factors such as cytoplasmic crowding of macromolecules, and trap-like structures in the subcellular environment non-linearly slowing the diffusion of molecules. Compared to normal diffusion, signaling molecules in these constrained spaces can be more concentrated at the source, and more diffuse at longer distances, potentially effecting the signalling dynamics. As diffusion at the cellular scale is a fundamental mechanism of cellular signaling and additionally is an implicit underlying mathematical assumption of many canonical models, a closer look at models of anomalous diffusion is warranted. Approaches in the literature include derivations of fractional differential diffusion equations (FDE) and continuous time random walks (CTRW). However these approaches are typically based on \emph{ad-hoc} assumptions on time- and space- jump distributions. We apply recent developments in asymptotic techniques on collisional kinetic equations to develop a FDE model of sub-diffusion due to trapping regions and investigate the nature of the space/time probability distributions assosiated with trapping regions. This approach both contrasts and compliments the stochastic CTRW approach by positing more physically realistic underlying assumptions on the motion of particles and their interactions with trapping regions, and additionally allowing varying assumptions to be applied individually to the traps and particle kinetics.
ContributorsHoleva, Thomas Matthew (Author) / Ringhofer, Christian (Thesis advisor) / Baer, Steve (Thesis advisor) / Crook, Sharon (Committee member) / Gardner, Carl (Committee member) / Taylor, Jesse (Committee member) / Arizona State University (Publisher)
Created2014
Description
In vertebrate outer retina, changes in the membrane potential of horizontal cells affect the calcium influx and glutamate release of cone photoreceptors via a negative feedback. This feedback has a number of important physiological consequences. One is called background-induced flicker enhancement (BIFE) in which the onset of dim background enhances the center flicker response of horizontal cells. The underlying mechanism for the feedback is still unclear but competing hypotheses have been proposed. One is the GABA hypothesis, which states that the feedback is mediated by gamma-aminobutyric acid (GABA), an inhibitory neurotransmitter released from horizontal cells. Another is the ephaptic hypothesis, which contends that the feedback is non-GABAergic and is achieved through the modulation of electrical potential in the intersynaptic cleft between cones and horizontal cells. In this study, a continuum spine model of the cone-horizontal cell synaptic circuitry is formulated. This model, a partial differential equation system, incorporates both the GABA and ephaptic feedback mechanisms. Simulation results, in comparison with experiments, indicate that the ephaptic mechanism is necessary in order for the model to capture the major spatial and temporal dynamics of the BIFE effect. In addition, simulations indicate that the GABA mechanism may play some minor modulation role.
ContributorsChang, Shaojie (Author) / Baer, Steven M. (Thesis advisor) / Gardner, Carl L (Thesis advisor) / Crook, Sharon M (Committee member) / Kuang, Yang (Committee member) / Ringhofer, Christian (Committee member) / Arizona State University (Publisher)
Created2012
Description
This thesis considers the application of basis pursuit to several problems in system identification. After reviewing some key results in the theory of basis pursuit and compressed sensing, numerical experiments are presented that explore the application of basis pursuit to the black-box identification of linear time-invariant (LTI) systems with both finite (FIR) and infinite (IIR) impulse responses, temporal systems modeled by ordinary differential equations (ODE), and spatio-temporal systems modeled by partial differential equations (PDE). For LTI systems, the experimental results illustrate existing theory for identification of LTI FIR systems. It is seen that basis pursuit does not identify sparse LTI IIR systems, but it does identify alternate systems with nearly identical magnitude response characteristics when there are small numbers of non-zero coefficients. For ODE systems, the experimental results are consistent with earlier research for differential equations that are polynomials in the system variables, illustrating feasibility of the approach for small numbers of non-zero terms. For PDE systems, it is demonstrated that basis pursuit can be applied to system identification, along with a comparison in performance with another existing method. In all cases the impact of measurement noise on identification performance is considered, and it is empirically observed that high signal-to-noise ratio is required for successful application of basis pursuit to system identification problems.
ContributorsThompson, Robert C. (Author) / Platte, Rodrigo (Thesis advisor) / Gelb, Anne (Committee member) / Cochran, Douglas (Committee member) / Arizona State University (Publisher)
Created2012
Some topics concerning the singular value decomposition and generalized singular value decomposition
Description
This dissertation involves three problems that are all related by the use of the singular value decomposition (SVD) or generalized singular value decomposition (GSVD). The specific problems are (i) derivation of a generalized singular value expansion (GSVE), (ii) analysis of the properties of the chi-squared method for regularization parameter selection in the case of nonnormal data and (iii) formulation of a partial canonical correlation concept for continuous time stochastic processes. The finite dimensional SVD has an infinite dimensional generalization to compact operators. However, the form of the finite dimensional GSVD developed in, e.g., Van Loan does not extend directly to infinite dimensions as a result of a key step in the proof that is specific to the matrix case. Thus, the first problem of interest is to find an infinite dimensional version of the GSVD. One such GSVE for compact operators on separable Hilbert spaces is developed. The second problem concerns regularization parameter estimation. The chi-squared method for nonnormal data is considered. A form of the optimized regularization criterion that pertains to measured data or signals with nonnormal noise is derived. Large sample theory for phi-mixing processes is used to derive a central limit theorem for the chi-squared criterion that holds under certain conditions. Departures from normality are seen to manifest in the need for a possibly different scale factor in normalization rather than what would be used under the assumption of normality. The consequences of our large sample work are illustrated by empirical experiments. For the third problem, a new approach is examined for studying the relationships between a collection of functional random variables. The idea is based on the work of Sunder that provides mappings to connect the elements of algebraic and orthogonal direct sums of subspaces in a Hilbert space. When combined with a key isometry associated with a particular Hilbert space indexed stochastic process, this leads to a useful formulation for situations that involve the study of several second order processes. In particular, using our approach with two processes provides an independent derivation of the functional canonical correlation analysis (CCA) results of Eubank and Hsing. For more than two processes, a rigorous derivation of the functional partial canonical correlation analysis (PCCA) concept that applies to both finite and infinite dimensional settings is obtained.
ContributorsHuang, Qing (Author) / Eubank, Randall (Thesis advisor) / Renaut, Rosemary (Thesis advisor) / Cochran, Douglas (Committee member) / Gelb, Anne (Committee member) / Young, Dennis (Committee member) / Arizona State University (Publisher)
Created2012
Description
Modern measurement schemes for linear dynamical systems are typically designed so that different sensors can be scheduled to be used at each time step. To determine which sensors to use, various metrics have been suggested. One possible such metric is the observability of the system. Observability is a binary condition determining whether a finite number of measurements suffice to recover the initial state. However to employ observability for sensor scheduling, the binary definition needs to be expanded so that one can measure how observable a system is with a particular measurement scheme, i.e. one needs a metric of observability. Most methods utilizing an observability metric are about sensor selection and not for sensor scheduling. In this dissertation we present a new approach to utilize the observability for sensor scheduling by employing the condition number of the observability matrix as the metric and using column subset selection to create an algorithm to choose which sensors to use at each time step. To this end we use a rank revealing QR factorization algorithm to select sensors. Several numerical experiments are used to demonstrate the performance of the proposed scheme.
ContributorsIlkturk, Utku (Author) / Gelb, Anne (Thesis advisor) / Platte, Rodrigo (Thesis advisor) / Cochran, Douglas (Committee member) / Renaut, Rosemary (Committee member) / Armbruster, Dieter (Committee member) / Arizona State University (Publisher)
Created2015
Description
Factory production is stochastic in nature with time varying input and output processes that are non-stationary stochastic processes. Hence, the principle quantities of interest are random variables. Typical modeling of such behavior involves numerical simulation and statistical analysis. A deterministic closure model leading to a second order model for the product density and product speed has previously been proposed. The resulting partial differential equations (PDE) are compared to discrete event simulations (DES) that simulate factory production as a time dependent M/M/1 queuing system. Three fundamental scenarios for the time dependent influx are studied: An instant step up/down of the mean arrival rate; an exponential step up/down of the mean arrival rate; and periodic variation of the mean arrival rate. It is shown that the second order model, in general, yields significant improvement over current first order models. Specifically, the agreement between the DES and the PDE for the step up and for periodic forcing that is not too rapid is very good. Adding diffusion to the PDE further improves the agreement. The analysis also points to fundamental open issues regarding the deterministic modeling of low signal-to-noise ratio for some stochastic processes and the possibility of resonance in deterministic models that is not present in the original stochastic process.
ContributorsWienke, Matthew (Author) / Armbruster, Dieter (Thesis advisor) / Jones, Donald (Committee member) / Platte, Rodrigo (Committee member) / Gardner, Carl (Committee member) / Ringhofer, Christian (Committee member) / Arizona State University (Publisher)
Created2015
Description
Swarms of animals, fish, birds, locusts etc. are a common occurrence but their coherence and method of organization poses a major question for mathematics and biology.The Vicsek and the Attraction-Repulsion are two models that have been proposed to explain the emergence of collective motion. A major issue for the Vicsek Model is that its particles are not attracted to each other, leaving the swarm with alignment in velocity but without spatial coherence. Restricting the particles to a bounded domain generates global spatial coherence of swarms while maintaining velocity alignment. While individual particles are specularly reflected at the boundary, the swarm as a whole is not. As a result, new dynamical swarming solutions are found.
The Attraction-Repulsion Model set with a long-range attraction and short-range repulsion interaction potential typically stabilizes to a well-studied flock steady state solution. The particles for a flock remain spatially coherent but have no spatial bound and explore all space. A bounded domain with specularly reflecting walls traps the particles within a specific region. A fundamental refraction law for a swarm impacting on a planar boundary is derived. The swarm reflection varies from specular for a swarm dominated by
kinetic energy to inelastic for a swarm dominated by potential energy. Inelastic collisions lead to alignment with the wall and to damped pulsating oscillations of the swarm. The fundamental refraction law provides a one-dimensional iterative map that allows for a prediction and analysis of the trajectory of the center of mass of a flock in a channel and a square domain.
The extension of the wall collisions to a scattering experiment is conducted by setting two identical flocks to collide. The two particle dynamics is studied analytically and shows a transition from scattering: diverging flocks to bound states in the form of oscillations or parallel motions. Numerical studies of collisions of flocks show the same transition where the bound states become either a single translating flock or a rotating (mill).
The Attraction-Repulsion Model set with a long-range attraction and short-range repulsion interaction potential typically stabilizes to a well-studied flock steady state solution. The particles for a flock remain spatially coherent but have no spatial bound and explore all space. A bounded domain with specularly reflecting walls traps the particles within a specific region. A fundamental refraction law for a swarm impacting on a planar boundary is derived. The swarm reflection varies from specular for a swarm dominated by
kinetic energy to inelastic for a swarm dominated by potential energy. Inelastic collisions lead to alignment with the wall and to damped pulsating oscillations of the swarm. The fundamental refraction law provides a one-dimensional iterative map that allows for a prediction and analysis of the trajectory of the center of mass of a flock in a channel and a square domain.
The extension of the wall collisions to a scattering experiment is conducted by setting two identical flocks to collide. The two particle dynamics is studied analytically and shows a transition from scattering: diverging flocks to bound states in the form of oscillations or parallel motions. Numerical studies of collisions of flocks show the same transition where the bound states become either a single translating flock or a rotating (mill).
ContributorsThatcher, Andrea (Author) / Armbruster, Hans (Thesis advisor) / Motsch, Sebastien (Committee member) / Ringhofer, Christian (Committee member) / Platte, Rodrigo (Committee member) / Gardner, Carl (Committee member) / Arizona State University (Publisher)
Created2015
Description
Inverse problems model real world phenomena from data, where the data are often noisy and models contain errors. This leads to instabilities, multiple solution vectors and thus ill-posedness. To solve ill-posed inverse problems, regularization is typically used as a penalty function to induce stability and allow for the incorporation of a priori information about the desired solution. In this thesis, high order regularization techniques are developed for image and function reconstruction from noisy or misleading data. Specifically the incorporation of the Polynomial Annihilation operator allows for the accurate exploitation of the sparse representation of each function in the edge domain.
This dissertation tackles three main problems through the development of novel reconstruction techniques: (i) reconstructing one and two dimensional functions from multiple measurement vectors using variance based joint sparsity when a subset of the measurements contain false and/or misleading information, (ii) approximating discontinuous solutions to hyperbolic partial differential equations by enhancing typical solvers with l1 regularization, and (iii) reducing model assumptions in synthetic aperture radar image formation, specifically for the purpose of speckle reduction and phase error correction. While the common thread tying these problems together is the use of high order regularization, the defining characteristics of each of these problems create unique challenges.
Fast and robust numerical algorithms are also developed so that these problems can be solved efficiently without requiring fine tuning of parameters. Indeed, the numerical experiments presented in this dissertation strongly suggest that the new methodology provides more accurate and robust solutions to a variety of ill-posed inverse problems.
This dissertation tackles three main problems through the development of novel reconstruction techniques: (i) reconstructing one and two dimensional functions from multiple measurement vectors using variance based joint sparsity when a subset of the measurements contain false and/or misleading information, (ii) approximating discontinuous solutions to hyperbolic partial differential equations by enhancing typical solvers with l1 regularization, and (iii) reducing model assumptions in synthetic aperture radar image formation, specifically for the purpose of speckle reduction and phase error correction. While the common thread tying these problems together is the use of high order regularization, the defining characteristics of each of these problems create unique challenges.
Fast and robust numerical algorithms are also developed so that these problems can be solved efficiently without requiring fine tuning of parameters. Indeed, the numerical experiments presented in this dissertation strongly suggest that the new methodology provides more accurate and robust solutions to a variety of ill-posed inverse problems.
ContributorsScarnati, Theresa (Author) / Gelb, Anne (Thesis advisor) / Platte, Rodrigo (Thesis advisor) / Cochran, Douglas (Committee member) / Gardner, Carl (Committee member) / Sanders, Toby (Committee member) / Arizona State University (Publisher)
Created2018
Description
Need-based transfers (NBTs) are a form of risk-pooling in which binary welfare exchanges
occur to preserve the viable participation of individuals in an economy, e.g. reciprocal gifting
of cattle among East African herders or food sharing among vampire bats. With the
broad goal of better understanding the mathematics of such binary welfare and risk pooling,
agent-based simulations are conducted to explore socially optimal transfer policies
and sharing network structures, kinetic exchange models that utilize tools from the kinetic
theory of gas dynamics are utilized to characterize the wealth distribution of an NBT economy,
and a variant of repeated prisoner’s dilemma is analyzed to determine whether and
why individuals would participate in such a system of reciprocal altruism.
From agent-based simulation and kinetic exchange models, it is found that regressive
NBT wealth redistribution acts as a cutting stock optimization heuristic that most efficiently
matches deficits to surpluses to improve short-term survival; however, progressive
redistribution leads to a wealth distribution that is more stable in volatile environments and
therefore is optimal for long-term survival. Homogeneous sharing networks with low variance
in degree are found to be ideal for maintaining community viability as the burden and
benefit of NBTs is equally shared. Also, phrasing NBTs as a survivor’s dilemma reveals
parameter regions where the repeated game becomes equivalent to a stag hunt or harmony
game, and thus where cooperation is evolutionarily stable.
occur to preserve the viable participation of individuals in an economy, e.g. reciprocal gifting
of cattle among East African herders or food sharing among vampire bats. With the
broad goal of better understanding the mathematics of such binary welfare and risk pooling,
agent-based simulations are conducted to explore socially optimal transfer policies
and sharing network structures, kinetic exchange models that utilize tools from the kinetic
theory of gas dynamics are utilized to characterize the wealth distribution of an NBT economy,
and a variant of repeated prisoner’s dilemma is analyzed to determine whether and
why individuals would participate in such a system of reciprocal altruism.
From agent-based simulation and kinetic exchange models, it is found that regressive
NBT wealth redistribution acts as a cutting stock optimization heuristic that most efficiently
matches deficits to surpluses to improve short-term survival; however, progressive
redistribution leads to a wealth distribution that is more stable in volatile environments and
therefore is optimal for long-term survival. Homogeneous sharing networks with low variance
in degree are found to be ideal for maintaining community viability as the burden and
benefit of NBTs is equally shared. Also, phrasing NBTs as a survivor’s dilemma reveals
parameter regions where the repeated game becomes equivalent to a stag hunt or harmony
game, and thus where cooperation is evolutionarily stable.
ContributorsKayser, Kirk (Author) / Armbruster, Dieter (Thesis advisor) / Lampert, Adam (Committee member) / Ringhofer, Christian (Committee member) / Motsch, Sebastien (Committee member) / Gardner, Carl (Committee member) / Arizona State University (Publisher)
Created2018
Description
Divergence-free vector field interpolants properties are explored on uniform and scattered nodes, and also their application to fluid flow problems. These interpolants may be applied to physical problems that require the approximant to have zero divergence, such as the velocity field in the incompressible Navier-Stokes equations and the magnetic and electric fields in the Maxwell's equations. In addition, the methods studied here are meshfree, and are suitable for problems defined on complex domains, where mesh generation is computationally expensive or inaccurate, or for problems where the data is only available at scattered locations.
The contributions of this work include a detailed comparison between standard and divergence-free radial basis approximations, a study of the Lebesgue constants for divergence-free approximations and their dependence on node placement, and an investigation of the flat limit of divergence-free interpolants. Finally, numerical solvers for the incompressible Navier-Stokes equations in primitive variables are implemented using discretizations based on traditional and divergence-free kernels. The numerical results are compared to reference solutions obtained with a spectral
method.
The contributions of this work include a detailed comparison between standard and divergence-free radial basis approximations, a study of the Lebesgue constants for divergence-free approximations and their dependence on node placement, and an investigation of the flat limit of divergence-free interpolants. Finally, numerical solvers for the incompressible Navier-Stokes equations in primitive variables are implemented using discretizations based on traditional and divergence-free kernels. The numerical results are compared to reference solutions obtained with a spectral
method.
ContributorsAraujo Mitrano, Arthur (Author) / Platte, Rodrigo (Thesis advisor) / Wright, Grady (Committee member) / Welfert, Bruno (Committee member) / Gelb, Anne (Committee member) / Renaut, Rosemary (Committee member) / Arizona State University (Publisher)
Created2016