Search NASA⌕ Search

SEARCH · Search NASA

Results for “discontinuous coefficients”

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 19 records

On a regularization of a scalar conservation law with discontinuous coefficients

This paper is devoted to a scalar conservation law with a linear flux function involving discontinuous coefficients. It is clear that the delta standing wave should be introduced into the Riemann solution in some nonclassical situation. In order to study the formation of delta standing wave, we consider a regularization of the discontinuous coefficient with the Helmholtz mollifier and then obtain a regularized system which depends on a regularization parameter ε > 0. The regularization mechanism is a nonlinear bending of characteristic curves that prevents their finite-time intersection. It is proved rigorously that the solutions of regularized system converge to the delta standing wave solution in the ε → 0 limit. Compared with the classical method of vanishing viscosity, here it is clear to see how the delta standing wave forms naturally along the characteristics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Estimation of discontinuous coefficients and boundary parameters for hyperbolic systems

The problem of estimating discontinuous coefficients, including locations of discontinuities, that occur in second order hyperbolic systems typical of those arising in I-D surface seismic problems is discussed. In addition, the problem of identifying unknown parameters that appear in boundary conditions for the system is treated. A spline-based approximation theory is presented, together with related convergence findings and representative numerical examples.

Lamm, P. K.↗

Estimation of discontinuous coefficients and boundary parameters for hyperbolic systems

The problem of estimating discontinuous coefficients, including locations of discontinuities, that occur in second-order hyperbolic systems typical of those arising in one-dimensional surface seismic problems, is considered. The problem of identifying unknown parameters that appear in boundary conditions for the system is addressed. A spline-based approximation theory is presented as well as related convergence findings and representative numerical examples.

Lamm, Patricia K.↗

Isoparametric finite element methods to estimate discontinuous coefficients in two-dimensional elliptic equations

A summary of findings is presented on the problem of estimating discontinuous coefficients, including the locations of interfaces at which discontinuities occur, for elliptic equations on a two-dimensional domain. Finite-element approximations are constructed that are based on an underlying grid that adaptively moves to follow locations of interfaces as they are iteratively updated in the numerical estimation process.

Lamm, Patricia K.↗

A Cartesian grid embedded boundary method for solving the Poisson and heat equations with discontinuous coefficients in three dimensions

We present a method for solving Poisson and heat equations with discontinuous coefficients in two- and three-dimensions. It uses a Cartesian cut-cell/embedded boundary method to represent the interface between materials, as described in Johansen and Colella (1998). Matching conditions across the interface are enforced using an approximation to fluxes at the boundary. Overall second order accuracy is achieved, as indicated by an array of tests using non-trivial interface geometries. Both the elliptic and heat solvers are shown to remain stable and efficient for material coefficient contrasts up to 10{sup 6}, thanks in part to the use of geometric multigrid. A test of accuracy when adaptive mesh refinement capabilities are utilized is also performed. An example problem relevant to nuclear reactor core simulation is presented, demonstrating the ability of the method to solve problems with realistic physical parameters.

97 MATHEMATICS AND COMPUTING↗

Estimation of discontinuous coefficients in parabolic systems: Applications to reservoir simulation

Spline based techniques for estimating spatially varying parameters that appear in parabolic distributed systems (typical of those found in reservoir simulation problems) are presented. The problem of determining discontinuous coefficients, estimating both the functional shape and points of discontinuity for such parameters is discussed. Convergence results and a summary of numerical performance of the resulting algorithms are given.

Lamm, P. D.↗

Estimation of discontinuous coefficients in parabolic systems - Applications to reservoir simulation

Spline-based techniques for estimating spatially varying parameters that appear in parabolic distributed systems (typical of those found in reservoir simulation problems) are presented. In particular, the problem of determining discontinuous coefficients is discussed, estimating both the functional shape and points of discontinuity for such parameters. In addition, the ideas may also be applied to problems with unknown initial conditions and unknown parameters appearing in terms representing external forces. Convergence results and a summary of numerical performance of the resulting algorithms are given.

Lamm, Patricia K.↗

First-Order System Least-Squares for Second-Order Elliptic Problems with Discontinuous Coefficients

The first-order system least-squares methodology represents an alternative to standard mixed finite element methods. Among its advantages is the fact that the finite element spaces approximating the pressure and flux variables are not restricted by the inf-sup condition and that the least-squares functional itself serves as an appropriate error measure. This paper studies the first-order system least-squares approach for scalar second-order elliptic boundary value problems with discontinuous coefficients. Ellipticity of an appropriately scaled least-squares bilinear form of the size of the jumps in the coefficients leading to adequate finite element approximation results. The occurrence of singularities at interface corners and cross-points is discussed. and a weighted least-squares functional is introduced to handle such cases. Numerical experiments are presented for two test problems to illustrate the performance of this approach.

Manteuffel, Thomas A.↗

Multilevel Preconditioners for Reaction-Diffusion Problems with Discontinuous Coefficients

In this study, we extend some of the multilevel convergence results obtained by Xu and Zhu, to the case of second order linear reaction-diffusion equations. Specifically, we consider the multilevel preconditioners for solving the linear systems arising from the linear finite element approximation of the problem, where both diffusion and reaction coefficients are piecewise-constant functions. We discuss in detail the influence of both the discontinuous reaction and diffusion coefficients to the performance of the classical BPX and multigrid V-cycle preconditioner.

97 MATHEMATICS AND COMPUTING↗

Continuous solutions to a class of first-order fuzzy differential equations with discontinuous coefficients

In this paper, we study the continuity of solution functions to a class of fuzzy differential equations (FDEs) in the form y{sup ′}(t)=((φ(t))/((t−α){sup p}))⊙y(t)+ψ(t), where the coefficient function ((φ(t))/((t−α){sup p})) is a discontinuous function at the point t=α and α is an inner point of the interval under study. At first, the continuity of solutions for the crisp case of the problem is investigated and those results are extended to the fuzzy case of the problem from the view point of strongly generalized differentiability (G-differentiability). Next, we obtain explicit formulas of solutions and the conditions of their existence for a special class of these problems. Finally, the results are illustrated by solving some examples.

97 MATHEMATICS AND COMPUTING↗

Two-level Schwartz methods for nonconforming finite elements and discontinuous coefficients

Two-level domain decomposition methods are developed for a simple nonconforming approximation of second order elliptic problems. A bound is established for the condition number of these iterative methods, which grows only logarithmically with the number of degrees of freedom in each subregion. This bound holds for two and three dimensions and is independent of jumps in the value of the coefficients.

Sarkis, Marcus↗

A mass-transfer particle-tracking method for simulating transport with discontinuous diffusion coefficients

The problem of a spatially discontinuous diffusion coefficient (D(x)) is one that may be encountered in hydrogeologic systems due to natural geological features or as a consequence of numerical discretization of flow properties. To date, mass-transfer particle-tracking (MTPT) methods, a family of Lagrangian methods in which diffusion is jointly simulated by random walk and diffusive mass transfers, have been unable to solve this problem. This manuscript presents a new mass-transfer (MT) algorithm that enables MTPT methods to accurately solve the problem of discontinuous D(x). To achieve this, we derive a semi-analytical solution to the discontinuous D(x) problem by employing a predictor-corrector approach, and we use this semi-analytical solution as the weighting function in a reformulated MT algorithm. Furthermore, this semi-analytical solution is generalized for cases with multiple 1D interfaces as well as for 2D cases, including a 2 × 2 tiling of 4 subdomains that corresponds to a numerically-generated diffusion field. The solutions generated by this new mass-transfer algorithm closely agree with an analytical 1D solution or, in more complicated cases, trusted numerical results, demonstrating the success of our proposed approach.

42 ENGINEERING↗

Robust parallel iterative solvers for linear and least-squares problems (Final Technical Report)

The primary goal of this project is to study and develop robust iterative methods for solving linear systems of equations and least squares systems. The focus of the Minnesota team is on algorithms development, robustness issues, and on tests and validation of the methods on realistic problems. 1. The project begun with an investigation on how to practically update a preconditioner obtained from an ILU-type factorization, when the coefficient matrix changes. 2. We investigated strategies to improve robustness in parallel preconditioners in a specific case of a PDE with discontinuous coefficients. 3. We explored ways to adapt standard preconditioners for solving linear systems arising from the Helmholtz equation. These are often difficult linear systems to solve by iterative methods. 4. We have also worked on purely theoretical issues related to the analysis of Krylov subspace methods for linear systems. 5. We developed an effective strategy for performing ILU factorizations for the case when the matrix is highly indefinite. The strategy uses shifting in some optimal way. The method was extended to the solution of Helmholtz equations by using complex shifts, yielding very good results in many cases. 6. We addressed the difficult problem of preconditioning sparse systems of equations on GPUs. 7. A by-product of the above work is a software package consisting of an iterative solver library for GPUs based on CUDA. This was made publicly available. It was the first such library that offers complete iterative solvers for GPUs. 8. We considered another form of ILU which blends coarsening techniques from Multigrid with algebraic multilevel methods. 9. We have released a new version on our parallel solver - called pARMS [new version is version 3]. As part of this we have tested the code in complex settings - including the solution of Maxwell and Helmholtz equations and for a problem of crystal growth.10. As an application of polynomial preconditioning we considered the problem of evaluating f(A)v which arises in statistical sampling. 11. As an application to the methods we developed, we tackled the problem of computing the diagonal of the inverse of a matrix. This arises in statistical applications as well as in many applications in physics. We explored probing methods as well as domain-decomposition type methods. 12. A collaboration with researchers from Toulouse, France, considered the important problem of computing the Schur complement in a domain-decomposition approach. 13. We explored new ways of preconditioning linear systems, based on low-rank approximations.

97 MATHEMATICS AND COMPUTING↗

Local error estimates for discontinuous solutions of nonlinear hyperbolic equations

Let u(x,t) be the possibly discontinuous entropy solution of a nonlinear scalar conservation law with smooth initial data. Suppose u sub epsilon(x,t) is the solution of an approximate viscosity regularization, where epsilon greater than 0 is the small viscosity amplitude. It is shown that by post-processing the small viscosity approximation u sub epsilon, pointwise values of u and its derivatives can be recovered with an error as close to epsilon as desired. The analysis relies on the adjoint problem of the forward error equation, which in this case amounts to a backward linear transport with discontinuous coefficients. The novelty of this approach is to use a (generalized) E-condition of the forward problem in order to deduce a W(exp 1,infinity) energy estimate for the discontinuous backward transport equation; this, in turn, leads one to an epsilon-uniform estimate on moments of the error u(sub epsilon) - u. This approach does not follow the characteristics and, therefore, applies mutatis mutandis to other approximate solutions such as E-difference schemes.

Tadmor, Eitan↗

Localized harmonic characteristic basis functions for multiscale finite element methods

We solve elliptic systems of equations posed on highly heterogeneous materials. Examples of this class of problems are composite structures and geological processes. We focus on a model problem which is a second-order elliptic equation with discontinuous coefficients. These coefficients represent the conductivity of a composite material. We assume a background with a low conductivity that contains inclusions with different thermal properties. Under this scenario, we design a multiscale finite element method to efficiently approximate solutions. The method is based on an asymptotic expansion of the solution in terms of the ratio between the conductivities. The resulting method constructs (locally) finite element basis functions (one for each inclusion). These bases generate the multiscale finite element space where the approximation of the solution is computed. Numerical experiments show the good performance of the proposed methodology.

97 MATHEMATICS AND COMPUTING↗

A new weak Galerkin finite element method for elliptic interface problems

We introduce and analyze a new weak Galerkin (WG) finite element method in this paper for solving second order elliptic equations with discontinuous coefficients and interfaces. Comparing with the existing WG algorithm for solving the same type problems, the present WG method has a simpler variational formulation and fewer unknowns. Moreover, the new WG algorithm allows the use of finite element partitions consisting of general polytopal meshes and can be easily generalized to high orders. Optimal order error estimates in both H1 and L2 norms are established for the present WG finite element solutions. We conducted extensive numerical experiments in order to examine the accuracy, flexibility, and robustness of the proposed WG interface approach. In solving regular elliptic interface problems, high order convergences are numerically confirmed by using piecewise polynomial basis functions of high degrees. Moreover, the WG method is shown to be able to accommodate very complicated interfaces, due to its flexibility in choosing finite element partitions. Finally, in dealing with challenging problems with low regularities, the piecewise linear WG method is capable of delivering a second order of accuracy in L∞ norm for both C1 and H2 continuous solutions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A high-order staggered meshless method for elliptic problems

Here, we present a new meshless method for scalar diffusion equations, which is motivated by their compatible discretizations on primal-dual grids. Unlike the latter though, our approach is truly meshless because it only requires the graph of nearby neighbor connectivity of the discretization points. This graph defines a local primal-dual grid complex with a virtual dual grid, in the sense that specification of the dual metric attributes is implicit in the method's construction. Our method combines a topological gradient operator on the local primal grid with a generalized moving least squares approximation of the divergence on the local dual grid. We show that the resulting approximation of the div-grad operator maintains polynomial reproduction to arbitrary orders and yields a meshless method, which attains $O(h^{m})$ convergence in both $L^2$- and $H^1$-norms, similar to mixed finite element methods. We demonstrate this convergence on curvilinear domains using manufactured solutions in two and three dimensions. Application of the new method to problems with discontinuous coefficients reveals solutions that are qualitatively similar to those of compatible mesh-based discretizations.

97 MATHEMATICS AND COMPUTING↗

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↗