SEARCH · Engineering Papers

Results for “Infinite-dimensional optimization”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

49 records · Page 3

All sources NASA NTRS DOE OSTI

NASA NTRS1988

Infinite-dimensional approach to system identification of Space Control Laboratory Experiment (SCOLE)

The identification of a unique set of system parameters in large space structures poses a significant new problem in control technology. Presented is an infinite-dimensional identification scheme to determine system parameters in large flexible structures in space. The method retains the distributed nature of the structure throughout the development of the algorithm and a finite-element approximation is used only to implement the algorithm. This approach eliminates many problems associated with model truncation used in other methods of identification. The identification is formulated in Hilbert space and an optimal control technique is used to minimize weighted least squares of error between the actual and the model data. A variational approach is used to solve the problem. A costate equation, gradients of parameter variations and conditions for optimal estimates are obtained. Computer simulation studies are conducted using a shuttle-attached antenna configuration, more popularly known as the Space Control Laboratory Experiment (SCOLE) as an example. Numerical results show a close match between the estimated and true values of the parameters.

Hossain, S. A.↗

NASA NTRS1974

Optimal control problems with mixed control-phase variable equality and inequality constraints

In this paper, necessary conditions are obtained for optimal control problems containing equality constraints defined in terms of functions of the control and phase variables. The control system is assumed to be characterized by an ordinary differential equation, and more conventional constraints, including phase inequality constraints, are also assumed to be present. Because the first-mentioned equality constraint must be satisfied for all t (the independent variable of the differential equation) belonging to an arbitrary (prescribed) measurable set, this problem gives rise to infinite-dimensional equality constraints. To obtain the necessary conditions, which are in the form of a maximum principle, an implicit-function-type theorem in Banach spaces is derived.

Makowski, K.↗

DOE OSTI2021

Hamiltonian reduction of Vlasov–Maxwell to a dark slow manifold

In this work, we show that non-relativistic scaling of the collisionless Vlasov–Maxwell system implies the existence of a formal invariant slow manifold in the infinite-dimensional Vlasov–Maxwell phase space. Vlasov–Maxwell dynamics restricted to the slow manifold recovers the Vlasov–Poisson and Vlasov–Darwin models as low-order approximations, and provides higher-order corrections to the Vlasov–Darwin model more generally. The slow manifold may be interpreted to all orders in perturbation theory as a collection of formal Vlasov–Maxwell solutions that do not excite light waves, and are therefore ‘dark’. We provide a heuristic lower bound for the time interval over which Vlasov–Maxwell solutions initialized optimally near the slow manifold remain dark. We also show how the dynamics on the slow manifold naturally inherits a Hamiltonian structure from the underlying system. After expressing this structure in a simple form, we use it to identify a manifestly Hamiltonian correction to the Vlasov–Darwin model. The derivation of higher-order terms is reduced to computing the corrections of the system Hamiltonian restricted to the slow manifold.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

NASA NTRS1988

A Mathematical Formulation of the SCOLE Control Problem. Part 2: Optimal Compensator Design

The study initiated in Part 1 of this report is concluded and optimal feedback control (compensator) design for stability augmentation is considered, following the mathematical formulation developed in Part 1. Co-located (rate) sensors and (force and moment) actuators are assumed, and allowing for both sensor and actuator noise, stabilization is formulated as a stochastic regulator problem. Specializing the general theory developed by the author, a complete, closed form solution (believed to be new with this report) is obtained, taking advantage of the fact that the inherent structural damping is light. In particular, it is possible to solve in closed form the associated infinite-dimensional steady-state Riccati equations. The SCOLE model involves associated partial differential equations in a single space variable, but the compensator design theory developed is far more general since it is given in the abstract wave equation formulation. The results thus hold for any multibody system so long as the basic model is linear.

Balakrishnan, A. V.↗

DOE OSTI2022

Fed-DeepONet: Stochastic Gradient-Based Federated Training of Deep Operator Networks

The Deep Operator Network (DeepONet) framework is a different class of neural network architecture that one trains to learn nonlinear operators, i.e., mappings between infinite-dimensional spaces. Traditionally, DeepONets are trained using a centralized strategy that requires transferring the training data to a centralized location. Such a strategy, however, limits our ability to secure data privacy or use high-performance distributed/parallel computing platforms. To alleviate such limitations, in this paper, we study the federated training of DeepONets for the first time. That is, we develop a framework, which we refer to as Fed-DeepONet, that allows multiple clients to train DeepONets collaboratively under the coordination of a centralized server. To achieve Fed-DeepONets, we propose an efficient stochastic gradient-based algorithm that enables the distributed optimization of the DeepONet parameters by averaging first-order estimates of the DeepONet loss gradient. Then, to accelerate the training convergence of Fed-DeepONets, we propose a moment-enhanced (i.e., adaptive) stochastic gradient-based strategy. Finally, we verify the performance of Fed-DeepONet by learning, for different configurations of the number of clients and fractions of available clients, (i) the solution operator of a gravity pendulum and (ii) the dynamic response of a parametric library of pendulums.

Moya, Christian↗

NASA NTRS2022

Computing Sensitivities in Evolutionary Systems: A Real-time Reduced Order Modeling Strategy

We present a new methodology for computing sensitivities in evolutionary systems using a model-driven low-rank approximation. To this end, we formulate a variational principle that seeks to minimize the distance between the time derivative of the reduced approximation and sensitivity dynamics. The first order optimality condition of the variational principle leads to a system of closed form evolution equations for an orthonormal basis and corresponding sensitivity coefficients. This approach allows for the computation of sensitivities with respect to a large number of parameters in an accurate and tractable manner by extracting correlations between different sensitivities on the fly. The presented method requires solving forward evolution equations, sidestepping the restrictions imposed by the forward/backward workflow of adjoint sensitivities. For example, the presented method, unlike the adjoint equation, does not impose any input/output load and can be used in applications in which real-time sensitivities are of interest. We demonstrate the utility of the method for three test cases: (1) computing sensitivity with respect to model parameters in the Rössler system, (2) computing sensitivity with respect to an infinite-dimensional forcing parameter in the chaotic Kuramoto--Sivashinsky equation, and (3) computing sensitivity with respect to reaction parameters for species transport in a turbulent reacting flow.

Reduced order model↗

DOE OSTI2023

Scalable Bayesian optimization with randomized prior networks

Several fundamental problems in science and engineering consist of global optimization tasks involving unknown high-dimensional (black-box) functions that map a set of controllable variables to the outcomes of an expensive experiment. Bayesian Optimization (BO) techniques are known to be effective in tackling global optimization problems using a relatively small number objective function evaluations, but their performance suffers when dealing with high-dimensional outputs. To overcome the major challenge of dimensionality, here we propose a deep learning framework for BO and sequential decision making based on bootstrapped ensembles of neural architectures with randomized priors. Using appropriate architecture choices, we show that the proposed framework can approximate functional relationships between design variables and quantities of interest, even in cases where the latter take values in high-dimensional vector spaces or even infinite-dimensional function spaces. In the context of BO, we augmented the proposed probabilistic surrogates with re-parameterized Monte Carlo approximations of multiple-point (parallel) acquisition functions, as well as methodological extensions for accommodating black-box constraints and multi-fidelity information sources. We test the proposed framework against state-of-the-art methods for BO and demonstrate superior performance across several challenging tasks with high-dimensional outputs, including a constrained multi-fidelity optimization task involving shape optimization of rotor blades in turbo-machinery.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Interplay Between Time and Energy in Bosonic Noisy Quantum Metrology

Quantum entanglement and coherence often allow for protocols that outperform classical ones in estimating a system’s parameter. When using infinite-dimensional probes (such as a bosonic mode), one could, in principle, obtain infinite precision in a finite time for both classical and quantum protocols, which makes it hard to quantify potential quantum advantage. However, such a situation is unphysical, as it would require infinite resources, so one needs to impose some additional constraint: typically the average energy employed by the probe is finite. Here we treat both energy and time as a resource, showing that, in the presence of noise, there is a nontrivial interplay between the average energy and the time devoted to the estimation. Our results are valid for the most general metrological schemes (e.g., adaptive schemes, which may involve entanglement with external ancillae or any kind of continuous measurement). We apply recently derived precision bounds for all parameters characterizing the paradigmatic case of a bosonic mode, subject to Lindbladian noise. We show how the time employed in the estimation should be partitioned in order to achieve the best possible precision. In most cases, the optimal performance may be obtained without the necessity of adaptivity or entanglement with ancilla. We compare results with classical strategies. Interestingly, for temperature estimation, applying a fast-prepare-and-measure protocol with Fock states provides better scaling with the number of photons than any classical strategy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

NASA NTRS1988

Controller synthesis for infinite dimensional systems based on a passivity approach

The author discusses a generalization of hyperstability to systems in Hilbert space and its application to finite-dimensional stabilizing compensator design. The basic idea is to characterize tolerable perturbations in terms of the passivity of the nominal closed-loop system. Controllers achieving the required closed-loop passivity property can then be designed using H(infinity)-optimization. In particular, the author presents a design procedure for a stabilizing a finite-dimensional compensator for a given infinite-dimensional system.

Wen, John T.↗

NASA NTRS1989

Convergence of infinite dimensional sampled LQR problems - Theory and numerical results

A theory is developed for the convergence of the closed-loop solution to infinite-dimensional discrete-time linear-quadratic regulator (LQR) problems on the infinite time interval to the solution of a corresponding continuous-time LQR problem as the length of the sampling interval tends toward zero. Convergence of solutions to the operator algebraic Riccati equation and corresponding optimal feedback control gains is guaranteed under appropriate uniform stabilizability and detectability conditions and consistent sampling. Also presented are numerical results involving the optimal LQ control of a heat or diffusion equation, a hereditary or delay differential equation, and a hybrid system of ordinary and partial differential equations describing the transverse vibration of a cantilevered Voigt-Kelvin viscoelastic beam with tip mass.

Rosen, I. G.↗

NASA NTRS1991

A numerical algorithm for optimal feedback gains in high dimensional linear quadratic regulator problems

A hybrid method for computing the feedback gains in linear quadratic regulator problem is proposed. The method, which combines use of a Chandrasekhar type system with an iteration of the Newton-Kleinman form with variable acceleration parameter Smith schemes, is formulated to efficiently compute directly the feedback gains rather than solutions of an associated Riccati equation. The hybrid method is particularly appropriate when used with large dimensional systems such as those arising in approximating infinite-dimensional (distributed parameter) control systems (e.g., those governed by delay-differential and partial differential equations). Computational advantages of the proposed algorithm over the standard eigenvector (Potter, Laub-Schur) based techniques are discussed, and numerical evidence of the efficacy of these ideas is presented.

Banks, H. T.↗

NASA NTRS1992

Inference in infinite-dimensional inverse problems - Discretization and duality

Many techniques for solving inverse problems involve approximating the unknown model, a function, by a finite-dimensional 'discretization' or parametric representation. The uncertainty in the computed solution is sometimes taken to be the uncertainty within the parametrization; this can result in unwarranted confidence. The theory of conjugate duality can overcome the limitations of discretization within the 'strict bounds' formalism, a technique for constructing confidence intervals for functionals of the unknown model incorporating certain types of prior information. The usual computational approach to strict bounds approximates the 'primal' problem in a way that the resulting confidence intervals are at most long enough to have the nominal coverage probability. There is another approach based on 'dual' optimization problems that gives confidence intervals with at least the nominal coverage probability. The pair of intervals derived by the two approaches bracket a correct confidence interval. The theory is illustrated with gravimetric, seismic, geomagnetic, and helioseismic problems and a numerical example in seismology.

Stark, Philip B.↗

DOE OSTI2026

Exact Fock-State Preparation with $n^{1/4}$ Circuit Depth

Efficient, deterministic, and high-fidelity preparation of large Fock states is essential for scaling bosonic quantum technologies and exploring quantum phenomena at large excitation energies. We introduce a deterministic one-parameter (D1p) protocol that maps Fock-state preparation in an infinite-dimensional Hilbert space onto two-dimensional amplitude amplification. Starting from a coherent state with $|α|\simeq\sqrt{n}$, the initial target-state population scales as $n^{-1/2}$, yielding an iteration count and circuit depth of $\mathcal{O}(n^{1/4})$. Phase matching guarantees unit fidelity in the ideal model; remarkably, preparing $|{10^6}\rangle$ requires only 39 iterations. The protocol uses only displacements and number-selective phase operations, requires no numerical optimization, and further extends to state transfer, general superpositions, finite-dimensional systems, and multipartite entangled states. In the large-amplitude regime, its multi-target form prepares $L$-legged cat states with an iteration count determined only by $L$; cats with up to ten legs require only two iterations, independent of the coherent-state amplitude. This framework provides a broadly applicable route to highly excited bosonic states on platforms supporting these elementary controls.

Roy, Tanay [Fermilab] (ORCID:000000019442862X)↗