Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Elliptic problems”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 163 records · Page 9

Periodic Orbit-Attitude Solutions in the Planar Elliptic Restricted Three-Body Problem

The pitch motion of a spacecraft in the planar elliptic restricted three-body system is studied. Previous studies laid the foundation for spacecraft stability analysis with a small perturbation to the zero pitch motion. In this study, a cell mapping approach that combines analytical and numerical techniques is used to study the global behavior of the full nonlinear spacecraft attitude in which coupling between orbital dynamics and attitude occurs. The effect of gravity gradient torques, orbital eccentricity, and the spacecraft configuration at different Lagrangian points is analyzed. Multiple-period periodic solutions and invariant surfaces are presented for different cases. Reference trajectories around the Lagrangian points are also considered to study coupled dynamics.

Koh, Dayung↗

Numerical integration of periodic orbits in the elliptic restricted three-body problem

The problem of finding periodic orbits in the circular restricted three-body problem has been very extensively studied in celestial mechanics. It is well known that continuous families of periodic orbits exist, for which the period varies in a continuous way. However, all the applications which are found in the solar system correspond to cases with non-zero eccentricities, and the elliptic restricted three-body problem is thus a better approximation than the circular one. For instance, for the motion of a satellite in the Earth-Moon system, as a first approximation, we may assume that the Moon moves around the Earth in circular motion; but as a much better approximation, we can also assume that the Moon moves in an elliptic orbit around the Earth.

NUMERICAL INTEGRATION↗

The nonconforming virtual element method for eigenvalue problems

We analyse the nonconforming Virtual Element Method (VEM) for the approximation of elliptic eigenvalue problems. The nonconforming VEM allow to treat in the same formulation the two- and three-dimensional case.We present two possible formulations of the discrete problem, derived respectively by the nonstabilized and stabilized approximation of the L 2 -inner product, and we study the convergence properties of the corresponding discrete eigenvalue problems. The proposed schemes provide a correct approximation of the spectrum and we prove optimal-order error estimates for the eigenfunctions and the usual double order of convergence of the eigenvalues. Finally we show a large set of numerical tests supporting the theoretical results, including a comparison with the conforming Virtual Element choice.

97 MATHEMATICS AND COMPUTING↗

The nonconforming Virtual Element Method for eigenvalue problems

In this work, we analyse the nonconforming Virtual Element Method (VEM) for the approximation of elliptic eigenvalue problems. The nonconforming VEM allows to treat in the same formulation the two- and three-dimensional case. We present two possible formulations of the discrete problem, derived respectively by the nonstabilized and stabilized approximation of the $L^2$-inner product, and we study the convergence properties of the corresponding discrete eigenvalue problem. The proposed schemes provide a correct approximation of the spectrum, in particular we prove optimal-order error estimates for the eigenfunctions and the usual double order of convergence of the eigenvalues. Finally we show a large set of numerical tests supporting the theoretical results, including a comparison with the conforming Virtual Element choice.

97 MATHEMATICS AND COMPUTING↗

Numerical calculations of flow fields

The solutions to the equations of motion for inviscid fluid flow around a pointed elliptic cone at incidence are presented. The numerical method used, MacCormack's second order preferential predictor-corrector finite difference approximation, is applied to the fluid flow equations derived in conservation-law form. The entropy boundary condition, hitherto unused for elliptic cone problems, is investigated and compared to reflection boundary condition solutions. The stagnation streamline movement of the inclined elliptic cone is noted and surface pressure coefficients are plotted. Also presented are solutions for an elliptic cone and a circular cone at zero incidence and a circular cone at a small angle of attack. Comparisons are made between these present solutions and previously published theory.

Anderson, D. M.↗

Film thickness for different regimes of fluid-film lubrication

Mathematical formulas are presented which express the dimensionless minimum film thickness for the four lubrication regimes found in elliptical contacts: isoviscous-rigid regime; piezoviscous-rigid regime; isoviscous-elastic regime; and piezoviscous-elastic regime. The relative importance of pressure on elastic distortion and lubricant viscosity is the factor that distinguishes these regimes for a given conjunction geometry. In addition, these equations were used to develop maps of the lubrication regimes by plotting film thickness contours on a log-log grid of the dimensionless viscosity and elasticity parameters for three values of the ellipticity parameter. These results present a complete theoretical film thickness parameter solution for elliptical constants in the four lubrication regimes. The results are particularly useful in initial investigations of many practical lubrication problems involving elliptical conjunctions.

Hamrock, B. J.↗

A Control Variate Method for Probabilistic Performance Assessment. Improved Estimates for Mean Performance Quantities of Interest

We present a method of control variates for calculating improved estimates for mean performance quantities of interest, E(PQI) , computed from Monte Carlo probabilistic simulations. An example of a PQI is the concentration of a contaminant at a particular location in a problem domain computed from simulations of transport in porous media. To simplify the presentation, the method is described in the setting of a one- dimensional elliptical model problem involving a single uncertain parameter represented by a probability distribution. The approach can be easily implemented for more complex problems involving multiple uncertain parameters and in particular for application to probabilistic performance assessment of deep geologic nuclear waste repository systems. Numerical results indicate the method can produce estimates of E(PQI)having superior accuracy on coarser meshes and reduce the required number of simulations needed to achieve an acceptable estimate.

97 MATHEMATICS AND COMPUTING↗

Periodic orbits in the Planar General Three-Body Problem

The article contains a numerical study of periodic solutions of the Planar General Three-Body Problem. Several new periodic solutions have been discovered and are described. In particular, there is a continuous family with variable masses, extending all the way from the elliptic restricted problem to the general problem with three equal masses. All our examples have special symmetry properties which are described in detail. Finally we also suggest some important applications to the natural satellites of the solar system.

Broucke, R.↗

Canonical solution of the two critical argument problem

The solution by Sessin and Ferraz-Mello (1984) of the Hori auxiliary system for the motion of two planets with periods nearly commensurate in the ratio 2:1 is considerably simplified by the introduction of canonical variables. An analogous canonical transformation simplifies the elliptic restricted problem.

Wisdom, J.↗

Solution of Boundary Value Problems in Cylinders with Two-Layer Film Inclusions

We consider the class of boundary value problems for elliptic, parabolic, and hyperbolic equations in cylinders separated by a two-layer film into two half-cylinders. We prove the existence and uniqueness theorem and express the solutions in terms of solutions to analogous classical problems in cylinders without films.

97 MATHEMATICS AND COMPUTING↗

Interior energy error estimates for the weak Galerkin finite element method

Consider the Poisson equation in a polytopal domain ΩRC d (d=2,3) as the model problem. In this paper, we study interior energy error estimates for the weak Galerkin finite element approximation to elliptic boundary value problems. In particular, we show that the interior error in the energy norm is bounded by three components: the best local approximation error, the error in negative norms, and the trace error on the element boundaries. This implies that the interior convergence rate can be polluted by solution singularities on the domain boundary, even when the solution is smooth in the interior region. Numerical results are reported to support the theoretical findings. Lastly, to the best of our knowledge, this is the first local energy error analysis that applies to general meshes consisting of polytopal elements and hanging nodes.

97 MATHEMATICS AND COMPUTING↗

Development of a Novel Accelerator for Neutron Transport Solution Using the Galerkin Spectral Element Methods (Final Report)

This report summarizes the results of a three-year research project sponsored by the U.S. Department of Energy (DOE) Nuclear Energy University Program (NEUP) to develop and implement advanced acceleration schemes for the DOE NEAMS neutronics code PROTEUSSN. The project team included the University of Massachusetts Lowell, The Ohio State University, University of Michigan, and Argonne National Laboratory. The PROTEUS code is a high-fidelity capable deterministic neutron transport code based on unstructured finite element meshes, which solves the steady-state and transient neutron transport problem using the 2nd-order discrete ordinate method (SN2ND), the method of characteristics (MOC), and the advanced nodal transport method (NODAL). The DSA scheme has been implemented in PROTEUS to speed up SN transport calculations. The existing DSA scheme employs a consistent finite element formulation on the same fine mesh structure as the SN solution While the use of consistent discretizations makes the DSA method effective, it does not necessarily make it efficient because the numerical solution of a discretized elliptic diffusion problem itself can be costly, particularly when the problem size becomes large. We developed a new discontinuous Galerkin (DG) discretization of the diffusion equation, called DG-DSA, which can effectively and efficiently accelerate the SN transport iterations. As compared with the previous work, the novelty of our method is that the diffusion equation is solved on a coarse-mesh grid using the DG methods, and the DG diffusion discretization incorporates local hp adaptation, i.e., local adaptation of mesh size and/or polynomial degree, based on local total cross section (or optical thickness). Therefore, the resulting number of degrees of freedom (DOF) of the DG discretization is much less than the conventional consistent DSA discretizations, and thus DG-DSA can achieve significant improvement in computational efficiency. We implemented this scheme in PROTEUS-SN. In addition, we developed a new stabilization scheme named linear prolongation CMFD (lpCMFD). A novel feature of this scheme is that the conventional flat flux ratio–based scaling approach is replaced with a linear interpolation of the scalar flux differences at the coarse-mesh cell edges between the neutron transport and CMFD calculations. Fourier convergence analysis and numerical results show that lpCMFD is unconditionally stable and more effective than other CMFD based on acceleration schemes such as pCMFD, odCMFD. We also developed a new nonlinear diffusion acceleration scheme for solving neutron transport equations. This scheme, called LR-NDA, employs a local refinement approach on the framework of CMFD by solving a local boundary value problem of the scalar flux on the coarse-mesh structure to replace the piecewise constant scalar flux obtained by CMFD. The refined flux is then used to update the scalar flux in the neutron transport source iteration. It has been demonstrated that that LR-NDA is much more effective and stable than CMFD for a wide range of optical thicknesses. LR-NDA is a local adaptive method, which means LR-NDA does not necessarily require local refinement for all the coarse-mesh cells on the problem domain, i.e., it can be used only for relatively optically thick regions where the standard CMFD scheme would encounter the convergence problem.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Explicit block encodings of boundary value problems for many-body elliptic operators

Simulation of physical systems is one of the most promising use cases of future digital quantum computers. In this work we systematically analyze the quantum circuit complexities of block encoding the discretized elliptic operators that arise extensively in numerical simulations for partial differential equations, including high-dimensional instances for many-body simulations. When restricted to rectangular domains with separable boundary conditions, we provide explicit circuits to block encode the many-body Laplacian with separable periodic, Dirichlet, Neumann, and Robin boundary conditions, using standard discretization techniques from low-order finite difference methods. To obtain high-precision, we introduce a scheme based on periodic extensions to solve Dirichlet and Neumann boundary value problems using a high-order finite difference method, with only a constant increase in total circuit depth and subnormalization factor. We then present a scheme to implement block encodings of differential operators acting on more arbitrary domains, inspired by Cartesian immersed boundary methods. We then block encode the many-body convective operator, which describes interacting particles experiencing a force generated by a pair-wise potential given as an inverse power law of the interparticle distance. This work provides concrete recipes that are readily translated into quantum circuits, with depth logarithmic in the total Hilbert space dimension, that block encode operators arising broadly in applications involving the quantum simulation of quantum and classical many-body mechanics.

Kharazi, Tyler [University of California, Berkeley↗

Interface PINNs (I-PINNs): A physics-informed neural networks framework for interface problems

Here, we present a novel physics-informed neural networks (PINNs) framework for modeling interface problems, termed Interface PINNs (I-PINNs). I-PINNs uses different neural networks for any two subdomains separated by a sharp interface such that the neural networks differ only through their activation functions while the other parameters remain identical. The performance of I-PINNs, conventional PINNs, and other existing domain-decomposition PINNs methods such as extended PINNs (XPINNs) and multi-domain PINN (M-PINN) is compared through several one-dimensional, two-dimensional, and three-dimensional benchmark elliptic interface problems. The results demonstrate that I-PINNs provides a root-mean-square-error accuracy, at least two orders of magnitude better than conventional PINNs and XPINNs at approximately one-tenth of the computational cost of conventional PINNs and half the cost of XPINNs. Additionally, while I-PINNs and M-PINN provide comparable accuracies, M-PINN is found to be approximately 50% more expensive.

42 ENGINEERING↗

Adaptive Interface-PINNs (AdaI-PINNs): An Efficient Physics-Informed Neural Networks Framework for Interface Problems

Here, we present an efficient physics-informed neural networks (PINNs) framework, termed Adaptive Interface-PINNs (AdaI-PINNs), to improve the modeling of interface problems with discontinuous coefficients and/or interfacial jumps. This framework is an enhanced version of its predecessor, Interface PINNs or I-PINNs (Sarma et al.; https://doi.org/10.1016/j.cma.2024.117135), which involves domain decomposition and assignment of different predefined activation functions to the neural networks in each subdomain across a sharp interface, while keeping all other parameters of the neural networks identical. In AdaI-PINNs, the activation functions vary solely in their slopes, which are trained along with the other parameters of the neural networks. This makes the AdaI-PINNs framework fully automated without requiring preset activation functions. Comparative studies on one-dimensional, two-dimensional, and three-dimensional benchmark elliptic interface problems reveal that AdaI-PINNs outperform I-PINNs, reducing computational costs by 2-6 times while producing similar or better accuracy.

97 MATHEMATICS AND COMPUTING↗