Search NASA⌕ Search

SEARCH · Search NASA

Results for “Nonlinear problems”

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 199 records · Page 11

Mechanisms for the convergence of time-parallelized, parareal turbulent plasma simulations

Parareal is a recent algorithm able to parallelize the time dimension in spite of its sequential nature. It has been applied to several linear and nonlinear problems and, very recently, to a simulation of fully-developed, two-dimensional drift wave turbulence. The mere fact that parareal works in such a turbulent regime is in itself somewhat unexpected, due to the characteristic sensitivity of turbulence to any change in initial conditions. This fundamental property of any turbulent system should render the iterative correction procedure characteristic of the parareal method inoperative, but this seems not to be the case. In addition, the choices that must be made to implement parareal (division of the temporal domain, election of the coarse solver and so on) are currently made using trial-and-error approaches. Here, we identify the mechanisms responsible for the convergence of parareal of these simulations of drift wave turbulence. We also investigate which conditions these mechanisms impose on any successful parareal implementation. The results reported here should be useful to guide future implementations of parareal within the much wider context of fully-developed fluid and plasma turbulent simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

THE HYDROMAGNETIC INTERIOR OF A SOLAR QUIESCENT PROMINENCE. I. COUPLING BETWEEN FORCE BALANCE AND STEADY ENERGY TRANSPORT

This series of papers investigates the dynamic interiors of quiescent prominences revealed by recent Hinode and SDO/AIA high-resolution observations. This first paper is a study of the static equilibrium of the Kippenhahn-Schlueter diffuse plasma slab, suspended vertically in a bowed magnetic field, under the frozen-in condition and subject to a theoretical thermal balance among an optically thin radiation, heating, and field-aligned thermal conduction. The everywhere-analytical solutions to this nonlinear problem are an extremely restricted subset of the physically admissible states of the system. For most values of the total mass frozen into a given bowed field, force balance and steady energy transport cannot both be met without a finite fraction of the total mass having collapsed into a cold sheet of zero thickness, within which the frozen-in condition must break down. An exact, resistive hydromagnetic extension of the Kippenhahn-Schlueter slab is also presented, resolving the mass-sheet singularity into a finite-thickness layer of steadily falling dense fluid. Our hydromagnetic result suggests that the narrow, vertical prominence H{sub {alpha}} threads may be falling across magnetic fields, with optically thick cores much denser and ionized to much lower degrees than conventionally considered. This implication is discussed in relation to (1) the recent SDO/AIA observations of quiescent prominences that are massive and yet draining mass everywhere in their interiors, (2) the canonical range of 5-60 G determined from spectral polarimetric observations of prominence magnetic fields over the years, and (3) the need for a more realistic multi-fluid treatment.

79 ASTRONOMY AND ASTROPHYSICS↗

Pole-zero form fractional model identification in frequency domain

This paper deals with system identification in the frequency domain using non integer order models given in the pole-zero form. The usual identification techniques cannot be used in this case because of the non integer orders of differentiation which makes the problem strongly nonlinear. A general identification method based on Levenberg-Marquardt algorithm is developed and allows to estimate the (2n+2m+1) parameters of the model. Its application to identify the ''skin effect'' of a squirrel cage induction machine modeling is then presented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Model-size reduction for the analysis of symmetric structures with asymmetric boundary conditions

A simple computational procedure is presented for reducing the size of the analysis model for a symmetric structure with asymmetric boundary conditions to that of the corresponding structure with symmetric boundary conditions. The procedure is based on approximating the asymmetric response of the structure by a linear combination of symmetric and antisymmetric global approximation vectors (or modes). The key elements of the procedure are (1) restructuring the governing finite-element equations to delineate the contributions to the symmetric and antisymmetric components of the asymmetric response, (2) successive application of the finite element method and the classical Rayleigh-Ritz technique. The finite-element method is first used to generate a few global approximation vectors (or modes). Then the amplitudes of these modes are computed by using the Rayleigh-Ritz technique. The effectiveness of the computational procedure is demonstrated by means of numerical examples of linear static problems of shells, and its potential for solving nonlinear problems is discussed.

Noor, Ahmed K.↗

A Plug-and-Play Priors Approach for Solving Nonlinear Imaging Inverse Problems

In the past two decades, nonlinear image reconstruction methods have led to substantial improvements in the capabilities of numerous imaging systems. Such methods are traditionally formulated as optimization problems that are solved iteratively by simultaneously enforcing data consistency and incorporating prior models. Recently, the Plug-and-Play Priors (PPP) framework suggested that by using more sophisticated denoisers, not necessarily corresponding to an optimization objective, it is possible to improve the quality of reconstructed images. Here in this letter, we show that the PPP approach is applicable beyond linear inverse problems. In particular, we develop the fast iterative shrinkage/thresholding algorithm variant of PPP for model-based nonlinear inverse scattering. The key advantage of the proposed formulation over the original ADMM-based one is that it does not need to perform an inversion on the forward model. We show that the proposed method produces high quality images using both simulated and experimentally measured data.

97 MATHEMATICS AND COMPUTING↗

PetIGA: A framework for high-performance isogeometric analysis

We present PetIGA, a code framework to approximate the solution of partial differential equations using isogeometric analysis. PetIGA can be used to assemble matrices and vectors which come from a Galerkin weak form, discretized with Non-Uniform Rational B-spline basis functions. We base our framework on PETSc, a high-performance library for the scalable solution of partial differential equations, which simplifies the development of large-scale scientific codes, provides a rich environment for prototyping, and separates parallelism from algorithm choice. We describe the implementation of PetIGA, and exemplify its use by solving a model nonlinear problem. To illustrate the robustness and flexibility of PetIGA, we solve some challenging nonlinear partial differential equations that include problems in both solid and fluid mechanics. Lastly, we show strong scaling results on up to 4096 cores, which confirm the suitability of PetIGA for large scale simulations.

97 MATHEMATICS AND COMPUTING↗

NASA LeRC/Akron University Graduate Cooperative Fellowship Program and Graduate Student Researchers Program

The requisite methodology to solve linear and nonlinear problems associated with the static and dynamic analysis of rotating machinery, their static and dynamic behavior, and the interaction between the rotating and nonrotating parts of an engine is developed. Linear and nonlinear structural engine problems are investigated by developing solution strategies and interactive computational methods whereby the man and computer can communicate directly in making analysis decisions. Representative examples include modifying structural models, changing material, parameters, selecting analysis options and coupling with interactive graphical display for pre- and postprocessing capability.

Fertis, D. G.↗

On the Dirichlet problem for a nonlinear elliptic equation

We prove the existence of an infinite set of solutions to the Dirichlet problem for a nonlinear elliptic equation of the second order. Such a problem for a nonlinear elliptic equation with Laplace operator was studied earlier by Krasnosel'skii, Bahri, Berestycki, Lions, Rabinowitz, Struwe and others. We study the spectrum of this problem and prove the weak convergence to 0 of the sequence of normed eigenfunctions. Moreover, we obtain some estimates for the 'Fourier coefficients' of functions in W{sub p,0}{sup 1}(Ω). This allows us to improve the preceding results. Bibliography: 8 titles.

97 MATHEMATICS AND COMPUTING↗

The SPAR thermal analyzer: Present and future

The SPAR thermal analyzer, a system of finite-element processors for performing steady-state and transient thermal analyses, is described. The processors communicate with each other through the SPAR random access data base. As each processor is executed, all pertinent source data is extracted from the data base and results are stored in the data base. Steady state temperature distributions are determined by a direct solution method for linear problems and a modified Newton-Raphson method for nonlinear problems. An explicit and several implicit methods are available for the solution of transient heat transfer problems. Finite element plotting capability is available for model checkout and verification.

Marlowe, M. B.↗

Solution of the Navier-Stokes equations for a driven cavity

The flow field in a lid driven cavity is determined by integration of the incompressible Navier-Stokes equations. The numerical integration is accomplished via an operator splitting method known as the theta-scheme. This splitting separates the problem into the solution of a quasi-stokes problem and a nonlinear convection problem. Some details of solution methods used for the two subproblems and results obtained for the driven cavity are described. The schemes developed for the quasi-Stokes problem are more advanced at this stage than those for the nonlinear problem. However, the approaches used for both parts are outlined. As a model problem, a two dimensional square cavity with sides of unit length and a lid moving with unit velocity from left to right is considered. The Navier-Stokes equations are discretized in space on a uniform staggered or MAC mesh. The time discretization is accomplished via the theta-scheme.

Semeraro, B. D.↗

Multigrid techniques for nonlinear eigenvalue probems: Solutions of a nonlinear Schroedinger eigenvalue problem in 2D and 3D

This paper presents multigrid (MG) techniques for nonlinear eigenvalue problems (EP) and emphasizes an MG algorithm for a nonlinear Schrodinger EP. The algorithm overcomes the mentioned difficulties combining the following techniques: an MG projection coupled with backrotations for separation of solutions and treatment of difficulties related to clusters of close and equal eigenvalues; MG subspace continuation techniques for treatment of the nonlinearity; an MG simultaneous treatment of the eigenvectors at the same time with the nonlinearity and with the global constraints. The simultaneous MG techniques reduce the large number of self consistent iterations to only a few or one MG simultaneous iteration and keep the solutions in a right neighborhood where the algorithm converges fast.

Costiner, Sorin↗

Discrete time learning control in nonlinear systems

In this paper digital learning control methods are developed primarily for use in single-input, single-output nonlinear dynamic systems. Conditions for convergence of the basic form of learning control based on integral control concepts are given, and shown to be satisfied by a large class of nonlinear problems. It is shown that it is not the gross nonlinearities of the differential equations that matter in the convergence, but rather the much smaller nonlinearities that can manifest themselves during the short time interval of one sample time. New algorithms are developed that eliminate restrictions on the size of the learning gain, and on knowledge of the appropriate sign of the learning gain, for convergence to zero error in tracking a feasible desired output trajectory. It is shown that one of the new algorithms can give guaranteed convergence in the presence of actuator saturation constraints, and indicate when the requested trajectory is beyond the actuator capabilities.

Longman, Richard W.↗

Explicit physics-informed neural networks for nonlinear closure: The case of transport in tissues

In upscaling methods, closures for nonlinear problems present a well-known challenge. While a number of theoretical methods have been proposed for handling such closures, nonlinearities still remain a significant obstacle for many problems. In this work, we use a combination of formal upscaling and data-driven machine learning for explicitly closing a nonlinear transport and reaction process in multiscale tissues. The classical effectiveness factor model is used to formulate the macroscale reaction kinetics. We train a multilayer perceptron network using training data generated by direct numerical simulations over microscale examples. Once trained, the network is used in an algorithm for numerically solving the upscaled (coarse-grained) differential equation describing mass transport and reaction in two example tissues. The network is described as being explicit in the sense that the network is trained using macroscale concentrations and gradients of concentration as components of the feature space rather than incorporating them as part of a constraint in the optimization process. Network training and solutions to the macroscale transport equations were computed for two different tissues. The two tissue types (brain and liver) exhibit markedly different geometrical complexity and spatial scale (cell size and sample size). The upscaled solutions for the average concentration are compared with numerical solutions derived from the microscale concentration fields by a posteriori averaging. There are three outcomes of this work of particular note. 1) Our overall approach results in an upscaled nonlinear PDE. The PDE is closed using a neural network, and our approach results in the definition of the classical effectiveness factor for effecting closure. 2) We identify particular source terms for the closure problem that are important for representing the structure of the closure. These source terms involve macroscale concentrations and their gradients. We adopt these source terms to use as explicit features in the learning algorithm. We find the trained networks that include the macroscale source terms generate models that are able to predict the correction factor with increased fidelity over those that do not. 3) We find that the trained network exhibits good generalizability, and it is able to predict the effectiveness factor with high fidelity for realistically-structured tissues despite the significantly different scale and geometrical complexity of the two example tissue types. This latter result emphasizes our purposeful connection between conventional averaging methods with the use of machine learning for closure; this contrasts with some machine learning methods for upscaling where the exact form of the macroscale equation remains unknown.

97 MATHEMATICS AND COMPUTING↗

Difference equation state approximations for nonlinear hereditary control problems

Discrete approximation schemes for the solution of nonlinear hereditary control problems are constructed. The methods involve approximation by a sequence of optimal control problems in which the original infinite dimensional state equation has been approximated by a finite dimensional discrete difference equation. Convergence of the state approximations is argued using linear semigroup theory and is then used to demonstrate that solutions to the approximating optimal control problems in some sense approximate solutions to the original control problem. Two schemes, one based upon piecewise constant approximation, and the other involving spline functions are discussed. Numerical results are presented, analyzed and used to compare the schemes to other available approximation methods for the solution of hereditary control problems.

Rosen, I. G.↗

Difference equation state approximations for nonlinear hereditary control problems

Discrete approximation schemes for the solution of nonlinear hereditary control problems are constructed. The methods involve approximation by a sequence of optimal control problems in which the original infinite dimensional state equation has been approximated by a finite dimensional discrete difference equation. Convergence of the state approximations is argued using linear semigroup theory and is then used to demonstrate that solutions to the approximating optimal control problems in some sense approximate solutions to the original control problem. Two schemes, one based upon piecewise constant approximation, and the other involving spline functions are discussed. Numerical results are presented, analyzed and used to compare the schemes to other available approximation methods for the solution of hereditary control problems. Previously announced in STAR as N83-33589

Rosen, I. G.↗

Lossless Convexification of Control Constraints for a Class of Nonlinear Optimal Control Problems

In this paper we consider a class of optimal control problems that have continuous-time nonlinear dynamics and nonconvex control constraints. We propose a convex relaxation of the nonconvex control constraints, and prove that the optimal solution to the relaxed problem is the globally optimal solution to the original problem with nonconvex control constraints. This lossless convexification enables a computationally simpler problem to be solved instead of the original problem. We demonstrate the approach in simulation with a planetary soft landing problem involving a nonlinear gravity field.

planetary soft landing↗

Constructing the Pareto front for multi-objective Markov chains handling a strong Pareto policy approach

In this paper, we present a multi-objective solution of the Pareto front for a certain class of discrete-time ergodic controllable Markov chains. For solving the problem, we transform the original multi-objective problem into an equivalent nonlinear programming problem implementing the Lagrange principle. We then propose to adopt the Tikhonov’s regularization method to ensure the convergence of the cost functions to a unique point into the Pareto front. We show that Pareto policies are characterized as optimal policies. One of the fundamental problems related to the construction of the Pareto front is the existence and characterization of both, Pareto and strong Pareto policies. By introducing the Tikhonov’s regularizator, we ensure the existence of strong Pareto policies. This paper proposes a real solution to this problem. We formulate the original problem considering several constraints: (a) we employ the c-variable method for the introduction of linear constraints over the nonlinear problem and (b) restrict the cost functions, allowing points in the Pareto front to have a small distance from one another. The constraints imposed by the c-variable method make the problem computationally tractable and the restriction imposed by the small distance change ensures the continuation of the Pareto front. The resulting equation in this nonlinear system is an optimization problem for which the necessary and efficient condition of a minimum is solved using the projected gradient method. Moreover, we also prove the convergence conditions and compute the estimate rate of convergence of variables corresponding to the Lagrange principle and the Tikhonov’s regularization, respectively. We provide all the details needed to implement the proposed method in an efficient way. The usefulness of the method is successfully demonstrated by a numerical example.

97 MATHEMATICS AND COMPUTING↗