Search NASA⌕ Search

SEARCH · Search NASA

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 55 records · Page 3

Higher order multipoint flux mixed finite element methods on quadrilaterals and hexahedra

We develop higher order multipoint flux mixed finite element (MFMFE) methods for solving elliptic problems on quadrilateral and hexahedral grids that reduce to cell-based pressure systems. The methods are based on a new family of mixed finite elements, which are enhanced Raviart–Thomas spaces with bubbles that are curls of specially chosen polynomials. The velocity degrees of freedom of the new spaces can be associated with the points of tensor-product Gauss–Lobatto quadrature rules, which allows for local velocity elimination and leads to a symmetric and positive definite cell-based system for the pressures. We prove optimal [Formula: see text]th order convergence for the velocity and pressure in their natural norms, as well as [Formula: see text]st order superconvergence for the pressure at the Gauss points. Moreover, local postprocessing gives a pressure that is superconvergent of order [Formula: see text] in the full [Formula: see text]-norm. Numerical results illustrating the validity of our theoretical results are included.

Mathematics↗

Smoothness of Generalized Solutions of the Dirichlet Problem for Strongly Elliptic Functional Differential Equations with Orthotropic Contractions

In the disk, we consider the first boundary-value problem for a functional differential equation containing transformations of orthotropic contractions of independent variables of the unknown function. We study the smoothness of generalized solutions inside special-type subdomains and near their boundaries and pose strong ellipticity conditions.

97 MATHEMATICS AND COMPUTING↗

Model Elliptic Boundary-Value Problems for Pseudodifferential Operators in Canonical Nonsmooth Domains

We consider a simplest elliptic pseudodifferential equation in a multi-dimensional cone (multi-dimensional angle) and describe all possible structures of its solutions related to the wave factorization of the elliptic symbol. Depending on the index of wave factorization, we consider various statements of well-posed boundary-value problems. The existence of solutions is studied in Sobolev–Slobodetskii spaces.

97 MATHEMATICS AND COMPUTING↗

On Some Degenerate Elliptic Equations Arising in Geometric Problems

We consider some fully nonlinear degenerate elliptic operators and we investigate the validity of certain properties related to the maximum principle. In particular, we establish the equivalence between the sign propagation property and the strict positivity of a suitably defined generalized principal eigenvalue. Furthermore, we show that even in the degenerate case considered in the present paper, the well-known condition introduced by Keller–Osserman on the zero-order term is necessary and sufficient for the existence of entire weak subsolutions.

97 MATHEMATICS AND COMPUTING↗

Classical Solvability of the Radial Viscous Fingering Problem in a Hele–Shaw Cell with Surface Tension

We consider the one-phase problem on radial viscous fingering structures in a Hele–Shaw cell with surface tension. This problem is a nonlinear free-boundary problem for elliptic equations. Unlike the Stefan problem for the heat equation, we deal with a problem of hydrodynamic type. We establish the classical solvability of the one-phase Hele–Shaw problem with radial geometry by using the same method as that used for the Stefan problem and justifying the vanishing coefficient of the time-derivative in the parabolic equation.

97 MATHEMATICS AND COMPUTING↗

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↗

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↗

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↗

Spectrum and Stabilization in Hyperbolic Problems

We study the connection between the stabilization of solutions of a mixed hyperbolic problem and spectral properties of the corresponding elliptic boundary value problem. We consider the first mixed problem for the wave equation in bounded and unbounded domains in ℝ{sup n}, determine the class of its energy solutions, and represent the solutions in terms of the Bochner–Stieltjes integral. We study how the spectrum of the elliptic operator affects the behavior of local energy of a solution and describe a method which allows us to study the stabilization of solutions with the help of estimates in the spectral parameter for solutions of the stationary problem on the upper half-plane.

97 MATHEMATICS AND COMPUTING↗

Optimization problems governed by systems of PDEs with uncertainties

This paper reviews current theoretical and numerical approaches to optimization problems governed by partial differential equations (PDEs) that depend on random variables or random fields. Such problems arise in many engineering, science, economics and societal decision-making tasks. This paper focuses on problems in which the governing PDEs are parametrized by the random variables/fields, and the decisions are made at the beginning and are not revised once uncertainty is revealed. Examples of such problems are presented to motivate the topic of this paper, and to illustrate the impact of different ways to model uncertainty in the formulations of the optimization problem and their impact on the solution. A linear–quadratic elliptic optimal control problem is used to provide a detailed discussion of the set-up for the risk-neutral optimization problem formulation, study the existence and characterization of its solution, and survey numerical methods for computing it. Different ways to model uncertainty in the PDE-constrained optimization problem are surveyed in an abstract setting, including risk measures, distributionally robust optimization formulations, probabilistic functions and chance constraints, and stochastic orders. Furthermore, approximation-based optimization approaches and stochastic methods for the solution of the large-scale PDE-constrained optimization problems under uncertainty are described. Some possible future research directions are outlined.

Heinkenschloss, Matthias [Rice Univ., Houston, TX ↗