An official website of the United States government
Abstract We implemented a hybrid continuous solver for fluid electrons and kinetic ions. Because the simulation is continuous, numerical noise is not an issue as it is for particle‐in‐cell approaches. Moreover, given that the ion kinetic equation is solved using a characteristic based method, no particle pushes have to be done. Our main goals are to reduce the computational cost of the simulations proposed by Kovalev (Kovalev et al., 2008,https://doi.org/10.5194/angeo2628532008) and reproduce the main experimental features of Farley‐Buneman instabilities measured by radars and rockets. The equations were derived from first principles using the approximations that are satisfied in the auroral E‐region. Various tests will be presented to assess numerical accuracy. With the proposed numerical framework, we are able to recover important nonlinear features associated with Farley‐Buneman instabilities: wave turning of dominant modes, and saturation of density irregularities at values consistent with experiments.
more »
« less
The ocular mathematical virtual simulator: A validated multiscale model for hemodynamics and biomechanics in the human eye
Abstract We present our continuous efforts from a modeling and numerical viewpoint to develop a powerful and flexible mathematical and computational framework called Ocular Mathematical Virtual Simulator (OMVS). The OMVS aims to solve problems arising in biomechanics and hemodynamics within the human eye. We discuss our contribution towards improving the reliability and reproducibility of computational studies by performing a thorough validation of the numerical predictions against experimental data. The OMVS proved capable of simulating complex multiphysics and multiscale scenarios motivated by the study of glaucoma. Furthermore, its modular design allows the continuous integration of new models and methods as the research moves forward, and supports the utilization of the OMVS as a promising non‐invasive clinical investigation tool for personalized research in ophthalmology.
more »
« less
- Award ID(s):
- 2327640
- PAR ID:
- 10493527
- Publisher / Repository:
- Wiley Blackwell (John Wiley & Sons)
- Date Published:
- Journal Name:
- International Journal for Numerical Methods in Biomedical Engineering
- Volume:
- 40
- Issue:
- 2
- ISSN:
- 2040-7939
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
null (Ed.)Phase retrieval, i.e. the problem of recovering a function from the squared magnitude of its Fourier transform, arises in many applications, such as X-ray crystallography, diffraction imaging, optics, quantum mechanics and astronomy. This problem has confounded engineers, physicists, and mathematicians for many decades. Recently, phase retrieval has seen a resurgence in research activity, ignited by new imaging modalities and novel mathematical concepts. As our scientific experiments produce larger and larger datasets and we aim for faster and faster throughput, it is becoming increasingly important to study the involved numerical algorithms in a systematic and principled manner. Indeed, the past decade has witnessed a surge in the systematic study of computational algorithms for phase retrieval. In this paper we will review these recent advances from a numerical viewpoint.more » « less
-
Bayesian Networks (BNs) represent conditional probability relations among a set of random variables (nodes) in the form of a directed acyclic graph (DAG), and have found diverse applications in knowledge discovery. We study the problem of learning the sparse DAG structure of a BN from continuous observational data. The central problem can be modeled as a mixed-integer program with an objective function composed of a convex quadratic loss function and a regularization penalty subject to linear constraints. The optimal solution to this mathematical program is known to have desirable statistical properties under certain conditions. However, the state-of-the-art optimization solvers are not able to obtain provably optimal solutions to the existing mathematical formulations for medium-size problems within reasonable computational times. To address this difficulty, we tackle the problem from both computational and statistical perspectives. On the one hand, we propose a concrete early stopping criterion to terminate the branch-and-bound process in order to obtain a near-optimal solution to the mixed-integer program, and establish the consistency of this approximate solution. On the other hand, we improve the existing formulations by replacing the linear “big-M " constraints that represent the relationship between the continuous and binary indicator variables with second-order conic constraints. Our numerical results demonstrate the effectiveness of the proposed approaches.more » « less
-
Abstract Contemporary science is a field that is becoming increasingly computational. Today’s scientists not only leverage computational tools to conduct their investigations, they often must contribute to the design of the computational tools for their specific research. From a science education perspective, for students to learn authentic science practices, students must learn to use the tools of the trade. This necessity in science education has shaped recent K–12 science standards including the Next Generation Science Standards, which explicitly mention the use of computational tools and simulations. These standards, in particular, have gone further and mandated thatcomputational thinkingbe taught and leveraged as a practice of science. While computational thinking is not a new term, its inclusion in K–12 science standards has led to confusion about what the term means in the context of science learning and to questions about how to differentiate computational thinking from other commonly taught cognitive skills in science like problem-solving, mathematical reasoning, and critical thinking. In this paper, we propose a definition ofcomputational thinking for science(CT-S) and a framework for its operationalization in K–12 science education. We situate our definition and framework in Activity Theory, from the learning sciences, in order to position computational thinking as an input to and outcome of science learning that is mediated by computational tools.more » « less
-
Summary Digital MemComputing machines (DMMs), which employ nonlinear dynamical systems with memory (time non‐locality), have proven to be a robust and scalable unconventional computing approach for solving a wide variety of combinatorial optimization problems. However, most of the research so far has focused on the numerical simulations of the equations of motion of DMMs. This inevitably subjects time to discretization, which brings its own (numerical) issues that would be otherwise absent in actual physical systems operating in continuous time. Although hardware realizations of DMMs have been previously suggested, their implementation would require materials and devices that are not so easy to integrate with traditional electronics. Addressing this, our study introduces a novel hardware design for DMMs, utilizing readily available electronic components. This approach not only significantly boosts computational speed compared to current models but also exhibits remarkable robustness against additive noise. Crucially, it circumvents the limitations imposed by numerical noise, ensuring enhanced stability and reliability during extended operations. This paves a new path for tackling increasingly complex problems, leveraging the inherent advantages of DMMs in a more practical and accessible framework.more » « less
