Search NASA⌕ Search

SEARCH · Search NASA

Results for “mathematical 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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2011

Optimal Regularity and Long-Time Behavior of Solutions for the Westervelt Equation

We investigate an initial-boundary value problem for the quasilinear Westervelt equation which models the propagation of sound in fluidic media. We prove that, if the initial data are sufficiently small and regular, then there exists a unique global solution with optimal L{sub p}-regularity. We show furthermore that the solution converges to zero at an exponential rate as time tends to infinity. Our techniques are based on maximal L{sub p}-regularity for abstract quasilinear parabolic equations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Numerical Solution of the Inverse Scattering Problem for the Acoustic Equation in an Absorptive Layered Medium

We consider a nonlinear ordinary differential equation associated with a number of inverse scattering problems in acoustic and seismic sounding in which acoustic impedance and an impedance-dependent unknown damping coefficient are the unknown function. We prove that the Cauchy problem is uniquely solvable when the derivative is treated as a generalized function. It is established that the inverse scattering problem in a layered dissipative medium simultaneously determines the acoustic impedance and the damping coefficient. A regularized numerical algorithm is proposed and numerical results are reported.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

The Kostrikin Radical and Similar Radicals of Lie Algebras

The existing notion of the Kostrikin radical as a radical in the Kurosh–Amitsur sense on classes of Mal’tsev algebras over rings with 1/6 is not completely justified. More precisely, to the fullest extent it is true for classes of Lie algebras over fields of characteristic zero and, as shown in the given paper, classes of algebraic Lie algebras of degree not greater than n over rings with 1/n! at all n ≥ 1. Similar conclusions are obtained in the paper also for the Jordan, regular, and extremal radicals constructed analogously to the Kostrikin radical.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Where did the tumor start? An inverse solver with sparse localization for tumor growth models

In this work, we present a numerical scheme for solving an inverse problem for parameter estimation in tumor growth models for glioblastomas, a form of aggressive primary brain tumor. The growth model is a reaction–diffusion partial differential equation (PDE) for the tumor concentration. We use a PDE-constrained optimization formulation for the inverse problem. The unknown parameters are the reaction coefficient (proliferation), the diffusion coefficient (infiltration), and the initial condition field for the tumor PDE. Segmentation of magnetic resonance imaging (MRI) scans drive the inverse problem where segmented tumor regions serve as partial observations of the tumor concentration. Like most cases in clinical practice, we use data from a single time snapshot. Moreover, the precise time relative to the initiation of the tumor is unknown, which poses an additional difficulty for inversion. We perform a frozen-coefficient spectral analysis and show that the inverse problem is severely ill-posed. We introduce a biophysically motivated regularization on the structure and magnitude of the tumor initial condition. In particular, we assume that the tumor starts at a few locations (enforced with a sparsity constraint on the initial condition of the tumor) and that the initial condition magnitude in the maximum norm is equal to one. We solve the resulting optimization problem using an inexact quasi-Newton method combined with a compressive sampling algorithm for the sparsity constraint. Our implementation uses PETSc and AccFFT libraries. We conduct numerical experiments on synthetic and clinical images to highlight the improved performance of our solver over a previously existing solver that uses standard two-norm regularization for the calibration parameters. The existing solver is unable to localize the initial condition. Our new solver can localize the initial condition and recover infiltration and proliferation. In clinical datasets (for which the ground truth is unknown), our solver results in qualitatively different solutions compared to the two-norm regularized solver.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Denoising Poisson phaseless measurements via orthogonal dictionary learning

Phaseless diffraction measurements recorded by CCD detectors are often affected by Poisson noise. In this paper, we propose a dictionary learning model by employing patches based sparsity in order to denoise such Poisson phaseless measurements. The model consists of three terms: (i) A representation term by an orthogonal dictionary, (ii) an L 0 pseudo norm of the coefficient matrix, and (iii) a Kullback-Leibler divergence term to fit phaseless Poisson data. Fast alternating minimization method (AMM) and proximal alternating linearized minimization (PALM) are adopted to solve the proposed model, and especially the theoretical guarantee of the convergence of PALM is provided. The subproblems for these two algorithms both have fast solvers, and indeed, the solutions for the sparse coding and dictionary updating both have closed forms due to the orthogonality of learned dictionaries. Numerical experiments for phase retrieval using coded diffraction and ptychographic patterns are conducted to show the efficiency and robustness of proposed methods, which, by preserving texture features, produce visually and quantitatively improved restored images compared with other phase retrieval algorithms without regularization and local sparsity promoting algorithms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Affine Approximation of Parametrized Kernels and Model Order Reduction for Nonlocal and Fractional Laplace Models

In this work, we consider parametrized problems driven by spatially nonlocal integral operators with parameter-dependent kernels. In particular, kernels with varying nonlocal interaction radius $\delta > 0$ and fractional Laplace kernels, parametrized by the fractional power $s\in(0,1)$, are studied. Furthermore, in order to provide an efficient and reliable approximation of the solution for different values of the parameters, we develop the reduced basis method as a parametric model order reduction approach. Major difficulties arise since the kernels are not affine in the parameters, singular, and discontinuous. Moreover, the spatial regularity of the solutions depends on the varying fractional power $s$. To address this, we derive regularity and differentiability results with respect to $\delta$ and $s$, which are of independent interest for other applications such as optimization and parameter identification. We then use these results to construct affine approximations of the kernels by local polynomials. Finally, we certify the method by providing reliable a posteriori error estimators, which account for all approximation errors, and support the theoretical findings by numerical experiments.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Proximal Galerkin: A Structure-Preserving Finite Element Method for Pointwise Bound Constraints

The proximal Galerkin finite element method is a high-order, low iteration complexity, nonlinear numerical method that preserves the geometric and algebraic structure of pointwise bound constraints in infinite-dimensional function spaces. This paper introduces the proximal Galerkin method and applies it to solve free boundary problems, enforce discrete maximum principles, and develop a scalable, mesh-independent algorithm for optimal design with pointwise bound constraints. This paper also introduces the latent variable proximal point (LVPP) algorithm, from which the proximal Galerkin method derives. When analyzing the classical obstacle problem, we discover that the underlying variational inequality can be replaced by a sequence of second-order partial differential equations (PDEs) that are readily discretized and solved with, e.g., the proximal Galerkin method. Throughout this work, we arrive at several contributions that may be of independent interest. These include (1) a semilinear PDE we refer to as the entropic Poisson equation; (2) an algebraic/geometric connection between high-order positivity-preserving discretizations and certain infinite-dimensional Lie groups; and (3) a gradient-based, bound-preserving algorithm for two-field, density-based topology optimization. The complete proximal Galerkin methodology combines ideas from nonlinear programming, functional analysis, tropical algebra, and differential geometry and can potentially lead to new synergies among these areas as well as within variational and numerical analysis. Open-source implementations of our methods accompany this work to facilitate reproduction and broader adoption.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

What Is the Fractional Laplacian? A Comparative Review with New Results

The fractional Laplacian in $\mathbb{R}^{d}$, which we write as (–Δ) α/2 with, α ϵ (0, 2) has multiple equivalent characterizations. Furthermore, in bounded domains, boundary conditions must be incorporated in these characterizations in mathematically distinct ways, and there is currently no consensus in the literature as to which definition of the fractional Laplacian in bounded domains is most appropriate for a given application. The Riesz (or integral) definition, for example, admits a nonlocal boundary condition, where the value of a function must be prescribed on the entire exterior of the domain in order to compute its fractional Laplacian. Yet, the spectral definition requires only the standard local boundary condition. These differences, among others, lead us to ask the question: “What is the fractional Laplacian?” Beginning from first principles, we compare several commonly used definitions of the fractional Laplacian theoretically, through their stochastic interpretations as well as their analytical properties. Next, we present quantitative comparisons using a sample of state-of-the-art methods. We discuss recent advances on nonzero boundary conditions and present new methods to discretize such boundary value problems: radial basis function collocation (for the Riesz fractional Laplacian) and nonharmonic lifting (for the spectral fractional Laplacian). In our numerical studies, we aim to compare different definitions on bounded domains using a collection of benchmark problems. We consider the fractional Poisson equation with both zero and nonzero boundary conditions, where the fractional Laplacian is defined according to the Riesz definition, the spectral definition, the directional definition, and the horizon-based nonlocal definition. We verify the accuracy of the numerical methods used in the approximations for each operator, and we focus on identifying differences in the boundary behaviors of solutions to equations posed with these different definitions. Through our efforts, we aim to further engage the research community in open problems and assist practitioners in identifying the most appropriate definition and computational approach to use for their mathematical models in addressing anomalous transport in diverse applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Peregrine Software Development: Report on the Code Conversion From Python to C++

This work package seeks to convert the Peregrine software tool from its original Python implementation to a production version based on the C++ language. Peregrine is a powerful research platform with a multitude of advanced data analytics and data visualization functionalities. Developed by scientists to explore multimodal and multidimensional data related to the production of components using powder bed additive manufacturing processes, the tool implements state-of-the-art algorithms to assist machine users in making build or part quality determinations. Given that Peregrine is data-intensive, the goal of this conversion is to enhance the tool’s flexibility and interactivity and reduce the number of code dependencies to facilitate its deployment as part of the ongoing technology transfer campaign. This brief document provides an overview of Peregrine’s functionalities and capabilities, along with a detailed description of the core functionalities that have been implemented to date in the new C++ version. This document serves as a development update at the end of the first year of the ongoing conversion and will be regularly updated as progress continues.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Some implications of signature-change in cosmological models of loop quantum gravity

Signature change at high density has been obtained as a possible consequence of deformed space-time structures in models of loop quantum gravity. This article provides a conceptual discussion of implications for cosmological scenarios, based on an application of mathematical results for mixed-type partial differential equations (the Tricomi problem). While the effective equations from which signature change has been derived are shown to be locally regular and therefore reliable, the underlying theory of loop quantum gravity may face several global problems in its semiclassical solutions.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

Slow manifolds of classical Pauli particle enable structure-preserving geometric algorithms for guiding center dynamics

Since variational symplectic integrators for the guiding center was proposed, structure-preserving geometric algorithms have become an active research field in plasma physics. We found that the slow manifolds of the classical Pauli particle enable a family of structure-preserving geometric algorithms for guiding center dynamics with long-term stability and accuracy. This discovery overcomes the difficulty associated with the unstable parasitic modes for variational symplectic integrators when applied to the degenerate guiding center Lagrangian. It is a pleasant surprise that Pauli's Hamiltonian for electrons, which predated the Dirac equation and marks the beginning of particle physics, reappears in classical physics as an effective algorithm for solving an important plasma physics problem. This technique is applicable to other degenerate Lagrangians reduced from regular Lagrangians.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2014

The leading term of the Plancherel-Rotach asymptotic formula for solutions of recurrence relations

Recurrence relations generating Padé and Hermite-Padé polynomials are considered. Their coefficients increase with the index of the relation, but after dividing by an appropriate power of the scaling function they tend to a finite limit. As a result, after scaling the polynomials 'stabilize' for large indices; this type of asymptotic behaviour is called Plancherel-Rotach asymptotics. An explicit expression for the leading term of the asymptotic formula, which is valid outside sets containing the zeros of the polynomials, is obtained for wide classes of three- and four-term relations. For three-term recurrence relations this result generalizes a theorem Van Assche obtained for recurrence relations with 'regularly' growing coefficients. Bibliography: 19 titles.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

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↗
DOE OSTI2022

Inference for Nonparanormal Partial Correlation via Regularized Rank-Based Nodewise Regression

Abstract Partial correlation is a common tool in studying conditional dependence for Gaussian distributed data. However, partial correlation being zero may not be equivalent to conditional independence under non-Gaussian distributions. In this paper, we propose a statistical inference procedure for partial correlations under the high-dimensional nonparanormal (NPN) model where the observed data are normally distributed after certain monotone transformations. The NPN partial correlation is the partial correlation of the normal transformed data under the NPN model, which is a more general measure of conditional dependence. We estimate the NPN partial correlations by regularized nodewise regression based on the empirical ranks of the original data. A multiple testing procedure is proposed to identify the nonzero NPN partial correlations. The proposed method can be carried out by a simple coordinate descent algorithm for lasso optimization. It is easy-to-implement and computationally more efficient compared to the existing methods for estimating NPN graphical models. Theoretical results are developed to show the asymptotic normality of the proposed estimator and to justify the proposed multiple testing procedure. Numerical simulations and a case study on brain imaging data demonstrate the utility of the proposed procedure and evaluate its performance compared to the existing methods. Data used in preparation of this article were obtained from the Alzheimer's Disease Neuroimaging Initiative (ADNI) database.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Virtual element approximations of the time-fractional nonlinear convection-diffusion equation on polygonal meshes

We extend the Virtual Element Method to a two-dimensional unsteady nonlinear convection-diffusion equation characterized by a fractional-order derivative with respect to the time variable. Our methodology is based on three fundamental technical components: a fractional version of the Grunwald-Letnikov approximation, discrete maximal regularity, and the regularity theory associated with non-linearity. We prove the method's well-posedness, i.e., the approximate solution's existence and uniqueness to the time-fractional convection-diffusion equation with a Lipschitz nonlinear source term. The fully discrete scheme inherently maintains stability and consistency by leveraging the discrete maximal regularity and the energy projection operator. The convergence in the L 2 -norm and H 1 -norm to various mesh configurations is validated by numerical results, underlining the practical effectiveness of the proposed method.

97 MATHEMATICS AND COMPUTING↗