Search NASA⌕ Search

SEARCH · Search NASA

Results for “Regularization”

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 415 records · Page 23

Spectral Analysis of Regular Material Point Method and its Application to Study High Pressure Reverse Osmosis Membrane Compaction and Embossing

Material Point Method (MPM) is gaining widespread interest in applied continuum mechanics. The fact that all the continuum properties are stored on the particles (or material points) and the governing equations are solved on these material points makes MPM extremely suited to problems involving severe material deformations, such as crack propagation, soil movement, and fluid flows. Despite its popularity, only a few studies have focused on the numerical properties of MPM. This presentation introduces a global spectral analysis of the regular material point method. Contrary to previous studies, the analysis focuses on the numerical properties of the method in the spectral space. The amplification factor is derived as a function of the non- dimensional wave numbers. It provides insights into the stability and dissipative properties of the method for various CFL and Fourier numbers. The effect of the grid shape functions, number of particles per cell and their locations inside the grid cell are also analyzed. The EXAGOOP MPM solver (https://github.com/NREL/Exagoop.git) is developed at the National Renewable Energy Laboratory as a part of the NAWI UHPRO project and is based on the AMReX framework. A single-level, uniform cartesian grid is used as the background mesh, while the particle class in AMReX is used to manage the material point operations. Linear hat and B-splines are used as grid shape functions, while the time integration is performed using explicit Euler time integration. EXAGOOP is both CPU and GPU compatible and has been demonstrated to work well on multiple compute architectures. The performance of EXAGOOP on various computing architectures is presented along with its application to study compaction and embossing of high-pressure reverse osmosis membranes. The MPM solution accurately reproduces the membrane deformation. The deformed pore size and structure simulated using MPM also agree well with experimental SEM images.

material point method↗

Multichannel image regularization using anisotropic geodesic filtering

This paper extends a recent image-dependent regularization approach introduced in aiming at edge-preserving smoothing. For that purpose, geodesic distances equipped with a Riemannian metric need to be estimated in local neighbourhoods. By deriving an appropriate metric from the gradient structure tensor, the associated geodesic paths are constrained to follow salient features in images. Following, we design a generalized anisotropic geodesic filter; incorporating not only a measure of the edge strength, like in the original method, but also further directional information about the image structures. The proposed filter is particularly efficient at smoothing heterogeneous areas while preserving relevant structures in multichannel images.

97 MATHEMATICS AND COMPUTING↗

A regularization approach to hydrofacies delineation

We consider an inverse problem of identifying complex internal structures of composite (geological) materials from sparse measurements of system parameters and system states. Two conceptual frameworks for identifying internal boundaries between constitutive materials in a composite are considered. A sequential approach relies on support vector machines, nearest neighbor classifiers, or geostatistics to reconstruct boundaries from measurements of system parameters and then uses system states data to refine the reconstruction. A joint approach inverts the two data sets simultaneously by employing a regularization approach.

58 GEOSCIENCES↗

An iterative reconstruction algorithm for pole figure inversion using total variation regularization

This paper describes a new discrete method for inverting X-ray pole figures to estimate the orientation distribution function (ODF). The method employs the equal-volume `cubochoric' representation for uniform discretization of orientation space, SO(3). The forward-projection model is combined with an anisotropic total variation term to iteratively determine the ODF. Here, the efficacy of the new method is evaluated with both model and experimental data and compared with existing discrete and series expansion methods.

97 MATHEMATICS AND COMPUTING↗

Domain Decomposition for Integer Optimal Control with Total Variation Regularization

Total variation integer optimal control problems admit solutions and necessary optimality conditions via geometric variational analysis. In spite of the existence of said solutions, algorithms which solve the discretized objective suffer from high numerical cost associated with the combinatorial nature of integer programming. Hence, such methods are often limited to small and medium-sized problems. We propose a globally convergent, coordinate descent–inspired algorithm that allows tractable subproblem solutions restricted to a partition of the domain. Our decomposition method solves relatively small trust-region subproblems that modify the control variable on a subdomain only. Given nontrivial subdomain overlap, we prove that a global first-order necessary optimality condition is equivalent to a first-order necessary optimality condition per subdomain. We additionally show that a sufficient decrease is achieved on a single subdomain by way of a trust-region subproblem solver using geometric measure–theoretic arguments, which we integrate with a greedy patch selection to prove convergence of our algorithm. In conclusion, we demonstrate the practicality of our algorithm on a benchmark large-scale, PDE-constrained integer optimal control problem and find that our method is faster than the state of the art.

domain decomposition↗

Regularity and Variationality of Solutions to Hamilton-Jacobi Equations. Part II: Variationality, Existence, Uniqueness

We formulate an Hamilton-Jacobi partial differential equation H(x, Du(x))=0 on a n dimensional manifold M, with assumptions of convexity of the sets {l_brace}p:H(x,p){<=}0) is a subset of T{sub x}*M, for all x.We reduce the above problem to a simpler problem; this shows that u may be built using an asymmetric distance (this is a generalization of the 'distance function' in Finsler geometry); this brings forth a 'completeness' condition, and a Hopf-Rinow theorem adapted to Hamilton-Jacobi problems. The 'completeness' condition implies that u is the unique viscosity solution to the above problem.

97 MATHEMATICS AND COMPUTING↗

A Probabilistic Approach to Interior Regularity of Fully Nonlinear Degenerate Elliptic Equations in Smooth Domains

We consider the value function of a stochastic optimal control of degenerate diffusion processes in a domain D. We study the smoothness of the value function, under the assumption of the non-degeneracy of the diffusion term along the normal to the boundary and an interior condition weaker than the non-degeneracy of the diffusion term. When the diffusion term, drift term, discount factor, running payoff and terminal payoff are all in the class of C{sup 1,1}( D-bar ) , the value function turns out to be the unique solution in the class of C{sub loc}{sup 1,1}(D) Intersection C{sup 0,1}( D-bar ) to the associated degenerate Bellman equation with Dirichlet boundary data. Our approach is probabilistic.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Global Existence and Uniqueness of Weak and Regular Solutions of Shallow Shells with Thermal Effects

We study a dynamical thin shallow shell whose elastic deformations are described by a nonlinear system of Marguerre–Vlasov’s type under the presence of thermal effects. Our main result is the proof of a global existence and uniqueness of a weak solution in the case of clamped boundary conditions. Standard techniques for uniqueness do not work directly in this case. We overcame this difficulty using recent work due to Lasiecka (Appl Anal 4:1376–1422, 1998).

97 MATHEMATICS AND COMPUTING↗

Regularity of the Speed of Biased Random Walk in a One-Dimensional Percolation Model

We consider biased random walks on the infinite cluster of a conditional bond percolation model on the infinite ladder graph. Axelson-Fisk and Häggström established for this model a phase transition for the asymptotic linear speed v̄ of the walk. Namely, there exists some critical value λ{sub c}>0 such that v̄>0 if λ∈(0,λ{sub c}) and v̄=0 if λ≥λ{sub c}. We show that the speed v̄ is continuous in λ on (0,∞) and differentiable on (0,λ{sub c}/2). Moreover, we characterize the derivative as a covariance. For the proof of the differentiability of v̄ on (0,λ{sub c}/2), we require and prove a central limit theorem for the biased random walk. Additionally, we prove that the central limit theorem fails to hold for λ≥λ{sub c}/2.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A{sub 1}-Regularity and Boundedness of Riesz Transforms in Banach Lattices of Measurable Functions

Let X be a Banach lattice of measurable functions on ℝ{sup n} × Ω having the Fatou property. We show that the boundedness of all Riesz transforms R{sub j} in X is equivalent to the boundedness of the Hardy–Littlewood maximal operator M in both X and X′, and thus to the boundedness of all Calderón–Zygmund operators in X. We also prove a result for the case of operators between lattices: If Y ⊃ X is a Banach lattice with the Fatou property such that the maximal operator is bounded in Y ′, then the boundedness of all Riesz transforms from X to Y is equivalent to the boundedness of the maximal operator from X to Y , and thus to the boundedness of all Calderón–Zygmund operators from X to Y .

97 MATHEMATICS AND COMPUTING↗

Regularity of Maximum Distance Minimizers

We study properties of sets having the minimum length (one-dimensional Hausdorff measure) in the class of closed connected sets Σ ⊂ ℝ{sup 2} satisfying the inequality max{sub yϵM} dist (y, Σ) ≤ r for a given compact set M ⊂ ℝ{sup 2} and given r > 0. Such sets play the role of the shortest possible pipelines arriving at a distance at most r to every point of M where M is the set of customers of the pipeline.In this paper, it is announced that every maximum distance minimizer is a union of finitely many curves having one-sided tangent lines at every point. This shows that a maximum distance minimizer is isotopic to a finite Steiner tree even for a “bad” compact set M, which distinguishes it from a solution of the Steiner problem (an example of a Steiner tree with infinitely many branching points can be found in a paper by Paolini, Stepanov, and Teplitskaya). Moreover, the angle between these lines at each point of a maximum distance minimizer is at least 2π/3. Also, we classify the behavior of a minimizer Σ in a neighborhood of any point of Σ. In fact, all the results are proved for a more general class of local minimizers.

97 MATHEMATICS AND COMPUTING↗