اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMode-based derivation of adjoint equations - a lazy mans approach
103
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
A method to calculate the adjoint solution for a large class of partial differential equations is discussed. It differs from the known continuous and discrete adjoint, including automatic differentiation. Thus, it represents an alternative, third method. It is based on a modal representation of the linearized operator of the governing (primal) system. To approximate the operator an extended version of the Arnoldi factorization, the dynamical Arnoldi method (DAM) is introduced. The DAM allows to derive approximations for operators of non-symmetric coupled equations, which are inaccessible by the classical Arnoldi factorization. The approach is applied to the Burgers equation and to the Euler equations on periodic and non-periodic domains. Finally, it is tested on an optimization problem.
قيم البحث
اقرأ أيضاً
We consider a computational model for complex-fluid-solid interaction based on a diffuse-interface model for the complex fluid and a hyperelastic-material model for the solid. The diffuse-interface complex-fluid model is described by the incompressib
le Navier-Stokes-Cahn-Hilliard equations with preferential-wetting boundary conditions at the fluid-solid interface. The corresponding fluid traction on the interface includes a capillary-stress contribution, and the dynamic interface condition comprises the traction exerted by the non-uniform fluid-solid surface tension. We present a weak formulation of the aggregated complex-fluid-solid-interaction problem, based on an Arbitrary-Lagrangian-Eulerian formulation of the Navier-Stokes-Cahn-Hilliard equations and a proper reformulation of the complex-fluid traction and the fluid-solid surface tension. To validate the presented complex-fluid-solid-interaction model, we present numerical results and conduct a comparison to experimental data for a droplet on a soft substrate.
We present an elementary derivation of the exact solution (Bethe-Ansatz equations) of the Dicke model, using only commutation relations and an informed Ansatz for the structure of its eigenstates.
We consider a scalar function depending on a numerical solution of an initial value problem, and its second-derivative (Hessian) matrix for the initial value. The need to extract the information of the Hessian or to solve a linear system having the H
essian as a coefficient matrix arises in many research fields such as optimization, Bayesian estimation, and uncertainty quantification. From the perspective of memory efficiency, these tasks often employ a Krylov subspace method that does not need to hold the Hessian matrix explicitly and only requires computing the multiplication of the Hessian and a given vector. One of the ways to obtain an approximation of such Hessian-vector multiplication is to integrate the so-called second-order adjoint system numerically. However, the error in the approximation could be significant even if the numerical integration to the second-order adjoint system is sufficiently accurate. This paper presents a novel algorithm that computes the intended Hessian-vector multiplication exactly and efficiently. For this aim, we give a new concise derivation of the second-order adjoint system and show that the intended multiplication can be computed exactly by applying a particular numerical method to the second-order adjoint system. In the discussion, symplectic partitioned Runge--Kutta methods play an essential role.
Gradient-free optimization methods, such as surrogate based optimization (SBO) methods, and genetic (GAs), or evolutionary (EAs) algorithms have gained popularity in the field of constrained optimization of expensive black-box functions. However, con
straint-handling methods, by both classes of solvers, do not usually guarantee strictly feasible candidates during optimization. This can become an issue in applied engineering problems where design variables must remain feasible for simulations to not fail. We propose a constraint-handling method for computationally inexpensive constraint functions which guarantees strictly feasible candidates when using a surrogate-based optimizer. We compare our method to other SBO, GA/EA and gradient-based algorithms on two (relatively simple and relatively hard) analytical test functions, and an applied fully-resolved Computational Fluid Dynamics (CFD) problem concerned with optimization of an undulatory swimming of a fish-like body, and show that the proposed algorithm shows favorable results while guaranteeing feasible candidates.
Studies of model microswimmers have significantly contributed to the understanding of the principles of self-propulsion we have today. However, only a small number of microswimmer types have been amenable to analytic modeling, and further development
of such approaches is necessary to identify the key features of these active systems. Here we present a general perturbative calculation scheme for swimmers composed of beads interacting by harmonic potentials, driven by an arbitrary force protocol. The hydrodynamic interactions are treated using the Oseen and Rotne-Pragner approximations. We validate our approach by using 3 bead assemblies and comparing the results with the numerically obtained full-solutions of the governing equations of motion, as well as with the existing analytic models for a linear and a triangular swimmer geometries. While recovering the relation between the force and swimming velocity, our detailed analysis and the controlled level of approximation allow us to find qualitative differences already in the far field flow of the devices. Consequently, we are able to identify a behavior of the swimmer that is richer than predicted in previous models. Given its generality, the framework can be applied to any swimmer geometry, driving protocol and beads interactions, as well as in many swimmers problems.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
