24 results on '"Sandu, Adrian"'
Search Results
2. Total Energy Singular Vectors for Atmospheric Chemical Transport Models
- Author
-
Liao, Wenyuan, Sandu, Adrian, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Sunderam, Vaidy S., editor, van Albada, Geert Dick, editor, Sloot, Peter M. A., editor, and Dongarra, Jack J., editor
- Published
- 2005
- Full Text
- View/download PDF
3. Efficient methods for computing observation impact in 4D-Var data assimilation
- Author
-
Cioaca, Alexandru, Sandu, Adrian, and de Sturler, Eric
- Published
- 2013
- Full Text
- View/download PDF
4. Computational challenges of modelling interactions between aerosol and gas phase processes in large‐scale air pollution models
- Author
-
Carmichael, Gregory R., Sandu, Adrian, Song, Chul H., He, Shan, Phadnis, Mahesh J., Daescu, Dacian, Damian‐Iordache, Valeriu, and Potra, Florian A.
- Published
- 1999
- Full Text
- View/download PDF
5. Adjoint sensitivity index-3 augmented Lagrangian formulation with projections.
- Author
-
Dopico, Daniel, Sandu, Adrian, and Sandu, Corina
- Subjects
- *
MULTIBODY systems , *ADJOINT differential equations - Abstract
The interest on closed-form analytical sensitivity equations based on the classical forward dynamics formulations, started shortly after the equations were ready and became popular. A vast effort was devoted by the authors in the last years to derive the forward and adjoint sensitivity equations for some state-of-the-art formulations of practical interest. Recently, the forward sensitivity equations for the index-3 augmented Lagrangian formulation with projections (the ALI3-P formulation) have been derived. In this article, the ALI3-P adjoint sensitivity equations are derived and implemented in the MBSLIM library as a general code and tested in one academic example and one real-life multibody system. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
6. An optimization framework to improve 4D-Var data assimilation system performance.
- Author
-
Cioaca, Alexandru and Sandu, Adrian
- Subjects
- *
MATHEMATICAL optimization , *PARAMETER estimation , *SENSITIVITY analysis , *ITERATIVE methods (Mathematics) , *COEFFICIENTS (Statistics) - Abstract
This paper develops a computational framework for optimizing the parameters of data assimilation systems in order to improve their performance. The approach formulates a continuous meta-optimization problem for parameters; the meta-optimization is constrained by the original data assimilation problem. The numerical solution process employs adjoint models and iterative solvers. The proposed framework is applied to optimize observation values, data weighting coefficients, and the location of sensors for a test problem. The ability to optimize a distributed measurement network is crucial for cutting down operating costs and detecting malfunctions. [ABSTRACT FROM AUTHOR]
- Published
- 2014
- Full Text
- View/download PDF
7. FATODE: A LIBRARY FOR FORWARD, ADJOINT, AND TANGENT LINEAR INTEGRATION OF ODES.
- Author
-
HONG ZHANG and SANDU, ADRIAN
- Subjects
- *
FORTRAN , *ORDINARY differential equations , *SENSITIVITY analysis , *RUNGE-Kutta formulas , *STIFF computation (Differential equations) , *LINEAR statistical models , *LINEAR algebra - Abstract
Fatode is a Fortran library for the integration of ordinary differential equations with direct and adjoint sensitivity analysis capabilities. The paper describes the capabilities, implementation, code organization, and usage of this package. Fatode implements four families of methods: explicit Runge-Kutta for nonstiff problems, fully implicit Runge--Kutta, singly diagonally implicit Runge--Kutta, and Rosenbrock for stiff problems. Each family contains several methods with different orders of accuracy; users can add new methods by simply providing their coefficients. For each family the forward, adjoint, and tangent linear models are implemented. General purpose solvers for dense and sparse linear algebra are used; users can easily incorporate problem-tailored linear algebra routines. The performance of the package is demonstrated on several test problems. To the best of our knowledge Fatode is the first publicly available general purpose package that offers forward and adjoint sensitivity analysis capabilities in the context of Runge--Kutta methods. A wide range of applications is expected to benefit from its use; examples include parameter estimation, data assimilation, optimal control, and uncertainty quantification. [ABSTRACT FROM AUTHOR]
- Published
- 2014
- Full Text
- View/download PDF
8. A Posteriori Error Estimates for DDDAS Inference Problems.
- Author
-
Rao, Vishwas and Sandu, Adrian
- Subjects
ERROR analysis in mathematics ,ESTIMATION theory ,MATHEMATICAL statistics ,PROBLEM solving ,UNCERTAINTY ,ORDINARY differential equations - Abstract
Abstract: Inference problems in dynamically data-driven application systems use physical measurements along with a physical model to estimate the parameters or state of a physical system. Errors in measurements and uncertainties in the model lead to inaccurate inference results. This work develops a methodology to estimate the impact of various errors on the variational solution of a DDDAS inference problem. The methodology is based on models described by ordinary differential equations, and use first-order and second-order adjoint methodologies. Numerical experiments with the heat equation illustrate the use of the proposed error estimation machin- ery. [Copyright &y& Elsevier]
- Published
- 2014
- Full Text
- View/download PDF
9. Second-order adjoints for solving PDE-constrained optimization problems.
- Author
-
Cioaca, Alexandru, Alexe, Mihai, and Sandu, Adrian
- Subjects
INVERSE problems ,STIFF computation (Differential equations) ,MATHEMATICAL optimization ,SENSITIVITY analysis ,NUMERICAL solutions to partial differential equations ,CONSTRAINT satisfaction ,NONLINEAR systems - Abstract
Inverse problems are of the utmost importance in many fields of science and engineering. In the variational approach, inverse problems are formulated as partial differential equation-constrained optimization problems, where the optimal estimate of the uncertain parameters is the minimizer of a certain cost functional subject to the constraints posed by the model equations. The numerical solution of such optimization problems requires the computation of derivatives of the model output with respect to model parameters. The first-order derivatives of a cost functional (defined on the model output) with respect to a large number of model parameters can be calculated efficiently through first-order adjoint (FOA) sensitivity analysis. Second-order adjoint (SOA) models give second derivative information in the form of matrix–vector products between the Hessian of the cost functional and user-defined vectors. Traditionally, the construction of second-order derivatives for large-scale models has been considered too costly. Consequently, data assimilation applications employ optimization algorithms that use only first-order derivative information, such as nonlinear conjugate gradients and quasi-Newton methods. In this paper, we discuss the mathematical foundations of SOA sensitivity analysis and show that it provides an efficient approach to obtain Hessian-vector products. We study the benefits of using second-order information in the numerical optimization process for data assimilation applications. The numerical studies are performed in a twin experiment setting with a two-dimensional shallow water model. Different scenarios are considered with different discretization approaches, observation sets, and noise levels. Optimization algorithms that employ second-order derivatives are tested against widely used methods that require only first-order derivatives. Conclusions are drawn regarding the potential benefits and the limitations of using high-order information in large-scale data assimilation problems. [ABSTRACT FROM PUBLISHER]
- Published
- 2012
- Full Text
- View/download PDF
10. An Adjoint Based Implementation of the Parareal Algorithm.
- Author
-
Rao, Vishwas and Sandu, Adrian
- Subjects
PARALLEL algorithms ,NUMERICAL solutions to differential equations ,APPROXIMATION theory ,ALGORITHMS ,MATHEMATICAL optimization ,INTERVAL analysis - Abstract
Abstract: This paper presents a new ‘Parareal-algorithm’ to solve time-dependent ODEs parallel in time. The algorithm approximates the solutions later in time simultaneously with the solutions earlier in time. To approximate the solutions simultaneously, an optimization problem is constructed and solved using gradient based techniques. The accurate gradients are evaluated using adjoints. Promising results are obtained when the interval of interest is split into suffciently small subintervals. [Copyright &y& Elsevier]
- Published
- 2012
- Full Text
- View/download PDF
11. Forward, tangent linear, and adjoint Runge-Kutta methods for stiff chemical kinetic simulations.
- Author
-
Sandu, Adrian and Miehe, Philipp
- Subjects
- *
SIMULATION methods & models , *RUNGE-Kutta formulas , *SENSITIVITY analysis , *JACOBIAN matrices , *CHEMICAL systems , *ATMOSPHERIC chemistry , *INTEGRATORS - Abstract
This paper investigates numerical methods for direct decoupled sensitivity and discrete adjoint sensitivity analysis of stiff systems based on implicit Runge-Kutta schemes. Efficient implementations of tangent linear and adjoint schemes are discussed for two families of methods: fully implicit three-stage Runge-Kutta and singly diagonally-implicit Runge-Kutta. High computational efficiency is attained by exploiting the sparsity patterns of the Jacobian and Hessian. Numerical experiments with a large chemical system used in atmospheric chemistry illustrate the power of the stiff Runge-Kutta integrators and their tangent linear and discrete adjoint models. Through the integration with the Kinetic PreProcessor KPP-2.2 these numerical techniques become readily available to a wide community interested in the simulation of chemical kinetic systems. [ABSTRACT FROM AUTHOR]
- Published
- 2010
- Full Text
- View/download PDF
12. Forward and adjoint sensitivity analysis with continuous explicit Runge–Kutta schemes
- Author
-
Alexe, Mihai and Sandu, Adrian
- Subjects
- *
RUNGE-Kutta formulas , *MATHEMATICAL models , *NONLINEAR theories , *NUMERICAL solutions to differential equations , *INTERPOLATION , *INVERSE problems - Abstract
Abstract: We study the numerical solution of tangent linear, first and second order adjoint models with high-order explicit, continuous Runge–Kutta pairs. The approaches currently implemented in popular packages such as SUNDIALS or DASPKADJOINT are based on linear multistep methods. For adaptive time integration of nonlinear models, interpolation of the forward model solution is required during the adjoint model simulation. We propose to use the dense output mechanism built in the continuous Runge–Kutta schemes as a highly accurate and cost-efficient interpolation method in the inverse problem run. We implement our approach in a Fortran library called DENSERKS, which is found to compare well to other similar software on a number of test problems. [Copyright &y& Elsevier]
- Published
- 2009
- Full Text
- View/download PDF
13. Discrete second order adjoints in atmospheric chemical transport modeling
- Author
-
Sandu, Adrian and Zhang, Lin
- Subjects
- *
MATHEMATICAL optimization , *ATMOSPHERIC chemistry , *CONTINGENT valuation , *AIR pollution forecasting - Abstract
Abstract: Atmospheric chemical transport models (CTMs) are essential tools for the study of air pollution, for environmental policy decisions, for the interpretation of observational data, and for producing air quality forecasts. Many air quality studies require sensitivity analyses, i.e., the computation of derivatives of the model output with respect to model parameters. The derivatives of a cost functional (defined on the model output) with respect to a large number of model parameters can be calculated efficiently through adjoint sensitivity analysis. While the traditional (first order) adjoint models give the gradient of the cost functional with respect to parameters, second order adjoint models give second derivative information in the form of products between the Hessian of the cost functional and a vector (representing a perturbation in sensitivity analysis, a search direction in optimization, an eigenvector, etc.). In this paper we discuss the mathematical foundations of the discrete second order adjoint sensitivity method and present a complete set of computational tools for performing second order sensitivity studies in three-dimensional atmospheric CTMs. The tools include discrete second order adjoints of Runge–Kutta and of Rosenbrock time stepping methods for stiff equations together with efficient implementation strategies. Numerical examples illustrate the use of these computational tools in important applications like sensitivity analysis, optimization, uncertainty quantification and the calculation of directions of maximal error growth in three-dimensional atmospheric CTMs. [Copyright &y& Elsevier]
- Published
- 2008
- Full Text
- View/download PDF
14. Adjoint sensitivity analysis of regional air quality models
- Author
-
Sandu, Adrian, Daescu, Dacian N., Carmichael, Gregory R., and Chai, Tianfeng
- Subjects
- *
AIR quality , *AIR pollution , *ATMOSPHERIC deposition , *INDUSTRIAL contamination - Abstract
Abstract: The task of providing an optimal analysis of the state of the atmosphere requires the development of efficient computational tools that facilitate an efficient integration of observational data into models. In a variational approach the data assimilation problem is posed as a minimization problem, which requires the sensitivity (derivatives) of a cost functional with respect to problem parameters. The direct decoupled method has been extensively applied for sensitivity studies of air pollution. Adjoint sensitivity is a complementary approach which efficiently calculates the derivatives of a functional with respect to a large number of parameters. In this paper, we discuss the mathematical foundations of the adjoint sensitivity method applied to air pollution models, and present a complete set of computational tools for performing three-dimensional adjoint sensitivity studies. Numerical examples show that three-dimensional adjoint sensitivity analysis provides information on influence areas, which cannot be obtained solely by an inverse analysis of the meteorological fields. Several illustrative data assimilation results in a twin experiments framework, as well as the assimilation of a real data set are also presented. [Copyright &y& Elsevier]
- Published
- 2005
- Full Text
- View/download PDF
15. Direct and adjoint sensitivity analysis of chemical kinetic systems with KPP: II—numerical validation and applications
- Author
-
Daescu, Dacian N., Sandu, Adrian, and Carmichael, Gregory R.
- Subjects
- *
CHEMICAL kinetics , *ANXIETY sensitivity , *DYNAMICS - Abstract
The Kinetic PreProcessor KPP was extended to generate the building blocks needed for the direct and adjoint sensitivity analysis of chemical kinetic systems. An overview of the theoretical aspects of sensitivity calculations and a discussion of the KPP software tools is presented in the companion paper.In this work the correctness and efficiency of the KPP generated code for direct and adjoint sensitivity studies are analyzed through an extensive set of numerical experiments. Direct-decoupled Rosenbrock methods are shown to be cost-effective for providing sensitivities at low and medium accuracies. A validation of the discrete–adjoint evaluated gradients is performed against the finite difference estimates. The accuracy of the adjoint gradients is measured using a reference gradient value obtained with a standard direct-decoupled method. The accuracy is studied for both constant step size and variable step size integration of the forward/adjoint model and the consistency between the discrete and continuous adjoint models is analyzed.Applications of the KPP-1.2 software package to direct and adjoint sensitivity studies, variational data assimilation, and parameter identification are considered for the comprehensive chemical mechanism SAPRC-99. [Copyright &y& Elsevier]
- Published
- 2003
- Full Text
- View/download PDF
16. Direct and adjoint sensitivity analysis of chemical kinetic systems with KPP: Part I—theory and software tools
- Author
-
Sandu, Adrian, Daescu, Dacian N., and Carmichael, Gregory R.
- Subjects
- *
CHEMICAL reactions , *DYNAMICS , *JACOBIAN matrices - Abstract
The analysis of comprehensive chemical reactions mechanisms, parameter estimation techniques, and variational chemical data assimilation applications require the development of efficient sensitivity methods for chemical kinetics systems. The new release (KPP-1.2) of the kinetic preprocessor (KPP) contains software tools that facilitate direct and adjoint sensitivity analysis. The direct-decoupled method, built using BDF formulas, has been the method of choice for direct sensitivity studies. In this work, we extend the direct-decoupled approach to Rosenbrock stiff integration methods. The need for Jacobian derivatives prevented Rosenbrock methods to be used extensively in direct sensitivity calculations; however, the new automatic and symbolic differentiation technologies make the computation of these derivatives feasible. The direct-decoupled method is known to be efficient for computing the sensitivities of a large number of output parameters with respect to a small number of input parameters. The adjoint modeling is presented as an efficient tool to evaluate the sensitivity of a scalar response function with respect to the initial conditions and model parameters. In addition, sensitivity with respect to time-dependent model parameters may be obtained through a single backward integration of the adjoint model. KPP software may be used to completely generate the continuous and discrete adjoint models taking full advantage of the sparsity of the chemical mechanism. Flexible direct-decoupled and adjoint sensitivity code implementations are achieved with minimal user intervention. In a companion paper, we present an extensive set of numerical experiments that validate the KPP software tools for several direct/adjoint sensitivity applications, and demonstrate the efficiency of KPP-generated sensitivity code implementations. [Copyright &y& Elsevier]
- Published
- 2003
- Full Text
- View/download PDF
17. An adjoint-based scalable algorithm for time-parallel integration.
- Author
-
Rao, Vishwas and Sandu, Adrian
- Subjects
COMPUTER algorithms ,PARALLEL computers ,COMPUTATIONAL complexity ,ITERATIVE methods (Mathematics) ,CROSS product (Mathematics) ,HESSIAN matrices - Abstract
Highlights: [•] This paper presents a new parallel in time discretization algorithm based on a nonlinear optimization approach. [•] The objective cost function quantifies the mismatch of local solutions between adjacent subintervals. [•] The optimization problem is solved iteratively using gradient-based methods. [•] All the computational steps – forward solutions, gradients, and Hessian-vector products – involve only ideally parallel computations and therefore are highly scalable. [Copyright &y& Elsevier]
- Published
- 2014
- Full Text
- View/download PDF
18. MATLODE: A MATLAB ODE Solver and Sensitivity Analysis Toolbox
- Author
-
D'Augustine, Anthony Frank, Computer Science, Sandu, Adrian, Zietsman, Lizette, and Cao, Yang
- Subjects
ODE Solver ,Sensitivity Analysis ,Adjoint Model ,Tangent Linear Model ,Software - Abstract
Sensitivity analysis quantifies the effect that of perturbations of the model inputs have on the model's outputs. Some of the key insights gained using sensitivity analysis are to understand the robustness of the model with respect to perturbations, and to select the most important parameters for the model. MATLODE is a tool for sensitivity analysis of models described by ordinary differential equations (ODEs). MATLODE implements two distinct approaches for sensitivity analysis: direct (via the tangent linear model) and adjoint. Within each approach, four families of numerical methods are implemented, namely explicit Runge-Kutta, implicit Runge-Kutta, Rosenbrock, and single diagonally implicit Runge-Kutta. Each approach and family has its own strengths and weaknesses when applied to real world problems. MATLODE has a multitude of options that allows users to find the best approach for a wide range of initial value problems. In spite of the great importance of sensitivity analysis for models governed by differential equations, until this work there was no MATLAB ordinary differential equation sensitivity analysis toolbox publicly available. The two most popular sensitivity analysis packages, CVODES [8] and FATODE [10], are geared toward the high performance modeling space; however, no native MATLAB toolbox was available. MATLODE fills this need and offers sensitivity analysis capabilities in MATLAB, one of the most popular programming languages within scientific communities such as chemistry, biology, ecology, and oceanogra- phy. We expect that MATLODE will prove to be a useful tool for these communities to help facilitate their research and fill the gap between theory and practice. Master of Science
- Published
- 2018
19. Modeling, Sensitivity Analysis, and Optimization of Hybrid, Constrained Mechanical Systems
- Author
-
Corner, Sebastien Marc, Mechanical Engineering, Sandu, Corina, Sandu, Adrian, Asbeck, Alan T., Ben-Tzvi, Pinhas, and Kurdila, Andrew J.
- Subjects
Constrained systems ,Hybrid systems ,Sensitivity analysis - Abstract
This dissertation provides a complete mathematical framework to compute the sensitivities with respect to system parameters for any second order hybrid Ordinary Differential Equation (ODE) and rank 1 and 3 Differential Algebraic Equation (DAE) systems. The hybrid system is characterized by discontinuities in the velocity state variables due to an impulsive forces at the time of event. At the time of event, such system may also exhibit a change in the equations of motion or in the kinematic constraints. The analytical methodology that solves the sensitivities for hybrid systems is structured based on jumping conditions for both, the velocity state variables and the sensitivities matrix. The proposed analytical approach is then benchmarked against a known numerical method. The mathematical framework is extended to compute sensitivities of the states of the model and of the general cost functionals with respect to model parameters for both, unconstrained and constrained, hybrid mechanical systems. This dissertation emphasizes the penalty formulation for modeling constrained mechanical systems since this formalism has the advantage that it incorporates the kinematic constraints inside the equation of motion, thus easing the numerical integration, works well with redundant constraints, and avoids kinematic bifurcations. In addition, this dissertation provides a unified mathematical framework for performing the direct and the adjoint sensitivity analysis for general hybrid systems associated with general cost functions. The mathematical framework computes the jump sensitivity matrix of the direct sensitivities which is found by computing the Jacobian of the jump conditions with respect to sensitivities right before the event. The main idea is then to obtain the transpose of the jump sensitivity matrix to compute the jump conditions for the adjoint sensitivities. Finally, the methodology developed obtains the sensitivity matrix of cost functions with respect to parameters for general hybrid ODE systems. Such matrix is a key result for design analysis as it provides the parameters that affect the given cost functions the most. Such results could be applied to gradient based algorithms, control optimization, implicit time integration methods, deep learning, etc. Ph. D.
- Published
- 2018
20. Adjoint based solution and uncertainty quantification techniques for variational inverse problems
- Author
-
Hebbur Venkata Subba Rao, Vishwas, Computer Science, Sandu, Adrian, Ribbens, Calvin J., Constantinescu, Emil Mihai, de Sturler, Eric, and Cao, Yang
- Subjects
Inverse problems ,sensitivity analysis ,Data assimilation - Abstract
Variational inverse problems integrate computational simulations of physical phenomena with physical measurements in an informational feedback control system. Control parameters of the computational model are optimized such that the simulation results fit the physical measurements.The solution procedure is computationally expensive since it involves running the simulation computer model (the emph{forward model}) and the associated emph {adjoint model} multiple times. In practice, our knowledge of the underlying physics is incomplete and hence the associated computer model is laden with emph {model errors}. Similarly, it is not possible to measure the physical quantities exactly and hence the measurements are associated with emph {data errors}. The errors in data and model adversely affect the inference solutions. This work develops methods to address the challenges posed by the computational costs and by the impact of data and model errors in solving variational inverse problems. Variational inverse problems of interest here are formulated as optimization problems constrained by partial differential equations (PDEs). The solution process requires multiple evaluations of the constraints, therefore multiple solutions of the associated PDE. To alleviate the computational costs we develop a parallel in time discretization algorithm based on a nonlinear optimization approach. Like in the emph{parareal} approach, the time interval is partitioned into subintervals, and local time integrations are carried out in parallel. Solution continuity equations across interval boundaries are added as constraints. All the computational steps - forward solutions, gradients, and Hessian-vector products - involve only ideally parallel computations and therefore are highly scalable. This work develops a systematic mathematical framework to compute the impact of data and model errors on the solution to the variational inverse problems. The computational algorithm makes use of first and second order adjoints and provides an a-posteriori error estimate for a quantity of interest defined on the inverse solution (i.e., an aspect of the inverse solution). We illustrate the estimation algorithm on a shallow water model and on the Weather Research and Forecast model. Presence of outliers in measurement data is common, and this negatively impacts the solution to variational inverse problems. The traditional approach, where the inverse problem is formulated as a minimization problem in $L_2$ norm, is especially sensitive to large data errors. To alleviate the impact of data outliers we propose to use robust norms such as the $L_1$ and Huber norm in data assimilation. This work develops a systematic mathematical framework to perform three and four dimensional variational data assimilation using $L_1$ and Huber norms. The power of this approach is demonstrated by solving data assimilation problems where measurements contain outliers. Ph. D.
- Published
- 2015
21. Sensitivity Analysis and Optimization of Multibody Systems
- Author
-
Zhu, Yitao, Mechanical Engineering, Sandu, Adrian, Sandu, Corina, Southward, Steve C., Dopico Dopico, Daniel, and Bohn, Jan Helge
- Subjects
Optimization ,Sensitivity Analysis ,Multibody Dynamics ,Vehicle Dynamics - Abstract
Multibody dynamics simulations are currently widely accepted as valuable means for dynamic performance analysis of mechanical systems. The evolution of theoretical and computational aspects of the multibody dynamics discipline make it conducive these days for other types of applications, in addition to pure simulations. One very important such application is design optimization for multibody systems. Sensitivity analysis of multibody system dynamics, which is performed before optimization or in parallel, is essential for optimization. Current sensitivity approaches have limitations in terms of efficiently performing sensitivity analysis for complex systems with respect to multiple design parameters. Thus, we bring new contributions to the state-of-the-art in analytical sensitivity approaches in this study. A direct differentiation method is developed for multibody dynamic models that employ Maggi's formulation. An adjoint variable method is developed for explicit and implicit first order Maggi's formulations, second order Maggi's formulation, and first and second order penalty formulations. The resulting sensitivities are employed to perform optimization of different multibody systems case studies. The collection of benchmark problems includes a five-bar mechanism, a full vehicle model, and a passive dynamic robot. The five-bar mechanism is used to test and validate the sensitivity approaches derived in this paper by comparing them with other sensitivity approaches. The full vehicle system is used to demonstrate the capability of the adjoint variable method based on the penalty formulation to perform sensitivity analysis and optimization for large and complex multibody systems with respect to multiple design parameters with high efficiency. In addition, a new multibody dynamics software library MBSVT (Multibody Systems at Virginia Tech) is developed in Fortran 2003, with forward kinematics and dynamics, sensitivity analysis, and optimization capabilities. Several different contact and friction models, which can be used to model point contact and surface contact, are developed and included in MBSVT. Finally, this study employs reference point coordinates and the penalty formulation to perform dynamic analysis for the passive dynamic robot, simplifying the modeling stage and making the robotic system more stable. The passive dynamic robot is also used to test and validate all the point contact and surface contact models developed in MBSVT. Ph. D.
- Published
- 2015
22. Efficient Time Stepping Methods and Sensitivity Analysis for Large Scale Systems of Differential Equations
- Author
-
Zhang, Hong, Computer Science, Sandu, Adrian, Cao, Yang, Spiteri, Raymond John, Lin, Tao, Ribbens, Calvin J., and Iliescu, Traian
- Subjects
Sensitivity Analysis ,Time Stepping ,Implicit-explicit ,General Linear Methods - Abstract
Many fields in science and engineering require large-scale numerical simulations of complex systems described by differential equations. These systems are typically multi-physics (they are driven by multiple interacting physical processes) and multiscale (the dynamics takes place on vastly different spatial and temporal scales). Numerical solution of such systems is highly challenging due to the dimension of the resulting discrete problem, and to the complexity that comes from incorporating multiple interacting components with different characteristics. The main contributions of this dissertation are the creation of new families of time integration methods for multiscale and multiphysics simulations, and the development of industrial-strengh tools for sensitivity analysis. This work develops novel implicit-explicit (IMEX) general linear time integration methods for multiphysics and multiscale simulations typically involving both stiff and non-stiff components. In an IMEX approach, one uses an implicit scheme for the stiff components and an explicit scheme for the non-stiff components such that the combined method has the desired stability and accuracy properties. Practical schemes with favorable properties, such as maximized stability, high efficiency, and no order reduction, are constructed and applied in extensive numerical experiments to validate the theoretical findings and to demonstrate their advantages. Approximate matrix factorization (AMF) technique exploits the structure of the Jacobian of the implicit parts, which may lead to further efficiency improvement of IMEX schemes. We have explored the application of AMF within some high order IMEX Runge-Kutta schemes in order to achieve high efficiency. Sensitivity analysis gives quantitative information about the changes in a dynamical model outputs caused by caused by small changes in the model inputs. This information is crucial for data assimilation, model-constrained optimization, inverse problems, and uncertainty quantification. We develop a high performance software package for sensitivity analysis in the context of stiff and nonstiff ordinary differential equations. Efficiency is demonstrated by direct comparisons against existing state-of-art software on a variety of test problems. Ph. D.
- Published
- 2014
23. A Computational Framework for Assessing and Optimizing the Performance of Observational Networks in 4D-Var Data Assimilation
- Author
-
Cioaca, Alexandru, Computer Science, Sandu, Adrian, Shaffer, Clifford A., Ribbens, Calvin J., de Sturler, Eric, and Iliescu, Traian
- Subjects
dynamic data-driven problem ,sensitivity analysis ,uncertainty quantification ,inverse problems ,second-order adjoints ,sensor placement ,truncated singular value decomposition ,parameter estimation ,data assimilation ,adaptive observations ,intelligent sensors ,nonlinear optimization ,matrix-free linear solvers - Abstract
A deep scientific understanding of complex physical systems, such as the atmosphere, can be achieved neither by direct measurements nor by numerical simulations alone. Data assimilation is a rigorous procedure to fuse information from a priori knowledge of the system state, the physical laws governing the evolution of the system, and real measurements, all with associated error statistics. Data assimilation produces best (a posteriori) estimates of model states and parameter values, and results in considerably improved computer simulations. The acquisition and use of observations in data assimilation raises several important scientific questions related to optimal sensor network design, quantification of data impact, pruning redundant data, and identifying the most beneficial additional observations. These questions originate in operational data assimilation practice, and have started to attract considerable interest in the recent past. This dissertation advances the state of knowledge in four dimensional variational (4D-Var) - data assimilation by developing, implementing, and validating a novel computational framework for estimating observation impact and for optimizing sensor networks. The framework builds on the powerful methodologies of second-order adjoint modeling and the 4D-Var sensitivity equations. Efficient computational approaches for quantifying the observation impact include matrix free linear algebra algorithms and low-rank approximations of the sensitivities to observations. The sensor network configuration problem is formulated as a meta-optimization problem. Best values for parameters such as sensor location are obtained by optimizing a performance criterion, subject to the constraint posed by the 4D-Var optimization. Tractable computational solutions to this "optimization-constrained" optimization problem are provided. The results of this work can be directly applied to the deployment of intelligent sensors and adaptive observations, as well as to reducing the operating costs of measuring networks, while preserving their ability to capture the essential features of the system under consideration. Ph. D.
- Published
- 2013
24. Large-Scale Simulations Using First and Second Order Adjoints with Applications in Data Assimilation
- Author
-
Zhang, Lin, Computer Science, Sandu, Adrian, Ribbens, Calvin J., Borggaard, Jeffrey T., and Cao, Yang
- Subjects
Optimization ,Sensitivity Analysis ,Second Order Adjoints ,4D-Var Data Assimilation - Abstract
In large-scale air quality simulations we are interested in the influence factors which cause changes of pollutants, and optimization methods which improve forecasts. The solutions to these problems can be achieved by incorporating adjoint models, which are efficient in computing the derivatives of a functional with respect to a large number of model parameters. In this research we employ first order adjoints in air quality simulations. Moreover, we explore theoretically the computation of second order adjoints for chemical transport models, and illustrate their feasibility in several aspects. We apply first order adjoints to sensitivity analysis and data assimilation. Through sensitivity analysis, we can discover the area that has the largest influence on changes of ozone concentrations at a receptor. For data assimilation with optimization methods which use first order adjoints, we assess their performance under different scenarios. The results indicate that the L-BFGS method is the most efficient. Compared with first order adjoints, second order adjoints have not been used to date in air quality simulation. To explore their utility, we show the construction of second order adjoints for chemical transport models and demonstrate several applications including sensitivity analysis, optimization, uncertainty quantification, and Hessian singular vectors. Since second order adjoints provide second order information in the form of Hessian-vector product instead of the entire Hessian matrix, it is possible to implement applications for large-scale models which require second order derivatives. Finally, we conclude that second order adjoints for chemical transport models are computationally feasible and effective. Master of Science
- Published
- 2007
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.