Search NASA⌕ Search

SEARCH · Search NASA

Results for “ODE”

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 145 records · Page 8

AutoChem

AutoChem is a suite of Fortran 90 computer programs for the modeling of kinetic reaction systems. AutoChem performs automatic code generation, symbolic differentiation, analysis, and documentation. It produces a documented stand-alone system for the modeling and assimilation of atmospheric chemistry. Given databases of chemical reactions and a list of constituents defined by the user, AutoChem automatically does the following: 1. Selects the subset of reactions that involve a user-defined list of constituents and automatically prepares a document listing the reactions; 2. Constructs the ordinary differential equations (ODEs) that describe the reactions as functions of time and prepares a document containing the ODEs; 3. Symbolically differentiates the time derivatives to obtain the Jacobian and prepares a document containing the Jacobian; 4. Symbolically differentiates the Jacobian to obtain the Hessian and prepares a document containing the Hessian; and 5. Writes all the required Fortran 90 code and datafiles for a stand-alone chemical modeling and assimilation system (implementation of steps 1 through 5). Typically, the time taken for steps 1 through 5 is about 3 seconds. The modeling system includes diagnostic components that automatically analyze each ODE at run time, the relative importance of each term, time scales, and other attributes of the model.

Lary, David John↗

Machine Learning based Aircraft Performance Model Estimation for Trajectory Prediction

The accurate prediction of aircraft trajectory by ground-based decision support tools is a critical component of air traffic management in the US National Airspace System (NAS). Accurate predictions of where the aircraft will be in the future or when they will arrive at specific locations (e.g., fixes) is a key enabler for sequencing and efficient arrival management of flights. Traditional physics based aircraft trajectory prediction relies on a simplified point-mass total energy model whose parameters are referred to as Aircraft Performance Model (APM) parameters. Even though the performance coefficients and weight of an aircraft are a vital part of the aircraft performance model’s predictions and accuracy, these coefficients are proprietary in nature and therefore, unavailable to decision-support tools. Current approaches freeze some coefficients to default base of aircraft data (BADA) values and optimize others. However, the APM parameters are highly coupled by the flight dynamics and prioritizing one parameter over others leads to bias and skewed predictions. To alleviate this problem, we provide a combined optimization framework to predict all the critical (thrust, drag and weight) APM parameters. This paper is focused on training Machine Learning (ML) models that map historical flights to optimized APM parameters that provide the best fit (in terms of prediction error). Our dataset obtained from NASA’s Sherlock data warehouse is comprised of thousands of historical flights and includes weather and track data collected from 2019. Using different subsets of relevant features (e.g., aircraft type), we trained several ML models to estimate the aircraft’s take off weight, drag polar coefficients (both parasitic and lift induced), and thrust settings (multiplier applied to the maximum engine thrust). The chosen flights are from three of the most common aircraft types (B738, B737, and A320) arriving at four airports (LAX, DEN, MSP, and DFW). Our ML approach is comprised of two different solutions: 1- using a subset of features that are known prior to the flight departure and do not change during flight (such as engine type, current temperature at departure & destination airports, aircraft type) and 2 - using a subset of temporal features of the flight trajectory (such as cruise altitude, Mach, airspeed, and rate of climb) in addition to the pre-departure features from the first solution. The labels or target variables are the APM parameters that were obtained by an optimized ordinary differential equations (ODE) fitting process (applied to individual flights). The ODE-fitting is very time intensive and is therefore performed offline. Thus, training an ML model to learn the relationship between the flight features and ODE-generated labels enables faster estimation of the APM parameters and is therefore amenable to real-time prediction. Various ML models including linear regression, random forest, XGBoost, and neural network were trained, and the results are compared. After model validation and hyperparameter-tuning, we observed that the Random Forest model outperformed the other three models by the overall mean square error (MSE) of 2% for the first solution and 1.5% for the second solution. Finally, the ML-derived parameters are compared against default BADA APM parameters using NASA’s Autonomy Development toolkit (ADK) simulation software. The simulation results for one of each aircraft type is shown and discussed.

Aida Sharif Rohani↗

Uncertainty Quantification using Deep Ensembles for Decision Making in Cyber-Physical-Human Systems

In this paper and its companion, Differential Equation Approximation Using Gradient-Boosted Quantile Regression, Robison et al., we examine an approach to quantifying model uncertainty with the aim of increasing the trustworthiness of computational models in human-machine interactions. In Differential Equation Approximation Using Gradient-Boosted Quantile Regression, we focus on gradient-boosted decision trees, while in this one, we give more details about deep ensembles. Uncertainty quantification is crucial for building trustworthy autonomous decision-making agents in human-machine teams. There are two types of uncertainties: aleatoric and epistemic. The former is related to the inherent stochasticity (noise) of the process, whereas the latter is associated with the lack of knowledge or representation capability of models, such as neural networks. By lack of knowledge, we mean the model’s inability to accurately predict outputs for all possible inputs. The aleatory uncertainty can be estimated fairly easily with, for example, filters, whereas epistemic uncertainty is challenging to compute. This paper uses deep ensembles to quantify both aleatory and epistemic uncertainty. It can act as an uncertainty-aware surrogate transition model for decision-making frameworks. "Uncertainty-aware" means that the surrogate transition model should make predictions along with confidence in those predictions. In the context of decision-making, the transition models are ordinary differential equations (ODEs). Since ODEs can be simulated to make one-step or multi-step predictions, a good surrogate model for them should perform reasonably well in both modes. In a multi-step approach, the trajectory sampling method TS∞ was used to propagate uncertainty over multiple steps. The cartpole dynamical system was selected to demonstrate the ability of deep ensembles as good surrogate transition models for decision-making frameworks. The deep ensembles modeled the dynamics of cartpole ODEs and made uncertainty-aware predictions in single-step and multi-step transition modes.

CPH systems↗

Artificial Neural Network Representation of Dynamic Criticality Excursion Experiment Data

This paper outlines time dependent considerations in applying the artificial neural network (ANN) paradigm to dynamic nuclear criticality excursion experiment data. The ANN amongst a variety of uses, can apply to function fitting of multiple input-multiple output data sets, pattern recognition, cluster analysis, and time series prediction. The ANN is a component of Machine Learning (ML) data analysis. The practical application of ML to criticality safety has been funded through the Y-12 Plant Directed Research and Demonstration (PDRD) program to support criticality safety and emergency planning efforts. The initial effort considered function fitting of criticality excursion data. Recent efforts successfully extended the ANN to criticality safety code validation. The initial ANN work applied to criticality excursions centered around multivariate function fitting of static (tabular) data taken from the French Consequences Radiologiques d'un Accident de Criticite (CRAC) and SILENE reactor campaigns. The former report (LeCorche) summarized important tabular data for the first 44 CRAC experiments. The initial ANN was trained to specific time-independent inputs, then applied to predict peak fission rate and total fissions for a wide variety of fissile solutions process conditions. This work extends that effort to apply the ANN paradigm to dynamic prediction of time-dependent criticality excursion experiment data. A dynamic criticality excursion in fissile solution represents a complex multiphysics phenomenon. Factors include among other things, coupled neutronic, multiphase fluid flow, temperature, pressure, acoustic shock, boiling heat transfer, reactivity feedback, and radiolytic gas considerations. There have been many efforts to model (over time) as coupled ordinary and (space) as partial differential equations (ODE, PDE). The ANN representation noted here does not rely on solving explicit ODE or PDEs. Rather the intent is to demonstrate that as a time series, the criticality excursion can be predicted by training specific ANN architectures to experimental input and output time series exclusively. The rationale for extending this work to the time-dependent regime is important in developing a 'criticality excursion emulator' solely on the basis of learning characteristics from experiment dynamic data. An emulator is different than a computer code simulator driven by the solution of ODEs and PDEs given select 'tuning parameters' that match outputs to experiments. A criticality excursion emulator, derived exclusively from an ANN or ML, could predict most likely excursion characteristics, trained from historic dynamic experiment data, presented with input values within the range of those experiments. The work noted shows that generic time-series ANN architectures can be satisfactorily applied to the prediction of dynamic, extremely chaotic criticality excursion power given an initial time dependent input series. In reality, an excursion emulator could be driven by user-supplied initial (t=0), time independent or constant values to generate time dependent outputs. Thus ongoing work includes developing a custom ANN such that initial dynamic conditions would be predicted. Those results then serve as inputs to a customized ANN architecture currently in development. (author)

42 ENGINEERING↗

Latent Twins

Over the past decade, scientific machine learning has transformed the development of mathematical and computational frameworks for analyzing, modeling, and predicting complex systems. From inverse problems to numerical partial differential equations (PDEs), dynamical systems, and model reduction, these advances have pushed the boundaries of what can be simulated. Yet they have often progressed in parallel, with representation learning and algorithmic solution methods evolving largely as separate pipelines. With Latent Twins, we propose a unifying mathematical framework that creates a hidden surrogate in latent space for the underlying equations. Whereas digital twins mirror physical systems in the digital world, Latent Twins mirror mathematical systems in a learned latent space governed by operators. Through this lens, classical modeling, inversion, model reduction, and operator approximation all emerge as special cases of a single principle. We establish the fundamental approximation properties of Latent Twins for both ordinary differential equations (ODEs) and PDEs and demonstrate the framework across three representative settings: (i) canonical ODEs, capturing diverse dynamical regimes; (ii) a PDE benchmark using the shallow-water equations, contrasting Latent Twin simulations with deep operator network and forecasts with a four-dimensional variational method baseline; and (iii) a challenging real-data geopotential reanalysis dataset, reconstructing and forecasting from sparse, noisy observations. Latent Twins provide a compact, interpretable surrogate for solution operators that evaluate across arbitrary time gaps in a single-shot, while remaining compatible with scientific pipelines such as assimilation, control, and uncertainty quantification. Looking forward, this framework offers scalable, theory-grounded surrogates that bridge data-driven representation learning and classical scientific modeling across disciplines.

Latent Twins↗

A Comparative Study of Eight Finite-Rate Chemistry Kinetics for CO/H-2 Combustion

We compare the performance and computational cost of 8 kinetic models (3 global and 5 elementary) that describe the finite-rate chemistry of syngas combustion. We apply them in simulating a turbulent jet flame with syngas diluted by 30% nitrogen. We model the turbulence by a modified k-epsilon model and the turbulence-chemistry interaction by the partially stirred reactor approach. To integrate the chemistry equations, we nominally use explicit fifth-order embedded Runge-Kutta ODE solver. But semi-implicit Bulirsch-Stoer and implicit Euler were also used. The computational time depends on the number of reaction steps and the ODE solver. Five models overpredict the maximum flame temperature (by 200 K-320 K). Two models underpredict it by 240 K and 580 K. The global model that is based on the Westbrook-Dryer (1981) model for hydrocarbon fuels gives the best agreement with measurements, and also has low computational demand. Therefore, it is recommended for modeling turbulent syngas flames.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Determination of equilibrium electron temperature and times using an electron swarm model with BOLSIG+ calculated collision frequencies and rate coefficients

Electromagnetic pulse (EMP) events produce low-energy conduction electrons from Compton electron or photoelectron ionizations with air. It is important to understand how conduction electrons interact with air in order to accurately predict EMP evolution and propagation. An electron swarm model can be used to monitor the time evolution of conduction electrons in an environment characterized by electric field and pressure. Here a swarm model is developed that is based on the coupled ordinary differential equations (ODEs) described by Higgins et al. (1973), hereinafter HLO. The ODEs characterize the swarm electric field, electron temperature, electron number density, and drift velocity. Important swarm parameters, the momentum transfer collision frequency, energy transfer collision frequency, and ionization rate, are calculated and compared to the previously reported fitted functions given in HLO. These swarm parameters are found using BOLSIG+, a two term Boltzmann solver developed by Hagelaar and Pitchford (2005), which utilizes updated cross sections from the LXcat website created by Pancheshnyi et al. (2012). We validate the swarm model by comparing to experimental effective ionization coefficient data in Dutton (1975) and drift velocity data in Ruiz-Vargas et al. (2010). In addition, we report on electron equilibrium temperatures and times for a uniform electric field of 1 StatV/cm for atmospheric heights from 0 to 40 km. We show that the equilibrium temperature and time are sensitive to the modifications in the collision frequencies and ionization rate based on the updated electron interaction cross sections.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Expeditious modeling of vapor transport and reactions in polymeric materials

We present a methodology for approximating dynamic adsorption of vapor coupled with diffusion in polymeric materials. In previous publications, the dynamic adsorption was represented by ordinary differential equations (ODEs) and solved in concentration and parameter space. To accelerate the calculation, we have developed a statistical approximation method using computationally cheap surrogate models (e.g., algebraic polynomials) that replace the ODE solutions of adsorption and are coupled with the diffusion equations. Since the polynomial presentation of the adsorption term is obtained in a standard format prior to modeling coupled sorption‐diffusion, the adsorption operator can be expressed as input data in the transport code. Compared to conventional operator‐splitting methods, the polynomial approximation of adsorption offers better computational efficiency. The methodology is demonstrated and validated using a dynamic Langmuir adsorption model that is coupled to diffusion and absorption models and applied to a water vapor sorption‐diffusion process in polydimethylsiloxane polymers. © 2017 American Institute of Chemical Engineers AIChE J , 63: 4079–4089, 2017

Sun, Yunwei↗

On the order of general linear methods.

General linear (GL) methods are numerical algorithms used to solve ODEs. The standard order conditions analysis involves the GL matrix itself and a starting procedure; however, a finishing method (F) is required to extract the actual ODE solution. The standard order analysis and stability are sufficient for the convergence of any GL method. Nonetheless, using a simple GL scheme, we show that the order definition may be too restrictive. Specifically, the order for GL methods with low order intermediate components may be underestimated. In this note we explore the order conditions for GL schemes and propose a new definition for characterizing the order of GL methods, which is focused on the final result--the outcome of F--and can provide more effective algebraic order conditions.

97 MATHEMATICS AND COMPUTING↗

Kinetics-Informed Neural Networks

Chemical kinetics and reaction engineering consists of the phenomenological framework for the disentanglement of reaction mechanisms, optimization of reaction performance and the rational design of chemical processes. Here, we utilize feed-forward artificial neural networks as basis functions to solve ordinary differential equations (ODEs) constrained by differential algebraic equations (DAEs) that describe microkinetic models (MKMs). We present an algebraic framework for the mathematical description and classification of reaction networks, types of elementary reaction, and chemical species. Under this framework, we demonstrate that the simultaneous training of neural nets and kinetic model parameters in a regularized multi-objective optimization setting leads to the solution of the inverse problem through the estimation of kinetic parameters from synthetic experimental data. We analyze a set of scenarios to establish the extent to which kinetic parameters can be retrieved from transient kinetic data, and assess the robustness of the methodology with respect to statistical noise. Furthermore, this approach to inverse kinetic ODEs can assist in the elucidation of reaction mechanisms based on transient data.

36 MATERIALS SCIENCE↗

Decreasing the temporal complexity for nonlinear, implicit reduced-order models by forecasting

Implicit numerical integration of nonlinear ODEs requires solving a system of nonlinear algebraic equations at each time step. Each of these systems is often solved by a Newton-like method, which incurs a sequence of linear-system solves. Most model-reduction techniques for nonlinear ODEs exploit knowledge of system's spatial behavior to reduce the computational complexity of each linear-system solve. However, the number of linear-system solves for the reduced-order simulation often remains roughly the same as that for the full-order simulation. We propose exploiting knowledge of the model's temporal behavior to (1) forecast the unknown variable of the reduced-order system of nonlinear equations at future time steps, and (2) use this forecast as an initial guess for the Newton-like solver during the reduced-order-model simulation. To compute the forecast, we propose using the Gappy POD technique. As a result, the goal is to generate an accurate initial guess so that the Newton solver requires many fewer iterations to converge, thereby decreasing the number of linear-system solves in the reduced-order-model simulation.

97 MATHEMATICS AND COMPUTING↗

Derivative-based SINDy (DSINDy): Addressing the challenge of discovering governing equations from noisy data

Recent advances in the field of data-driven dynamics allow for the discovery of ODE systems using state measurements. One approach, known as Sparse Identification of Nonlinear Dynamics (SINDy), assumes the dynamics are sparse within a predetermined basis in the states and finds the expansion coefficients through linear regression with sparsity constraints. This approach requires an accurate estimation of the state time derivatives, which is not necessarily possible in the high-noise regime without additional constraints. We present an approach called Derivative-based SINDy (DSINDy) that combines two novel methods to improve ODE recovery at high-noise levels. First, we denoise the state variables by applying a projection operator that leverages the assumed basis for the system dynamics. Second, we use a second order cone program (SOCP) to find the derivative and governing equations simultaneously. We derive theoretical results for the projection-based denoising step, which allow us to estimate the values of hyperparameters used in the SOCP formulation. This underlying theory helps limit the number of required user-specified parameters. Finally, we present results demonstrating that our approach leads to improved system recovery for the Van der Pol oscillator, the Duffing oscillator, the Rössler attractor, and the Lorenz 96 model.

97 MATHEMATICS AND COMPUTING↗

Large eddy simulation of extinction and reignition with artificial neural networks based chemical kinetics

Large eddy simulation (LES) of a non-premixed, temporally evolving, syngas/air flame is performed with special emphasis on speeding-up the sub-grid chemistry computations using an artificial neural networks (ANN) approach. The numerical setup for the LES is identical to a previous direct numerical simulation (DNS) study, which reported considerable local extinction and reignition physics, and hence, offers a challenging test case. The chemical kinetics modeling with ANN is based on a recent approach, and replaces the stiff ODE solver (DI) to predict the species reaction rates in the subgrid linear eddy mixing (LEM) model based LES (LEMLES). In order to provide a comprehensive evaluation of the current approach, additional information on conditional statistics of some of the key species and temperature are extracted from the previous DNS study and are compared with the LEMLES using ANN (ANN-LEMLES, hereafter). The results show that the current approach can detect the correct extinction and reignition physics with reasonable accuracy compared to the DNS. The syngas flame structure and the scalar dissipation rate statistics obtained by the current ANN-LEMLES are provided to further probe the flame physics. It is observed that, in contrast to H{sub 2}, CO exhibits a smooth variation within the region enclosed by the stoichiometric mixture fraction. The probability density functions (PDFs) of the scalar dissipation rates calculated based on the mixture fraction and CO demonstrate that the mean value of the PDF is insensitive to extinction and reignition. However, this is not the case for the scalar dissipation rate calculated by the OH mass fraction. Overall, ANN provides considerable computational speed-up and memory saving compared to DI, and can be used to investigate turbulent flames in a computationally affordable manner. (author)

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Long-time uncertainty propagation using generalized polynomial chaos and flow map composition

We present an efficient and accurate method for long-time uncertainty propagation in dynamical systems. Uncertain initial conditions and parameters are both addressed. The method approximates the intermediate short-time flow maps by spectral polynomial bases, as in the generalized polynomial chaos (gPC) method, and uses flow map composition to construct the long-time flow map. In contrast to the gPC method, this approach has spectral error convergence for both short and long integration times. The short-time flow map is characterized by small stretching and folding of the associated trajectories and hence can be well represented by a relatively low-degree basis. The composition of these low-degree polynomial bases then accurately describes the uncertainty behavior for long integration times. The key to the method is that the degree of the resulting polynomial approximation increases exponentially in the number of time intervals, while the number of polynomial coefficients either remains constant (for an autonomous system) or increases linearly in the number of time intervals (for a non-autonomous system). The findings are illustrated on several numerical examples including a nonlinear ordinary differential equation (ODE) with an uncertain initial condition, a linear ODE with an uncertain model parameter, and a two-dimensional, non-autonomous double gyre flow.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Path optimization with limited sensing ability

We propose a computational strategy to find the optimal path for a mobile sensor with limited coverage to traverse a cluttered region. The goal is to find one of the shortest feasible paths to achieve the complete scan of the environment. We pose the problem in the level set framework, and first consider a related question of placing multiple stationary sensors to obtain the full surveillance of the environment. By connecting the stationary locations using the nearest neighbor strategy, we form the initial guess for the path planning problem of the mobile sensor. Then the path is optimized by reducing its length, via solving a system of ordinary differential equations (ODEs), while maintaining the complete scan of the environment. Furthermore, we use intermittent diffusion, which converts the ODEs into stochastic differential equations (SDEs), to find an optimal path whose length is globally minimal. To improve the computation efficiency, we introduce two techniques, one to remove redundant connecting points to reduce the dimension of the system, and the other to deal with the entangled path so the solution can escape the local traps. Numerical examples are shown to illustrate the effectiveness of the proposed method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Computationally-efficient stochastic cluster dynamics method for modeling damage accumulation in irradiated materials

An improved version of a recently developed stochastic cluster dynamics (SCD) method (Marian and Bulatov, 2012) [6] is introduced as an alternative to rate theory (RT) methods for solving coupled ordinary differential equation (ODE) systems for irradiation damage simulations. SCD circumvents by design the curse of dimensionality of the variable space that renders traditional ODE-based RT approaches inefficient when handling complex defect population comprised of multiple (more than two) defect species. Several improvements introduced here enable efficient and accurate simulations of irradiated materials up to realistic (high) damage doses characteristic of next-generation nuclear systems. The first improvement is a procedure for efficiently updating the defect reaction-network and event selection in the context of a dynamically expanding reaction-network. Next is a novel implementation of the τ-leaping method that speeds up SCD simulations by advancing the state of the reaction network in large time increments when appropriate. Lastly, a volume rescaling procedure is introduced to control the computational complexity of the expanding reaction-network through occasional reductions of the defect population while maintaining accurate statistics. The enhanced SCD method is then applied to model defect cluster accumulation in iron thin films subjected to triple ion-beam (Fe{sup 3+}, He{sup +} and H{sup +}) irradiations, for which standard RT or spatially-resolved kinetic Monte Carlo simulations are prohibitively expensive.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fast and accurate implementation of Fourier spectral approximations of nonlocal diffusion operators and its applications

This work is concerned with the Fourier spectral approximation of various integral differential equations associated with some linear nonlocal diffusion and peridynamic operators under periodic boundary conditions. For radially symmetric kernels, the nonlocal operators under consideration are diagonalizable in the Fourier space so that the main computational challenge is on the accurate and fast evaluation of their eigenvalues or Fourier symbols consisting of possibly singular and highly oscillatory integrals. For a large class of fractional power-like kernels, we propose a new approach based on reformulating the Fourier symbols both as coefficients of a series expansion and solutions of some simple ODE models. We then propose a hybrid algorithm that utilizes both truncated series expansions and high order Runge–Kutta ODE solvers to provide fast evaluation of Fourier symbols in both one and higher dimensional spaces. It is shown that this hybrid algorithm is robust, efficient and accurate. As applications, we combine this hybrid spectral discretization in the spatial variables and the fourth-order exponential time differencing Runge–Kutta for temporal discretization to offer high order approximations of some nonlocal gradient dynamics including nonlocal Allen–Cahn equations, nonlocal Cahn–Hilliard equations, and nonlocal phase-field crystal models. Numerical results show the accuracy and effectiveness of the fully discrete scheme and illustrate some interesting phenomena associated with the nonlocal models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Energy stable discontinuous Galerkin methods for Maxwell's equations in nonlinear optical media

The propagation of electromagnetic waves in general media is modeled by the time-dependent Maxwell's partial differential equations (PDEs), coupled with constitutive laws that describe the response of the media. In this work, we focus on nonlinear optical media whose response is modeled by a system of first order nonlinear ordinary differential equations (ODEs), which include a single resonance linear Lorentz dispersion, and the nonlinearity comes from the instantaneous electronic Kerr response and the residual Raman molecular vibrational response. To design efficient, accurate, and stable computational methods, we apply high order discontinuous Galerkin discretizations in space to the hybrid PDE-ODE Maxwell system with several choices of numerical fluxes, and the resulting semi-discrete methods are shown to be energy stable. Under some restrictions on the strength of the nonlinearity, error estimates are also established. When we turn to fully discrete methods, the challenge to achieve provable stability lies in the temporal discretizations of the nonlinear terms. To overcome this, novel strategies are proposed to treat the nonlinearity in our model within the framework of the second-order leap-frog and implicit trapezoidal time integrators. The performance of the overall algorithms are demonstrated through numerical simulations of kink and antikink waves, and third-harmonic generation in soliton propagation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗