skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: An accurate and preservative quenching data stream simulation method
Abstract: Quenching has been an extremely important natural phenomenon observed in many biomedical and multiphysical procedures, such as a rapid cancer cell progression or internal combustion process. The latter has been playing a crucial rule in optimizations of modern solid fuel rocket engine designs. Mathematically, quenching means the blow-up of temporal derivatives of the solution function u while the function itself remains to be bounded throughout the underlying procedure. This paper studies a semi-adaptive numerical method for simulating solutions of a singular partial differential equation that models a significant number of quenching data streams. Numerical convergence will be investigated as well as verifying that features of the solution is preserved in the approximation. Orders of the convergence will also be validated through experimental procedures. Milne's device will be used for data estimate and initial building-up of our deep neural network (DNN) software. Highly accurate data models will be presented to illustrate theoretical predictions.  more » « less
Award ID(s):
2318032
PAR ID:
10420080
Author(s) / Creator(s):
;
Date Published:
Journal Name:
Communications in computer and information science
ISSN:
1865-0929
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Han, Henry; Baker, Erich (Ed.)
    Quenching has been an extremely important natural phenomenon observed in many biomedical and multiphysical procedures, such as a rapid cancer cell progression or internal combustion process. The latter has been playing a crucial rule in optimizations of modern solid fuel rocket engine designs. Mathematically, quenching means the blowup of temporal derivatives of the solution function q while the function itself remains to be bounded throughout the underlying procedure. This paper studies a semi-adaptive numerical method for simulating solutions of a singular partial differential equation that models a significant number of quenching data streams. Numerical convergence will be investigated as well as verifying that features of the solution is preserved in the approximation. Orders of the convergence will also be validated through experimental procedures. Milne’s device will be used. Highly accurate data models will be presented to illustrate theoretical predictions. 
    more » « less
  2. A preservative scheme is presented and analyzed for the solution of a quenching type convective-diffusion problem modeled through one-sided Riemann-Liouville space-fractional derivatives. Properly weighted Grünwald formulas are employed for the discretization of the fractional derivative. A forward difference approximation is considered in the approximation of the convective term of the nonlinear equation. Temporal steps are optimized via an asymptotic arc-length monitoring mechanism till the quenching point. Under suitable constraints on spatial-temporal discretization steps, the monotonicity, positivity preservations of the numerical solution and numerical stability of the scheme are proved. Three numerical experiments are designed to demonstrate and simulate key characteristics of the semi-adaptive scheme constructed, including critical length, quenching time and quenching location of the fractional quenching phenomena formulated through the one-sided space-fractional convective-diffusion initial-boundary value problem. Effects of the convective function to quenching are discussed. Numerical estimates of the order of convergence are obtained. Computational results obtained are carefully compared with those acquired from conventional integer order quenching convection-diffusion problems for validating anticipated accuracy. The experiments have demonstrated expected accuracy and feasibility of the new method. 
    more » « less
  3. null (Ed.)
    In this paper we propose and analyze a finite difference numerical scheme for the Poisson-Nernst-Planck equation (PNP) system. To understand the energy structure of the PNP model, we make use of the Energetic Variational Approach (EnVarA), so that the PNP system could be reformulated as a non-constant mobility H − 1 H^{-1} gradient flow, with singular logarithmic energy potentials involved. To ensure the unique solvability and energy stability, the mobility function is explicitly treated, while both the logarithmic and the electric potential diffusion terms are treated implicitly, due to the convex nature of these two energy functional parts. The positivity-preserving property for both concentrations, n n and p p , is established at a theoretical level. This is based on the subtle fact that the singular nature of the logarithmic term around the value of 0 0 prevents the numerical solution reaching the singular value, so that the numerical scheme is always well-defined. In addition, an optimal rate convergence analysis is provided in this work, in which many highly non-standard estimates have to be involved, due to the nonlinear parabolic coefficients. The higher order asymptotic expansion (up to third order temporal accuracy and fourth order spatial accuracy), the rough error estimate (to establish the ℓ ∞ \ell ^\infty bound for n n and p p ), and the refined error estimate have to be carried out to accomplish such a convergence result. In our knowledge, this work will be the first to combine the following three theoretical properties for a numerical scheme for the PNP system: (i) unique solvability and positivity, (ii) energy stability, and (iii) optimal rate convergence. A few numerical results are also presented in this article, which demonstrates the robustness of the proposed numerical scheme. 
    more » « less
  4. Summary We present a spatially varying Robin interface condition for solving fluid‐structure interaction problems involving incompressible fluid flows and nonuniform flexible structures. Recent studies have shown that for uniform structures with constant material and geometric properties, a constant one‐parameter Robin interface condition can improve the stability and accuracy of partitioned numerical solution procedures. In this work, we generalize the parameter to a spatially varying function that depends on the structure's local material and geometric properties, without varying the exact solution of the coupled fluid‐structure system. We present an algorithm to implement the Robin interface condition in an embedded boundary method for coupling a projection‐based incompressible viscous flow solver with a nonlinear finite element structural solver. We demonstrate the numerical effects of the spatially varying Robin interface condition using two example problems: a simplified model problem featuring a nonuniform Euler‐Bernoulli beam interacting with an inviscid flow and a generalized Turek‐Hron problem featuring a nonuniform, highly flexible beam interacting with a viscous laminar flow. Both cases show that a spatially varying Robin interface condition can clearly improve numerical accuracy (by up to two orders of magnitude in one instance) for the same computational cost. Using the second example problem, we also demonstrate and compare two models for determining the local value of the combination function in the Robin interface condition. 
    more » « less
  5. Abstract In this paper, we study and prove the non-asymptotic superlinear convergence rate of the Broyden class of quasi-Newton algorithms which includes the Davidon–Fletcher–Powell (DFP) method and the Broyden–Fletcher–Goldfarb–Shanno (BFGS) method. The asymptotic superlinear convergence rate of these quasi-Newton methods has been extensively studied in the literature, but their explicit finite–time local convergence rate is not fully investigated. In this paper, we provide a finite–time (non-asymptotic) convergence analysis for Broyden quasi-Newton algorithms under the assumptions that the objective function is strongly convex, its gradient is Lipschitz continuous, and its Hessian is Lipschitz continuous at the optimal solution. We show that in a local neighborhood of the optimal solution, the iterates generated by both DFP and BFGS converge to the optimal solution at a superlinear rate of$$(1/k)^{k/2}$$ ( 1 / k ) k / 2 , wherekis the number of iterations. We also prove a similar local superlinear convergence result holds for the case that the objective function is self-concordant. Numerical experiments on several datasets confirm our explicit convergence rate bounds. Our theoretical guarantee is one of the first results that provide a non-asymptotic superlinear convergence rate for quasi-Newton methods. 
    more » « less