Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Nonlinear systems”

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 361 records · Page 20

Robust Control Design for Uncertain Nonlinear Dynamic Systems

Robustness to parametric uncertainty is fundamental to successful control system design and as such it has been at the core of many design methods developed over the decades. Despite its prominence, most of the work on robust control design has focused on linear models and uncertainties that are non-probabilistic in nature. Recently, researchers have acknowledged this disparity and have been developing theory to address a broader class of uncertainties. This paper presents an experimental application of robust control design for a hybrid class of probabilistic and non-probabilistic parametric uncertainties. The experimental apparatus is based upon the classic inverted pendulum on a cart. The physical uncertainty is realized by a known additional lumped mass at an unknown location on the pendulum. This unknown location has the effect of substantially altering the nominal frequency and controllability of the nonlinear system, and in the limit has the capability to make the system neutrally stable and uncontrollable. Another uncertainty to be considered is a direct current motor parameter. The control design objective is to design a controller that satisfies stability, tracking error, control power, and transient behavior requirements for the largest range of parametric uncertainties. This paper presents an overview of the theory behind the robust control design methodology and the experimental results.

Kenny, Sean P.↗

Method of approximate determination of the characteristics of nonlinear vibrational systems

Methods are discussed for determining the characteristics of elements of nonlinear vibrational systems, from the results of analyzing forced vibrations which are approximate in themselves, since they are based on the use of experimental data. The constant components of the linearized characteristics and linearization coefficients are determined experimentally by finding the values of these quantities at different vibration amplitudes and frequencies and subsequent approximation of their analytical expressions. Simple and convenient, although approximate, formulas for determining the characteristics of vibrational systems from experimentally known functions are derived.

Atstupenene, R. P.↗

Squeezing spectra for nonlinear optical systems

The squeezing spectra for the output fields of several intracavity nonlinear optical systems are obtained. It is shown that at critical points, e.g., the turning points for optical bistability, the threshold for parametric oscillation, and the self-pulsing instability in second-harmonic generation, perfect squeezing in the output field is, in principle, possible.

Collett, M. J.↗

An iterative method for systems of nonlinear hyperbolic equations

An iterative algorithm for the efficient solution of systems of nonlinear hyperbolic equations is presented. Parallelism is evident at several levels. In the formation of the iteration, the equations are decoupled, thereby providing large grain parallelism. Parallelism may also be exploited within the solves for each equation. Convergence of the interation is established via a bounding function argument. Experimental results in two-dimensions are presented.

Scroggs, Jeffrey S.↗

On the estimation of the attainability set of nonlinear control systems

Analysis of the attainability set and construction of its estimates greatly facilitates the solution of a variety of problems in mathematical control theory. In the paper, the problem of boundedness of the integral funnel of nonlinear controlled system is considered. Some estimates of the attainability sets for a nonlinear controlled system are presented. Theorems on the boundedness of considered integral funnels are proved.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Parallel domain decomposition method for finite element approximation of 3D steady state non‐Newtonian fluids

Summary We introduce a stabilized finite element method for the 3D non‐Newtonian Navier–Stokes equations and a parallel domain decomposition method for solving the sparse system of nonlinear equations arising from the discretization. Non‐Newtonian flow problems are, generally speaking, more challenging than Newtonian flows because the nonlinearities are not only in the convection term but also in the viscosity term, which depends on the shear rate. Many good iterative methods and preconditioning techniques that work well for the Newtonian flows do not work well for the non‐Newtonian flows. We employ a Galerkin/least squares finite element method, with stabilization parameters adjusted to count the non‐Newtonian effect, to discretize the equations, and the resulting highly nonlinear system of equations is solved by a Newton–Krylov–Schwarz algorithm. In this study, we apply the proposed method to some inelastic power‐law fluid flows through the eccentric annuli with inner cylinder rotation and investigate the robustness of the method with respect to some physical parameters, including the power‐law index and the Reynolds number ratios. We then report the superlinear speedup achieved by the domain decomposition algorithm on a computer with up to 512 processors. Copyright © 2015 John Wiley & Sons, Ltd.

Shiu, Wen‐Shin↗

Tusas: A fully implicit parallel approach for coupled phase-field equations

In this study, we develop a fully-coupled, fully-implicit approach for phase-field modeling of solidification in metals and alloys. Predictive simulation of solidification in pure metals and metal alloys remains a significant challenge in the field of materials science, as microstructure formation during the solidification process plays a critical role in the properties and performance of the solid material. Our simulation approach consists of a finite element spatial discretization of the fully-coupled nonlinear system of partial differential equations at the microscale, which is treated implicitly in time with a preconditioned Jacobian-free Newton-Krylov method. The approach is algorithmically scalable as well as efficient due to an effective preconditioning strategy based on algebraic multigrid and block factorization. We implement this approach in the open-source Tusas framework, which is a general, flexible tool developed in C++ for solving coupled systems of nonlinear partial differential equations. The performance of our approach is analyzed in terms of algorithmic scalability and efficiency, while the computational performance of Tusas is presented in terms of parallel scalability and efficiency on emerging heterogeneous architectures. We demonstrate that modern algorithms, discretizations, and computational science, and heterogeneous hardware provide a robust route for predictive phase-field simulation of microstructure evolution during additive manufacturing.

97 MATHEMATICS AND COMPUTING↗

Nonlinear combining and compression in multicore fibers

In this paper, we demonstrate numerically light-pulse combining and pulse compression using wave-collapse (self-focusing) energy-localization dynamics in a continuous-discrete nonlinear system, as implemented in a multicore fiber (MCF) using one-dimensional (1D) and 2D core distribution designs. Large-scale numerical simulations were performed to determine the conditions of the most efficient coherent combining and compression of pulses injected into the considered MCFs. We demonstrate the possibility of combining in a single core 90% of the total energy of pulses initially injected into all cores of a 7-core MCF with a hexagonal lattice. Finally, a pulse compression factor of about 720 can be obtained with a 19-core ring MCF.

42 ENGINEERING↗

On Computation of Koopman Operator from Sparse Data

In this paper, we propose a novel approach to compute the Koopman operator from sparse time series data. In recent years there has a considerable interest in operator theoretic methods for data-driven analysis of dynamical systems and existing techniques for the approximation of the Koopman operator require rich enough data-sets. However, in many applications, the data set may not be rich enough to approximate the operators to acceptable limits. In this paper, using ideas from robust optimization, we propose an algorithm to compute the Koopman operator from sparse data. In particular, we enrich the sparse data set with artificial data points and use robust optimization techniques to obtain the transfer operator. We illustrate the efficiency of our proposed approach in three different dynamical systems, namely, a linear system, a nonlinear system and a dynamical system governed by a partial differential equation.

Sinha, Subhrajit↗

Nonlinear control via approximate input-output linearization - The ball and beam example

This paper presents an approach for the approximate input-output linearization of nonlinear systems, particularly those for which relative degree is not well defined. It is shown that there is a great deal of freedom in the selection of an approximation and that, by designing a tracking controller based on the approximating system, tracking of reasonable trajectories can be achieved with small error. The approximating system is itself a nonlinear system, with the difference that it is input-output linearizable by state feedback. Some properties of the accuracy of the approximation are demonstrated and, in the context of the ball and beam example, it is shown to be far superior to the Jacobian approximation. The results are focused on finding regular SISO systems which are close to systems which are not regular and controlling these approximate regular systems.

Hauser, John↗

Parallel homotopy curve tracking on a hypercube

An investigation is conducted to find good parallel algorithms for solving systems of nonlinear equations using probability-one homotopy methods. Particular attention is paid to algorithms for the hypercube. Methods for one of the most computationally expensive steps of the homotopy approach, the computation of the kernel of the Jacobian matrix of the homotopy map, are studied. General nonlinear systems of equations with small and dense Jacobian matrices are considered, however, polynomial systems are not, since their structure leads to different strategies for parallelism. The mathematics behind the homotopy algorithm is summarized and the use of orthogonal factorizations is discussed. Parallel algorithms for orthogonal factorizations and triangular system solving are described. Computational results are presented and discussed.

Chakraborty, A.↗

Gap solitons and Bloch waves in nonlinear periodic systems

We comprehensively investigate gap solitons and Bloch waves in one-dimensional nonlinear periodic systems. Our results show that there exists a composition relation between them: Bloch waves at either the center or edge of the Brillouin zone are infinite chains composed of fundamental gap solitons (FGSs). We argue that such a relation is related to the exact relation between nonlinear Bloch waves and nonlinear Wannier functions. With this composition relation, many conclusions can be drawn for gap solitons without any computation. For example, for the defocusing nonlinearity, there are n families of FGS in the nth linear Bloch band gap; for the focusing case, there are infinite number of families of FGSs in the semi-infinite gap and other gaps. In addition, the stability of gap solitons is analyzed. In literature, there are numerical results showing that some FGSs have cutoffs on propagation constant (or chemical potential), i.e., these FGSs do not exist for all values of propagation constant (or chemical potential) in the linear band gap. We develop an intuitive picture to describe this cutoff.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An eigenvalue-based method for computing the relaxed pressure in compressible multiphase flow with N phases

The modeling of compressible multiphase flows is a decades-old area of study with many applications across various fields. Many of these application areas use stiff pressure relaxation. This process involves the solution of a nonlinear system with N + 1 equations and N + 1 unknowns, where N is the number of phases. The resolution of this system with general equations of state (EOSs) is difficult. Furthermore, nonlinear systems can admit multiple solutions, and current solution methods do not address this possibility. Very recently, a thermodynamic relaxation method was introduced, which effectively maps a relatively simple predictor equation of state onto a more complex target equation of state. In this context, the target EOSs are the chosen EOSs for the thermodynamic model. Furthermore, this thermodynamic relaxation has the benefit of simplifying the stiff pressure relaxation system of equations. In this article, we show this system reduces to a polynomial of degree N, which can be recast as an eigenvalue problem through the use of the associated companion matrix. We show that although this eigenvalue method is generally less efficient than Newton–Raphson iteration, it does not suffer from convergence issues and finds all N roots of the polynomial. Hence, the method provides a fail-safe for root-finding iterative methods and a way to address the issue of multiple solutions to the nonlinear system of equations in stiff pressure relaxation.

Eigenvalue algorithm↗

Probabilistic-learning-based stochastic surrogate model from small incomplete datasets for nonlinear dynamical systems

We consider a high-dimensional nonlinear computational model of a dynamical system, parameterized by a vector-valued control parameter, in the presence of uncertainties represented by an uncontrolled parameter modeled by a vector-valued random variable, and possibly with stochastic excitation. The objective is to construct a statistical surrogate model where the input is any deterministic value of the control parameter, and the output is a vector-valued observation of the computational model, which is a random vector whose probability measure is updated using a target dataset. To construct this statistical surrogate model, the stochastic response of the computational model must be built, which is a vector-valued time-discretized stochastic process in high dimension, depending on the control parameter. It is assumed that the computational cost of a single evaluation of the deterministic model is high. For the probabilistic updating, we consider a subset of the components of the observation of the computational model, defined as the “identification observation” of the computational model, for which a small target dataset is available. Therefore, the target dataset is associated with partial observability, corresponding to an incomplete data case. Given a prior probability model of the random control and uncontrolled parameters, a training dataset is constructed, consisting of realizations of the random triplet composed of the stochastic response, the random identification observation, and the random control parameter. Since the computational cost of a single evaluation of the deterministic model is assumed to be large, the training dataset is also of small size. The main challenges in this problem are the high dimensionality, partial observability leading to incomplete data in the target dataset for the identification observation of the computational model (which is not sufficient to identify the computational stochastic responses), and the availability of a small training dataset. To address these challenges, we propose a methodology based on statistical methods for constructing necessary reduced representations, direct probabilistic learning under constraints using probabilistic learning on manifolds (PLoM) constrained by the target dataset, and the use of a weak formulation of the Fourier transform of probability measures. Statistical conditioning is also employed to explore the learned dataset. The constructed predictive statistical surrogate model can be implemented in the context of online computation. Here, we apply this approach to a problem of nonlinear stochastic dynamics in high dimensions within the framework of deformable solids mechanics.

Engineering↗

Tensor-GMRES method for large sparse systems of nonlinear equations

This paper introduces a tensor-Krylov method, the tensor-GMRES method, for large sparse systems of nonlinear equations. This method is a coupling of tensor model formation and solution techniques for nonlinear equations with Krylov subspace projection techniques for unsymmetric systems of linear equations. Traditional tensor methods for nonlinear equations are based on a quadratic model of the nonlinear function, a standard linear model augmented by a simple second order term. These methods are shown to be significantly more efficient than standard methods both on nonsingular problems and on problems where the Jacobian matrix at the solution is singular. A major disadvantage of the traditional tensor methods is that the solution of the tensor model requires the factorization of the Jacobian matrix, which may not be suitable for problems where the Jacobian matrix is large and has a 'bad' sparsity structure for an efficient factorization. We overcome this difficulty by forming and solving the tensor model using an extension of a Newton-GMRES scheme. Like traditional tensor methods, we show that the new tensor method has significant computational advantages over the analogous Newton counterpart. Consistent with Krylov subspace based methods, the new tensor method does not depend on the factorization of the Jacobian matrix. As a matter of fact, the Jacobian matrix is never needed explicitly.

Feng, Dan↗