Search NASA⌕ Search

SEARCH · Search NASA

Results for “Quadratic convergence”

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 163 records · Page 9
All sourcesNASA NTRSDOE OSTI
NASA NTRS2012

Progress Towards a Cartesian Cut-Cell Method for Viscous Compressible Flow

We present preliminary development of an approach for simulating high Reynolds number steady compressible flow in two space dimensions using a Cartesian cut-cell finite volume method. We consider both laminar and turbulent flow with both low and high cell Reynolds numbers near the wall. The approach solves the full Navier-Stokes equations in all cells, and uses a wall model to address the resolution requirements near boundaries and to mitigate mesh irregularities in cut cells. We present a quadratic wall model for low cell Reynolds numbers. At high cell Reynolds numbers, the quadratic is replaced with a newly developed analytic wall model stemming from solution of a limiting form of the Spalart-Allmaras turbulence model which features a forward evaluation for flow velocity and exactly matches characteristics of the SA turbulence model in the field. We develop multigrid operators which attain convergence rates similar to inviscid multigrid. Investigations focus on preliminary verification and validation of the method. Flows over flat plates and compressible airfoils show good agreement with both theoretical results and experimental data. Mesh convergence studies on sub- and transonic airfoil flows show convergence of surface pressures with wall spacings as large as approx.0.1% chord. With the current analytic wall model, one or two additional refinements near the wall are required to obtain mesh converged values of skin friction.

Berger, Marsha↗
DOE OSTI2021

Linear and Nonlinear Solvers for Simulating Multiphase Flow within Large-Scale Engineered Subsurface Systems

Simulation of multiphase flow in the subsurface is well-known to be computationally challenging. While there have been many studies that have explored approaches to overcoming these challenges, they often utilize relatively simple case studies. In this paper, we focus on the unique numerical challenges posed by modeling large-scale engineered subsurface systems, characterized by discrete features embedded in a heterogeneous natural subsurface setting. The man-made features such as shafts, tunnels, and barriers often cause multiple challenges in modeling the domain for multiphase porous media flow. This flow scenario can have a wide range of applications such as nuclear waste repositories, enhanced recovery of a petroleum reservoir, geothermal engineering, and carbon sequestration. An example of these severe numerical challenges is the case of performance assessment (PA) for Waste Isolation Pilot Plant (WIPP), the only operating deep geological repository in the US, which simulates extreme material properties of bedded salt rock formation and extreme contrast due to open excavation next to the formation. The models have extremes not only of permeability and porosity but also of the constitutive models needed for multiphase flow; additionally, they have process models like salt creep closure reducing porosity over time, fracturing in clay and anhydrite interbeds of the bedded salt, gas generation from the waste materials, and unintentional human borehole intrusions in some scenarios. Numerical simulations require the solution of coupled systems of nonlinear PDEs; in our work, we use the open-source simulator PFLOTRAN which is based on Finite Volume discretization. The solution of the nonlinear equations requires use of the Newton-Raphson iteration at each time step, which entails the solution of the linearized Jacobian system at each iteration. The effects of all the processes (i.e., large number of unknowns, highly nonlinear constitutive relations, large contrasts in material properties in short distances) lead to an ill-conditioned Jacobian matrix that severely challenges traditional linear solver, i.e., stabilized biconjugate gradient with block Jacobi incomplete LU preconditioner (BCGS-ILU) leading to non-convergence for traditional Newton-Raphson nonlinear solver causing unacceptably long computation time for each model. This paper presents linear solvers such as constrained pressure residual (CPR) two-stage preconditioner with alternate-block-factorization (ABF) and quasi- implicit pressure and explicit saturation (QIMPES) decouplers and flexible generalized residual solver (FGMRES). The new general-purpose nonlinear solver, Newton trust-region dogleg Cauchy (NTRDC), is also introduced to resolve extreme nonlinearities in the models. We demonstrate the effectiveness of each method relative to the default BCGS-Newton solver. The two best cases had nearly 50 times speed-up and achieved completion of a simulation in 14 hours that never completed due to non-convergence with the default solver. We also investigate the strong scalability of each method and discuss some of the deficiencies found for Block Jacobi preconditioner using parallel domain decomposition, and node packing effects of modern processor architecture.

Preconditioner, Nonlinear, Porous media, Multiphas↗
DOE OSTI2020

CPU and memory efficient coherent mode decomposition for the partially coherent x-ray simulations

In this work, the method of the Coherent Mode Decomposition (CMD) is applied to numerical wave propagation calculations for partially-coherent X-rays, using the Fourier optics and compatible methods. Its CPU and memory efficiency is discussed in various cases of the wavefront at the source and the beam waist. With the absence of the quadratic phase terms, the required sampling density of the electric fields is effectively reduced. The problem size is thus moderate and the method is feasible to be implemented on a single-node CPU server. In other cases, the same argument holds with proper treatments of the quadratic phase terms. Tests on CMD and the modes propagation are done for the case of the Coherent Hard X-ray beamline of the National Synchrotron Light Source II, using the Synchrotron Radiation Workshop software. We observe a few hundred or less dominant decomposed modes that resemble the electric fields converge to the wavefront intensity at a high accuracy of over 99%.

36 MATERIALS SCIENCE↗
NASA NTRS1981

Electro-optical processor for optimal control

An iterative optical processor has been developed for applications in the optimal control of advanced sensor systems. The processor is designed for the realization of the Richardson algorithm on bipolar data, using as input a linear array of LEDs. The usefulness of the processor has been demonstrated by the solution of the linear quadratic regulator problem for the optimal control signals of the F100 turbofan engine. In this case study, the algebraic Riccati equation matrix was solved by the use of a modified Kleinman algorithm along with the Richardson algorithm applied to a system of linear algebraic equations. Preliminary experimental results demonstrate the gradual convergence of the processor.

Casasent, D.↗
NASA NTRS1985

A new approach to approximating the linear quadratic optimal control law for hereditary systems with control delays

A factorization approach is presented for deriving approximations to the optimal feedback gain for the linear regulator-quadratic cost problem associated with time-varying functional differential equations with control delays. The approach is based on a discretization of the state penalty which leads to a simple structure for the feedback control law. General properties of the Volterra factors of Hilbert-Schmidt operators are then used to obtain convergence results for the feedback kernels.

Milman, M. H.↗
NASA NTRS2017

Low-Thrust Trajectory Optimization with Simplified SQP Algorithm

The problem of low-thrust trajectory optimization in highly perturbed dynamics is a stressing case for many optimization tools. Highly nonlinear dynamics and continuous thrust are each, separately, non-trivial problems in the field of optimal control, and when combined, the problem is even more difficult. This paper de-scribes a fast, robust method to design a trajectory in the CRTBP (circular restricted three body problem), beginning with no or very little knowledge of the system. The approach is inspired by the SQP (sequential quadratic programming) algorithm, in which a general nonlinear programming problem is solved via a sequence of quadratic problems. A few key simplifications make the algorithm presented fast and robust to initial guess: a quadratic cost function, neglecting the line search step when the solution is known to be far away, judicious use of end-point constraints, and mesh refinement on multiple shooting with fixed-step integration.In comparison to the traditional approach of plugging the problem into a “black-box” NLP solver, the methods shown converge even when given no knowledge of the solution at all. It was found that the only piece of information that the user needs to provide is a rough guess for the time of flight, as the transfer time guess will dictate which set of local solutions the algorithm could converge on. This robustness to initial guess is a compelling feature, as three-body orbit transfers are challenging to design with intuition alone. Of course, if a high-quality initial guess is available, the methods shown are still valid.We have shown that endpoints can be efficiently constrained to lie on 3-body repeating orbits, and that time of flight can be optimized as well. When optimizing the endpoints, we must make a trade between converging quickly on sub-optimal endpoints or converging more slowly on end-points that are arbitrarily close to optimal. It is easy for the mission design engineer to adjust this trade based on the problem at hand.The biggest limitation to the algorithm at this point is that multi-revolution transfers (greater than 2 revolutions) do not work nearly as well. This restriction comes in because the relationship between node 1 and node N becomes increasingly nonlinear as the angular distance grows. Trans-fers with more than about 1.5 complete revolutions generally require the line search to improve convergence. Future work includes: Comparison of this algorithm with other established tools; improvements to how multiple-revolution transfers are handled; parallelization of the Jacobian computation; in-creased efficiency for the line search; and optimization of many more trajectories between a variety of 3-body orbits.

Parrish, Nathan L.↗
NASA NTRS1988

Active control law synthesis for flexible aircraft

An application of an active control law synthesis procedure is presented, to meet multiple design requirements for a flexible aircraft modeled by a large order state space system. In this synthesis procedure, a linear quadratic Gaussian type cost function is minimized by updating the free parameters of the control law, while satisfying a set of constraints on the design loads, responses and stability margins. Analytical expressions for gradients of the cost function and the constraints, with respect to the control law design variables are used to facilitate rapid numerical convergence. These gradients can also be used for sensitivity study. A stable classical control law as well as an estimator-based full or reduced order control law can be modified, in order to meet individual root-mean-square response limitations as well as minimum singular value restrictions. Both analog and digital control laws can be optimized. Low order, robust control laws were synthesized for flutter suppression of a flexible aircraft.

Mukhopadhyay, V.↗
NASA NTRS1989

Digital robust control law synthesis using constrained optimization

Development of digital robust control laws for active control of high performance flexible aircraft and large space structures is a research area of significant practical importance. The flexible system is typically modeled by a large order state space system of equations in order to accurately represent the dynamics. The active control law must satisy multiple conflicting design requirements and maintain certain stability margins, yet should be simple enough to be implementable on an onboard digital computer. Described here is an application of a generic digital control law synthesis procedure for such a system, using optimal control theory and constrained optimization technique. A linear quadratic Gaussian type cost function is minimized by updating the free parameters of the digital control law, while trying to satisfy a set of constraints on the design loads, responses and stability margins. Analytical expressions for the gradients of the cost function and the constraints with respect to the control law design variables are used to facilitate rapid numerical convergence. These gradients can be used for sensitivity study and may be integrated into a simultaneous structure and control optimization scheme.

Mukhopadhyay, Vivekananda↗
NASA NTRS1986

Computational methods for optimal linear-quadratic compensators for infinite dimensional discrete-time systems

An abstract approximation theory and computational methods are developed for the determination of optimal linear-quadratic feedback control, observers and compensators for infinite dimensional discrete-time systems. Particular attention is paid to systems whose open-loop dynamics are described by semigroups of operators on Hilbert spaces. The approach taken is based on the finite dimensional approximation of the infinite dimensional operator Riccati equations which characterize the optimal feedback control and observer gains. Theoretical convergence results are presented and discussed. Numerical results for an example involving a heat equation with boundary control are presented and used to demonstrate the feasibility of the method.

Gibson, J. S.↗
NASA NTRSDate not supplied

FUN3D Analyses in Support of the 1st AIAA Stability and Control Prediction Workshop

The 1st AIAA Stability and Control Prediction Workshop was created to establish best practices for the prediction of stability & control derivatives using computational fluid dynamics and assess the limitations of these computational methods when those best practices are applied. The inaugural workshop considers the ONERA version of the NASA/Boeing Common Research Model(CRM), which includes the wing, body, horizontal tail, and a vertical tail designed by ONERA. Wind tunnel tests have been conducted for this configuration with longitudinal tests having been previously published, in addition to unpublished data at small sideslip angles that will serve as ‘blind’ data for workshop data comparisons. Participants were provided a ‘family’ of unstructured grids for the full-span ONERA CRM model with the wind-tunnel sting included. This family of mixed-element grids consists of 5 levels of refinement (tiny, coarse, medium, fine, and extra fine) with surface and volume mesh scaling, resulting in a size range of 14.6 to 53.4 million nodes. In addition, a medium refinement mesh has been provided for the ONERA CRM configuration without a sting to evaluate the sting’s impact on static longitudinal stability characteristics. In addition to these workshop-provided grids, the present work also considers an equivalent ‘family’ of computational grids generated using Heldenmesh™, a rapid grid generation software by Helden Aerospace Corporation for creating high-quality, three-dimensional, mixed-element unstructured meshes. Because of the authors’ familiarity with this software, these additional grids were generated as a comparison to the workshop-provided grids and to better understand the implications of using volume-mirrored grids for stability and control predictions. The present work will contribute to the workshop with test case data generated using the NASA FUN3D code, a parallelized, unstructured, node-based, finite-volume discretization, Reynolds-averaged Navier-Stokes flow solver. Numerical simulations will be conducted using the Quadratic Constitutive Relationship (QCR) version of the Spalart-Allmaras (SA) turbulence model with negative turbulence variable provisions. Both steady and2nd-order, time-accurate simulation results are to be generated and compared for select test cases, as time permits, to investigate their impact on FUN3D predictions. The present work will consider the three primary workshop test cases: (1) grid convergence study, (2) Mach number effect on static stability, and (3) wind tunnel sting increments. Additionally, data will be provided for the two optional test cases, which include:(1) static stability derivative calculations and (2)sideslip angle sweeps. In each of the test cases, the vehicle is stationary, and the body is assumed to be rigid, where vehicle deformation has been accounted for in the model configuration geometry. For all test cases, longitudinal and lateral force and moment aerodynamic coefficients will be provided for the total configuration, in addition to a component-level breakdown that includes the port wing, starboard wing, fuselage, and tail.

CFD↗
DOE OSTI2022

An ℓ 0 ℓ 2 -norm regularized regression model for construction of robust cluster expansions in multicomponent systems

In this work we introduce ℓ 0 ℓ 2 -norm regularization and hierarchy constraints into linear regression for the construction of cluster expansions to describe configurational disorder in materials. The approach is implemented through mixed integer quadratic programming (MIQP). The ℓ 2 -norm regularization is used to suppress intrinsic data noise, while the ℓ 0 -norm is used to penalize the number of nonzero elements in the solution. The hierarchy relation between clusters imposes relevant physics and is naturally included by the MIQP paradigm. As such, sparseness and cluster hierarchy can be well optimized to obtain a robust, converged set of effective cluster interactions with improved physical meaning. We demonstrate the effectiveness of ℓ 0 ℓ 2 -norm regularization in two high-component disordered rocksalt cathode material systems, where we compare the cross-validation, convergence speed, and the reproduction of phase diagrams, voltage profiles, and Li-occupancy energies with those of the conventional ℓ 1 -norm regularized cluster expansion models.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2021

An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods

A framework is proposed for solving general convex quadratic programs (CQPs) from an infeasible starting point by invoking an existing feasible-start algorithm tailored for inequality-constrained CQPs. The central tool is an exact penalty function scheme equipped with a penalty-parameter updating rule. The feasible-start algorithm merely has to satisfy certain general requirements, and so is the updating rule. Under mild assumptions, the framework is proved to converge on CQPs with both inequality and equality constraints and, at a negligible additional cost per iteration, produces an infeasibility certificate, together with a feasible point for an (approximately) ℓ 1 -least relaxed feasible problem, when the given problem does not have a feasible solution. The framework is applied to a feasible-start constraint-reduced interior-point algorithm previously proved to be highly performant on problems with many more inequality constraints than variables (“imbalanced”). Numerical comparison with popular codes (OSQP, qpOASES, MOSEK) is reported on both randomly generated problems and support-vector machine classifier training problems. The results show that the former typically outperforms the latter on imbalanced problems. Finally, application of the proposed infeasible-start framework to other feasible-start algorithms is briefly considered, and is tested on a simplex iteration.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1990

Factorization and the synthesis of optimal feedback gains for distributed parameter systems

An approach based on Volterra factorization leads to a new methodology for the analysis and synthesis of the optimal feedback gain in the finite-time linear quadratic control problem for distributed parameter systems. The approach circumvents the need for solving and analyzing Riccati equations and provides a more transparent connection between the system dynamics and the optimal gain. The general results are further extended and specialized for the case where the underlying state is characterized by autonomous differential-delay dynamics. Numerical examples are given to illustrate the second-order convergence rate that is derived for an approximation scheme for the optimal feedback gain in the differential-delay problem.

Milman, Mark H.↗
NASA NTRS1974

On the quadratic sampled-data regulator with unstable random disturbances

This paper is concerned with the design of a digital controller, optimizing a quadratic cost function, for a linear system subjected to plant disturbance. The disturbance is viewed as a Gaussian random process generated by a linear system which may be unstable. It is shown that the optimal control consists of the sum of two terms: the optimal control when no disturbance is present and a term depending on the estimates of the disturbance. Necessary and sufficient conditions for the convergence of the gain matrices is given.

Halyo, N.↗
NASA NTRS1988

Research on output feedback control

A summary is presented of the main results obtained during the course of research on output feedback control. The term output feedback is used to denote a controller design approach which does not rely on an observer to estimate the states of the system. Thus, the order of the controller is fixed, and can even be zero order, which amounts to constant gain ouput feedback. The emphasis has been on optimal output feedback. That is, a fixed order controller is designed based on minimizing a suitably chosen quadratic performance index. A number of problem areas that arise in this context have been addressed. These include developing suitable methods for selecting an index of performance, both time domain and frequency domain methods for achieving robustness of the closed loop system, developing canonical forms to achieve a minimal parameterization for the controller, two time scale design formulations for ill-conditioned systems, and the development of convergent numerical algorithms for solving the output feedback problem.

Calise, Anthony J.↗
DOE OSTI2023

Linear-in-temperature resistivity for optimally superconducting (Nd,Sr)NiO 2

The occurrence of superconductivity in proximity to various strongly correlated phases of matter has drawn extensive focus on their normal state properties, to develop an understanding of the state from which superconductivity emerges. The recent finding of superconductivity in layered nickelates raises similar interests. However, transport measurements of doped infinite-layer nickelate thin films have been hampered by materials limitations of these metastable compounds: in particular, a high density of extended defects. Here, by moving to a substrate (LaAlO 3 ) 0.3 (Sr 2 TaAlO 6 ) 0.7 that better stabilizes the growth and reduction conditions, we can synthesize the doping series of Nd 1– x Sr x NiO 2 essentially free from extended defects. In their absence, the normal state resistivity shows a low-temperature upturn in the underdoped regime, linear behaviour near optimal doping and quadratic temperature dependence for overdoping. This is phenomenologically similar to the copper oxides despite key distinctions—namely, the absence of an insulating parent compound, multiband electronic structure and a Mott–Hubbard orbital alignment rather than the charge-transfer insulator of the copper oxides. In this study, we further observe an enhancement of superconductivity, both in terms of transition temperature and range of doping. These results indicate a convergence in the electronic properties of both superconducting families as the scale of disorder in the nickelates is reduced.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2023

Causal explicit algorithm for heat conduction in a plasma

Hyperbolic heat conduction extends standard Spitzer-Harm heat conduction by including a term proportional to the time derivative of the heat flux. The new term arises from a kinetic derivation of the heat flux that includes higher order corrections. Here we present a causal explicit numerical algorithm for solving the nonlinear hyperbolic heat conduction equation in an unmagnetized plasma. The maximum stable timestep for the causal explicit algorithm scales linearly with the cell size, owing to the hyperbolic nature of the problem. This is in contrast to the quadratic scaling of the maximum stable timestep with the cell size for the parabolic forward time centered space algorithm. The favorable scaling of the timestep with the cell size enables a practical explicit implementation of heat conduction in high-performance massively parallel plasma codes. In particular, we have implemented the causal explicit algorithm in the laser plasma interaction code pF3D. We verify the CE algorithm and analyze its convergence rate by simulating a harmonic mode, which has an analytic solution within the context of the HHC model. We also compare simulations using the CE algorithm to those using the forward time centered space algorithm on a pair of test problems: evolution in time of a Gaussian temperature perturbation in a uniform plasma and heat transport in the presence of inverse bremsstrahlung heating by a Gaussian laser speckle.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
NASA NTRS2018

Use of Simple Continuum Solutions in Finite Element Alternating Method for Fracture Problems

The performance of the finite element alternating (FEAM) method for two-dimensional crack problems is studied with respect to a polynomial pressure distribution fitted to the crack face stresses. The FEAM alternates between the analytical solution of crack in an infinite plate subjected to arbitrary polynomial distribution and a finite element solution of an uncracked body to satisfy the required boundary conditions in the crack problem. In this paper, the FEAM is applied to embedded crack and edge crack problems. For embedded crack problems, all of the constant, linear, and quadratic ( N=0,1, or 2, respectively) pressure distributions yield very accurate results with this algorithm with 4 to 5 iterations. The edge crack problems, on the other hand, require much higher order polynomials distributions (N=5 to 6) to yield accurate solutions. For slant edge crack problems, the mode-I stress-intensity factors have better accuracy than the mode-II stress-intensity factors for the same convergence tolerance.

Krishnamurthy, T.↗