Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximation algorithms”

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 847 records · Page 47

Hybrid immersed interface-immersed boundary methods for AC dielectrophoresis

Dielectrophoresis, a nonlinear electrokinetic transport mechanism, has become popular in many engineering applications including manipulation, characterization and actuation of biomaterials, particles and biological cells. In this paper, we present a hybrid immersed interface–immersed boundary method to study AC dielectrophoresis where an algorithm is developed to solve the complex Poisson equation using a real variable formulation. An immersed interface method is employed to obtain the AC electric field in a fluid media with suspended particles and an immersed boundary method is used for the fluid equations and particle transport. The convergence of the proposed algorithm as well as validation of the hybrid scheme with experimental results is presented. In this paper, the Maxwell stress tensor is used to calculate the dielectrophoretic force acting on particles by considering the physical effect of particles in the computational domain. Thus, this study eliminates the approximations used in point dipole methods for calculating dielectrophoretic force. A comparative study between Maxwell stress tensor and point dipole methods for computing dielectrophoretic forces are presented. The hybrid method is used to investigate the physics of dielectrophoresis in microfluidic devices using an AC electric field. The numerical results show that with proper design and appropriate selection of applied potential and frequency, global electric field minima can be obtained to facilitate multiple particle trapping by exploiting the mechanism of negative dielectrophoresis. Our numerical results also show that electrically neutral particles form a chain parallel to the applied electric field irrespective of their initial orientation when an AC electric field is applied. This proposed hybrid numerical scheme will help to better understand dielectrophoresis and to design and optimize microfluidic devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Investigation of electron-atom/molecule scattering resonances: Two complex multiconfigurational self-consistent field approaches

Resonances are temporarily bound states which lie in the continuum part of the Hamiltonian. If the electronic coordinates of the Hamiltonian are scaled (“dilated”) by a complex parameter, η = αe{sup iθ} (α, θ real), then its complex eigenvalues represent the scattering states (resonant and non-resonant) while the eigenvalues corresponding to the bound states and the ionization and the excitation thresholds remain real and unmodified. These make the study of these transient species amenable to the bound state methods. We developed a quadratically convergent multiconfigurational self-consistent field method (MCSCF), a well-established bound-state technique, combined with a dilated Hamiltonian to investigate resonances. This is made possible by the adoption of a second quantization algebra suitable for a set of “complex conjugate biorthonormal” spin orbitals and a modified step-length constraining algorithm to control the walk on the complex energy hypersurface while searching for the stationary point using a multidimensional Newton-Raphson scheme. We present our computational results for the {sup 2}PBe{sup −} shape resonances using two different computationally efficient methods that utilize complex scaled MCSCF (i.e., CMCSCF). These two methods are to straightforwardly use CMCSCF energy differences and to obtain energy differences using an approximation to the complex multiconfigurational electron propagator. It is found that, differing from previous computational studies by others, there are actually two {sup 2}PBe{sup −} shape resonances very close in energy. In addition, N{sub 2} resonances are examined using one of these methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Two-particle correlations in a dynamic cluster approximation with continuous momentum dependence: Superconductivity in the two-dimensional Hubbard model

The DCA + algorithm was recently introduced by Stear, Maier, and Schulthess [Phys. Rev. B 88, 115101 (2013), 10.1103/PhysRevB.88.115101] to extend the dynamic cluster approximation (DCA) with a continuous lattice self-energy in order to achieve better convergence with cluster size. In this work, we extend the DCA + algorithm to the calculation of two-particle correlation functions by introducing irreducible vertex functions with continuous momentum dependence consistent with the DCA + self-energy. This enables a significantly more controlled and reliable study of phase transitions than with the DCA. We test the new method by calculating the superconducting transition temperature $T_c$ in the attractive Hubbard model and show that it reproduces previous determinantal quantum Monte Carlo results. We then calculate $T_c$ in the doped repulsive Hubbard model, for which previous DCA calculations could only access the weak-coupling ($\textit{U}$ =4$\textit{t}$) regime for large clusters. Here, we show that the new algorithm provides access to much larger clusters and delivers asymptotically converged results for $T_c$ for both the weak ($\textit{U}$ =4$\textit{t}$) and intermediate ($\textit{U}$ =7$\textit{t}$) coupling regimes, and thereby enables the accurate determination of the exact infinite cluster size result.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

On the spin separation of algebraic two-component relativistic Hamiltonians

The separation of the spin-free and spin-dependent terms of a given relativistic Hamiltonian is usually facilitated by the Dirac identity. However, this is no longer possible for the recently developed exact two-component relativistic Hamiltonians derived from the matrix representation of the Dirac equation in a kinetically balanced basis. This stems from the fact that the decoupling matrix does not have an explicit form. To resolve this formal difficulty, we first define the spin-dependent term as the difference between a two-component Hamiltonian corresponding to the full Dirac equation and its one-component counterpart corresponding to the spin-free Dirac equation. The series expansion of the spin-dependent term is then developed in two different ways. One is in the spirit of the Douglas-Kroll-Hess (DKH) transformation and the other is based on the perturbative expansion of a two-component Hamiltonian of fixed structure, either the two-step Barysz-Sadlej-Snijders (BSS) or the one-step exact two-component (X2C) form. The algorithms for constructing arbitrary order terms are proposed for both schemes and their convergence patterns are assessed numerically. Truncating the expansions to finite orders leads naturally to a sequence of novel spin-dependent Hamiltonians. In particular, the order-by-order distinctions among the DKH, BSS, and X2C approaches can nicely be revealed. The well-known Pauli, zeroth-order regular approximation, and DKH1 spin-dependent Hamiltonians can also be recovered naturally by appropriately approximating the decoupling and renormalization matrices. On the practical side, the sf-X2C+so-DKH3 Hamiltonian, together with appropriately constructed generally contracted basis sets, is most promising for accounting for relativistic effects in two steps, first spin-free and then spin-dependent, with the latter applied either perturbatively or variationally.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optical Characteristics of Zinc Oxide Films on Glass Substrates

An algorithm is developed for solving the inverse problem of multiangular spectrophotometry of a layer on a planeparallel substrate of fi nite thickness using s- and p-polarized waves. It allows the dispersive properties of the layer and substrate to be studied both far from and in the vicinity of the resonant wavelengths. The dispersive properties of layers of pure and Al-doped ZnO on glass substrates are investigated using it. It is shown that doping shifts the absorption band maximum to shorter wavelength and decreases the refractive index of the material. The applicability limits of known approximate expressions for determining the spectral dependence of the absorption coeffi cient of a layer from spectrophotometric data are estimated.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Approximate Bayesian Model Inversion for PDEs with Heterogeneous and State-Dependent Coefficients

We present two approximate Bayesian inference methods for parameter estimation in partial differential equation (PDE) models with space-dependent and state-dependent parameters. We demonstrate that these methods provide accurate and cost-effective alternatives to Markov Chain Monte Carlo simulation. We assume a parameterized Gaussian prior on the unknown functions, and approximate the posterior density by a parameterized multivariate Gaussian density. The parameters of the prior and posterior are estimated from sparse observations of the PDE model's states and the unknown functions themselves by maximizing the evidence lower bound (ELBO), a lower bound on the log marginal likelihood of the observations. The first method, Laplace-EM, employs the expectation maximization algorithm to maximize the ELBO, with a Laplace approximation of the posterior on the E-step, and minimization of a Kullback-Leibler divergence on the M-step. The second method, DSVI-EB, employs the doubly stochastic variational inference (DSVI) algorithm, in which the ELBO is maximized via gradient-based stochastic optimization, with nosiy gradients computed via simple Monte Carlo sampling and Gaussian backpropagation. We apply these methods to identifying diffusion coefficients in linear and nonlinear diffusion equations, and we find that both methods provide accurate estimates of posterior densities and the hyperparameters of Gaussian priors. While the Laplace-EM method is more accurate, it requires computing Hessians of the physics model. The DSVI-EB method is found to be less accurate but only requires gradients of the physics model.

approximate Bayesian inference, model inversion, v↗

Structural properties of small rhodium clusters

We report a systematic study of the structural properties of rhodium clusters at the atomistic level. A novel global-minimum search algorithm, known as parallel tempering multicanonical basin hopping plus genetic algorithm (PTMBHGA), is used to obtain the geometrical structures with lowest minima at the semi-empirical level where Gupta potential is used to describe the atomic interaction among the rhodium atoms. These structures are then re-optimized at the density functional theory (DFT) level with exchange-correlation energy approximated by Perdew-Burke-Ernzerhof (PBE) generalized gradient approximation (GGA). The structures are optimized for different spin multiplicities. The ones with lowest energies will be taken as ground-state structures. In most cases, we observe only minor changes in the geometry and bond length of the clusters as a result of DFT-level re-optimization. Only in some limited cases, the initial geometries obtained from the PTMBHGA are modified by the re-optimization. The variation of structural properties, such as ground-state geometry, symmetry and binding energy, with respect to the cluster size is studied and agreed well with other results available in the literature.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Randomized Sketching Algorithms for Low-Memory Dynamic Optimization

This paper develops a novel limited-memory method to solve dynamic optimization problems. The memory requirements for such problems often present a major obstacle, particularly for problems with PDE constraints such as optimal flow control, full waveform inversion, and optical tomography. In these problems, PDE constraints uniquely determine the state of a physical system for a given control; the goal is to find the value of the control that minimizes an objective. While the control is often low dimensional, the state is typically more expensive to store. This paper suggests using randomized matrix approximation to compress the state as it is generated and shows how to use the compressed state to reliably solve the original dynamic optimization problem. Concretely, the compressed state is used to compute approximate gradients and to apply the Hessian to vectors. The approximation error in these quantities is controlled by the target rank of the sketch. This approximate first- and second-order information can readily be used in any optimization algorithm. As an example, we develop a sketched trust-region method that adaptively chooses the target rank using a posteriori error information and provably converges to a stationary point of the original problem. Numerical experiments with the sketched trust-region method show promising performance on challenging problems such as the optimal control of an advection-reaction-diffusion equation and the optimal control of fluid flow past a cylinder.

97 MATHEMATICS AND COMPUTING↗

Success and breakdown of the T-matrix approximation for phonon-disorder scattering

Here, we examine the validity of the widely used T-matrix approximation for treating phonon-disorder scattering by implementing an unfolding algorithm that allows simulation of disorder up to tens of millions of atoms. The T-matrix approximation breaks down for low-energy flexure phonons that play an important role in thermal transport in two-dimensional materials. Furthermore, insights are developed into the success of the T-matrix approximation in describing maximally mass disordered systems. To achieve this, the phonon unfolding formalism is generalized to describe mass disorder and strongly nonperturbative features of the spectrum are connected to the Boltzmann quasiparticle picture.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Validity of Five Satellite-Based Latent Heat Flux Algorithms for Semi-arid Ecosystems

Accurate estimation of latent heat flux (LE) is critical in characterizing semiarid ecosystems. Many LE algorithms have been developed during the past few decades. However, the algorithms have not been directly compared, particularly over global semiarid ecosystems. In this paper, we evaluated the performance of five LE models over semiarid ecosystems such as grassland, shrub, and savanna using the Fluxnet dataset of 68 eddy covariance (EC) sites during the period 2000–2009. We also used a modern-era retrospective analysis for research and applications (MERRA) dataset, the Normalized Difference Vegetation Index (NDVI) and Fractional Photosynthetically Active Radiation (FPAR) from the moderate resolution imaging spectroradiometer (MODIS) products; the leaf area index (LAI) from the global land surface satellite (GLASS) products; and the digital elevation model (DEM) from shuttle radar topography mission (SRTM30) dataset to generate LE at region scale during the period 2003–2006. The models were the moderate resolution imaging spectroradiometer LE (MOD16) algorithm, revised remote sensing based Penman–Monteith LE algorithm (RRS), the Priestley–Taylor LE algorithm of the Jet Propulsion Laboratory (PT-JPL), the modified satellite-based Priestley–Taylor LE algorithm (MS-PT), and the semi-empirical Penman LE algorithm (UMD). Direct comparison with ground measured LE showed the PT-JPL and MS-PT algorithms had relative high performance over semiarid ecosystems with the coefficient of determination (R2) ranging from 0.6 to 0.8 and root mean squared error (RMSE) of approximately 20 W/m 2 . Empirical parameters in the structure algorithms of MOD16 and RRS, and calibrated coefficients of the UMD algorithm may be the cause of the reduced performance of these LE algorithms with R2 ranging from 0.5 to 0.7 and RMSE ranging from 20 to 35 W/m 2 for MOD16, RRS and UMD. Sensitivity analysis showed that radiation and vegetation terms were the dominating variables affecting LE Fluxes in global semiarid ecosystem.

97 MATHEMATICS AND COMPUTING↗

A one-time truncate and encode multiresolution stochastic framework

In this work a novel adaptive strategy for stochastic problems, inspired from the classical Harten's framework, is presented. The proposed algorithm allows building, in a very general manner, stochastic numerical schemes starting from a whatever type of deterministic schemes and handling a large class of problems, from unsteady to discontinuous solutions. Its formulations permits to recover the same results concerning the interpolation theory of the classical multiresolution approach, but with an extension to uncertainty quantification problems. The present strategy permits to build numerical scheme with a higher accuracy with respect to other classical uncertainty quantification techniques, but with a strong reduction of the numerical cost and memory requirements. Moreover, the flexibility of the proposed approach allows to employ any kind of probability density function, even discontinuous and time varying, without introducing further complications in the algorithm. The advantages of the present strategy are demonstrated by performing several numerical problems where different forms of uncertainty distributions are taken into account, such as discontinuous and unsteady custom-defined probability density functions. In addition to algebraic and ordinary differential equations, numerical results for the challenging 1D Kraichnan–Orszag are reported in terms of accuracy and convergence. Finally, a two degree-of-freedom aeroelastic model for a subsonic case is presented. Though quite simple, the model allows recovering some physical key aspect, on the fluid/structure interaction, thanks to the quasi-steady aerodynamic approximation employed. The injection of an uncertainty is chosen in order to obtain a complete parameterization of the mass matrix. All the numerical results are compared with respect to classical Monte Carlo solution and with a non-intrusive Polynomial Chaos method.

97 MATHEMATICS AND COMPUTING↗

Automated method for tracing leading and trailing processes of migrating neurons in confocal image sequences

Segmentation, tracking, and tracing of neurons in video imagery are important steps in many neuronal migration studies and can be in accurate and time-consuming when performed manually. In this paper, we present an automated method for tracing the leading and trailing processes of migrating neurons in time-lapse image stacks acquired with a confocal fluorescence microscope. In our approach, we first locate and track the soma of the cell of interest by smoothing each frame and tracking the local maxima through the sequence. We then trace the leading process in each frame by starting at the center of the soma and stepping repeatedly in the most likely direction of the leading process. This direction is found at each step by examining second derivatives of fluorescent intensity along curves of constant radius around the current point. Tracing terminates after a fixed number of steps or when fluorescent intensity drops below a fixed threshold. We evolve the resulting trace to form an improved trace that more closely follows the approximate centerline of the leading process. We apply a similar algorithm to the trailing process of the cell by starting the trace in the opposite direction. We demonstrate our algorithm on two time-lapse confocal video sequences of migrating cerebellar granule neurons(CGNs). We show that the automated traces closely approximate ground truth traces to within 1 or 2 pixels on average. Additionally, we compute line intensity profiles of fluorescence along the automated traces and quantitatively demonstrate their similarity to manually generated profiles in terms of fluorescence peak locations.

99 GENERAL AND MISCELLANEOUS↗

Performance evaluation of cosmic ray muon trajectory estimation algorithms

Muons, being elementary particles with minimal interaction with nuclear materials and abundant at sea level, have sparked interest in utilizing them for imaging various applications, such as mining [Borselli et al., Sci. Rep. 12, 22329 (2022)], volcano imaging [Nagamine et al., Nucl. Instrum. Meth. A, 356, 585(1995)], and underground tunnel detection [Guardincerri et al., Pure Appl. Geophys. 174, 2133 (2017)]. Recently, their use in nuclear nonproliferation and safeguard verification has gained attention, particularly in cargo screening for nuclear waste smuggling [Baesso et al., J. Instrum. 9, C10041 (2014)], source localization [L. J. Schultz et al., Nucl. Instrum. Meth. A 519, 687 (2004)], and locating nuclear fuel debris in reactors [Borozdin et al., Phys. Rev. Let. 109, 152501 (2012)]. However, the resolution of muon image reconstruction techniques is limited due to multiple Coulomb scattering (MCS) within the target object. To achieve robust muon tomography, it is crucial to develop efficient and flexible physics-based algorithms that can model the MCS process accurately and estimate the most probable trajectory of muons as they pass through the target object. To address this limitation, in this study, a novel algorithmic approach utilizing the Bayesian probability theory and Gaussian approximation of MCS is chosen. Different energy levels, materials, and target sizes were considered in the evaluations. The results demonstrate that the Generalized Muon Trajectory Estimation (GMTE) algorithm offers significant improvements over currently used algorithms. Across all test scenarios, the GMTE algorithm demonstrated ~50% and 38% increase in precision compared to Straight Line Path (SLP) and Point of Closest Approach (PoCA) algorithms, respectively. Furthermore, it exhibited 10%–35% and 10%–15% increases in muon flux utilization for high and medium Z materials, respectively, compared to the PoCA algorithm. In conclusion, the extensive simulations confirm the enhanced performance and efficiency of the GMTE algorithm, offering improved resolution and reduced measurement time for cosmic ray muon imaging compared to the current SLP and PoCA algorithms.

79 ASTRONOMY AND ASTROPHYSICS↗

Scaling behavior of quantum nanosystems: Emergence of quasi-particles, collective modes, and mixed exchange symmetry states

Examples of quantum nanosystems are graphene nanoribbons, molecular wires, and superconducting nanoparticles. The objective of the multiscale theory presented here is to provide a new perspective on the coupling of processes across scales in space and time underlying the dynamics of these systems. The long range objective for this multiscale approach is to serve as an efficient computational algorithm. Long space-time dynamics is derived using a perturbation expansion in the ratio {epsilon} of the nearest-neighbor distance to a nanometer-scale characteristic length and a theorem on the equivalence of long time-averages and expectation values. This dynamics is shown to satisfy a coarse-grained wave equation (CGWE) which takes a Schroedinger-like form with modified masses and interactions. The scaling of space and time is determined by the orders of magnitude of various contributions to the N-body potential. If the spatial scale of the coarse-graining is too large, the CGWE would imply an unbounded growth of gradients; if it is too short, the system's size would display uncontrolled growth inappropriate for the bound states of interest, i.e., collective motion or migration within a stable nanoassembly. The balance of these two extremes removes arbitrariness in the choice of the scaling of space-time. Since the long-scale dynamics of each Fermion involves its interaction with many others, we hypothesize that the solutions of the CGWE have mean-field character to good approximation, i.e., can be factorized into single-particle functions. This leads to a coarse-grained mean-field approximation that is distinct in character from traditional Hartree-Fock theory. A variational principle is used to derive equations for the single-particle functions. This theme is developed and used to derive an equation for low-lying disturbances from the ground state corresponding to long wavelength density disturbances or long-scale migration. An algorithm for the efficient simulation of quantum nanosystems is suggested.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Sparse maps—A systematic infrastructure for reduced-scaling electronic structure methods. I. An efficient and simple linear scaling local MP2 method that uses an intermediate basis of pair natural orbitals

In this work, a systematic infrastructure is described that formalizes concepts implicit in previous work and greatly simplifies computer implementation of reduced-scaling electronic structure methods. The key concept is sparse representation of tensors using chains of sparse maps between two index sets. Sparse map representation can be viewed as a generalization of compressed sparse row, a common representation of a sparse matrix, to tensor data. By combining few elementary operations on sparse maps (inversion, chaining, intersection, etc.), complex algorithms can be developed, illustrated here by a linear-scaling transformation of three-center Coulomb integrals based on our compact code library that implements sparse maps and operations on them. The sparsity of the three-center integrals arises from spatial locality of the basis functions and domain density fitting approximation. A novel feature of our approach is the use of differential overlap integrals computed in linear-scaling fashion for screening products of basis functions. Finally, a robust linear scaling domain based local pair natural orbital second-order Möller-Plesset (DLPNO-MP2) method is described based on the sparse map infrastructure that only depends on a minimal number of cutoff parameters that can be systematically tightened to approach 100% of the canonical MP2 correlation energy. With default truncation thresholds, DLPNO-MP2 recovers more than 99.9% of the canonical resolution of the identity MP2 (RI-MP2) energy while still showing a very early crossover with respect to the computational effort. Based on extensive benchmark calculations, relative energies are reproduced with an error of typically <0.2 kcal/mol. The efficiency of the local MP2 (LMP2) method can be drastically improved by carrying out the LMP2 iterations in a basis of pair natural orbitals. While the present work focuses on local electron correlation, it is of much broader applicability to computation with sparse tensors in quantum chemistry and beyond.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A solution algorithm for the fluid dynamic equations based on a stochastic model for molecular motion

In this paper, a stochastic model is presented to simulate the flow of gases, which are not in thermodynamic equilibrium, like in rarefied or micro situations. For the interaction of a particle with others, statistical moments of the local ensemble have to be evaluated, but unlike in molecular dynamics simulations or DSMC, no collisions between computational particles are considered. In addition, a novel integration technique allows for time steps independent of the stochastic time scale. The stochastic model represents a Fokker-Planck equation in the kinetic description, which can be viewed as an approximation to the Boltzmann equation. This allows for a rigorous investigation of the relation between the new model and classical fluid and kinetic equations. The fluid dynamic equations of Navier-Stokes and Fourier are fully recovered for small relaxation times, while for larger values the new model extents into the kinetic regime. Numerical studies demonstrate that the stochastic model is consistent with Navier-Stokes in that limit, but also that the results become significantly different, if the conditions for equilibrium are invalid. The application to the Knudsen paradox demonstrates the correctness and relevance of this development, and comparisons with existing kinetic equations and standard solution algorithms reveal its advantages. Moreover, results of a test case with geometrically complex boundaries are presented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Benchmark Comparison for a Multi-Processing Ion Mobility Calculator in the Free Molecular Regime

A benchmark comparison between two ion mobility and collision cross-section (CCS) calculators, MOBCAL and IMoS, is presented here as a standard to test the efficiency and performance of both programs. Utilizing 47 organic ions, results are in excellent agreement between IMoS and MOBCAL in He and N{sub 2,} when both programs use identical input parameters. Due to a more efficiently written algorithm and to its parallelization, IMoS is able to calculate the same CCS (within 1%) with a speed around two orders of magnitude faster than its MOBCAL counterpart when seven cores are used. Due to the high computational cost of MOBCAL in N{sub 2}, reaching tens of thousands of seconds even for small ions, the comparison between IMoS and MOBCAL is stopped at 70 atoms. Large biomolecules (>10000 atoms) remain computationally expensive when IMoS is used in N{sub 2} (even when employing 16 cores). Approximations such as diffuse trajectory methods (DHSS, TDHSS) with and without partial charges and projected area approximation corrections can be used to reduce the total computational time by several folds without hurting the accuracy of the solution. These latter methods can in principle be used with coarse-grained model structures and should yield acceptable CCS results. .

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Vibrations of Elastic Shells of Revolution Partially Filled with Ideal Liquid

We propose an algorithm for the numerical analyses of vibrations of elastic shells of revolution partially filled with ideal incompressible liquids. In the solution of this problem, the wave motions of liquid on its free surface are taken into account. The solution of the problem of hydroelasticity is based on the application of the method of decomposition of the domain of integration of equations of the theory of shells with the use of the variational statement of the problem and on the approximate construction of the operator inverse to the operator of the hydrodynamic part of the problem. We construct a generalized functional of displacements of the shell for which the role of conditions of matching for the solutions in different subdomains is played by the natural boundary conditions. The obtained numerical results are compared with the existing exact solutions of the analyzed problem for a shell in the form of a straight circular cylinder.

42 ENGINEERING↗