In this work, an efficient and robust isogeometric three-dimensional solid-beam finite element is developed for large deformations and finite rotations with merely displacements as degrees of freedom. The finite strain theory and hyperelastic constitutive models are considered and B-Spline and NURBS are employed for the finite element discretization. Similar to finite elements based on Lagrange polynomials, also NURBS-based formulations are affected by the non-physical phenomena of locking, which constrains the field variables and negatively impacts the solution accuracy and deteriorates convergence behavior. To avoid this problem within the context of a Solid-Beam formulation, the Assumed Natural Strain (ANS) method is applied to alleviate membrane and transversal shear locking and the Enhanced Assumed Strain (EAS) method against Poisson thickness locking. Furthermore, the Mixed Integration Point (MIP) method is employed to make the formulation more efficient and robust. The proposed novel isogeometric solid-beam element is tested on several single-patch and multi-patch benchmark problems, and it is validated against classical solid finite elements and isoparametric solid-beam elements. The results show that the proposed formulation can alleviate the locking effects and significantly improve the performance of the isogeometric solid-beam element. With the developed element, efficient and accurate predictions of mechanical properties of lattice-based structured materials can be achieved. The proposed solid-beam element inherits both the merits of solid elements e.g. flexible boundary conditions and of the beam elements i.e. higher computational efficiency.
相關內容
We propose a model for the coupling of flow and transport equations with porous membrane-type conditions on part of the boundary. The governing equations consist of the incompressible Navier--Stokes equations coupled with an advection-diffusion equation, and we employ a Lagrange multiplier to enforce the coupling between penetration velocity and transport on the membrane, while mixed boundary conditions are considered in the remainder of the boundary. We show existence and uniqueness of the continuous problem using a fixed-point argument. Next, an H(div)-conforming finite element formulation is proposed, and we address its a priori error analysis. The method uses an upwind approach that provides stability in the convection-dominated regime. We showcase a set of numerical examples validating the theory and illustrating the use of the new methods in the simulation of reverse osmosis processes.
Neural operators (NO) are discretization invariant deep learning methods with functional output and can approximate any continuous operator. NO have demonstrated the superiority of solving partial differential equations (PDEs) over other deep learning methods. However, the spatial domain of its input function needs to be identical to its output, which limits its applicability. For instance, the widely used Fourier neural operator (FNO) fails to approximate the operator that maps the boundary condition to the PDE solution. To address this issue, we propose a novel framework called resolution-invariant deep operator (RDO) that decouples the spatial domain of the input and output. RDO is motivated by the Deep operator network (DeepONet) and it does not require retraining the network when the input/output is changed compared with DeepONet. RDO takes functional input and its output is also functional so that it keeps the resolution invariant property of NO. It can also resolve PDEs with complex geometries whereas NO fail. Various numerical experiments demonstrate the advantage of our method over DeepONet and FNO.
This paper is concerned with the approximation of solutions to a class of second order non linear abstract differential equations. The finite-dimensional approximate solutions of the given system are built with the aid of the projection operator. We investigate the connection between the approximate solution and exact solution, and the question of convergence. Moreover, we define the Faedo-Galerkin(F-G) approximations and prove the existence and convergence results. The results are obtained by using the theory of cosine functions, Banach fixed point theorem and fractional power of closed linear operators. At last, an example of abstract formulation is provided.
This paper develops a flexible and computationally efficient multivariate volatility model, which allows for dynamic conditional correlations and volatility spillover effects among financial assets. The new model has desirable properties such as identifiability and computational tractability for many assets. A sufficient condition of the strict stationarity is derived for the new process. Two quasi-maximum likelihood estimation methods are proposed for the new model with and without low-rank constraints on the coefficient matrices respectively, and the asymptotic properties for both estimators are established. Moreover, a Bayesian information criterion with selection consistency is developed for order selection, and the testing for volatility spillover effects is carefully discussed. The finite sample performance of the proposed methods is evaluated in simulation studies for small and moderate dimensions. The usefulness of the new model and its inference tools is illustrated by two empirical examples for 5 stock markets and 17 industry portfolios, respectively.
In this work we propose and analyse a structure-preserving approximation of the non-isothermal Cahn-Hilliard-Navier-Stokes system using conforming finite elements in space and implicit time discretisation with convex-concave splitting. The system is first reformulated into a variational form which reveal the structure of the equations, which is then used in the subsequent approximation.
We introduce a predictor-corrector discretisation scheme for the numerical integration of a class of stochastic differential equations and prove that it converges with weak order 1.0. The key feature of the new scheme is that it builds up sequentially (and recursively) in the dimension of the state space of the solution, hence making it suitable for approximations of high-dimensional state space models. We show, using the stochastic Lorenz 96 system as a test model, that the proposed method can operate with larger time steps than the standard Euler-Maruyama scheme and, therefore, generate valid approximations with a smaller computational cost. We also introduce the theoretical analysis of the error incurred by the new predictor-corrector scheme when used as a building block for discrete-time Bayesian filters for continuous-time systems. Finally, we assess the performance of several ensemble Kalman filters that incorporate the proposed sequential predictor-corrector Euler scheme and the standard Euler-Maruyama method. The numerical experiments show that the filters employing the new sequential scheme can operate with larger time steps, smaller Monte Carlo ensembles and noisier systems.
We propose an adaptive iteratively linearized finite element method (AILFEM) in the context of strongly monotone nonlinear operators in Hilbert spaces. The approach combines adaptive mesh-refinement with an energy-contractive linearization scheme (e.g., the Ka\v{c}anov method) and a norm-contractive algebraic solver (e.g., an optimal geometric multigrid method). Crucially, a novel parameter-free algebraic stopping criterion is designed and we prove that it leads to a uniformly bounded number of algebraic solver steps. Unlike available results requiring sufficiently small adaptivity parameters to ensure even plain convergence, the new AILFEM algorithm guarantees full R-linear convergence for arbitrary adaptivity parameters. Thus, parameter-robust convergence is guaranteed. Moreover, for sufficiently small adaptivity parameters, the new adaptive algorithm guarantees optimal complexity, i.e., optimal convergence rates with respect to the overall computational cost and, hence, time.
For the Crouzeix-Raviart and enriched Crouzeix-Raviart elements, asymptotic expansions of eigenvalues of the Stokes operator are derived by establishing two pseudostress interpolations, which admit a full one-order supercloseness with respect to the numerical velocity and the pressure, respectively. The design of these interpolations overcomes the difficulty caused by the lack of supercloseness of the canonical interpolations for the two nonconforming elements, and leads to an intrinsic and concise asymptotic analysis of numerical eigenvalues, which proves an optimal superconvergence of eigenvalues by the extrapolation algorithm. Meanwhile, an optimal superconvergence of postprocessed approximations for the Stokes equation is proved by use of this supercloseness. Finally, numerical experiments are tested to verify the theoretical results.
Among semiparametric regression models, partially linear additive models provide a useful tool to include additive nonparametric components as well as a parametric component, when explaining the relationship between the response and a set of explanatory variables. This paper concerns such models under sparsity assumptions for the covariates included in the linear component. Sparse covariates are frequent in regression problems where the task of variable selection is usually of interest. As in other settings, outliers either in the residuals or in the covariates involved in the linear component have a harmful effect. To simultaneously achieve model selection for the parametric component of the model and resistance to outliers, we combine preliminary robust estimators of the additive component, robust linear $MM-$regression estimators with a penalty such as SCAD on the coefficients in the parametric part. Under mild assumptions, consistency results and rates of convergence for the proposed estimators are derived. A Monte Carlo study is carried out to compare, under different models and contamination schemes, the performance of the robust proposal with its classical counterpart. The obtained results show the advantage of using the robust approach. Through the analysis of a real data set, we also illustrate the benefits of the proposed procedure.
Hashing has been widely used in approximate nearest search for large-scale database retrieval for its computation and storage efficiency. Deep hashing, which devises convolutional neural network architecture to exploit and extract the semantic information or feature of images, has received increasing attention recently. In this survey, several deep supervised hashing methods for image retrieval are evaluated and I conclude three main different directions for deep supervised hashing methods. Several comments are made at the end. Moreover, to break through the bottleneck of the existing hashing methods, I propose a Shadow Recurrent Hashing(SRH) method as a try. Specifically, I devise a CNN architecture to extract the semantic features of images and design a loss function to encourage similar images projected close. To this end, I propose a concept: shadow of the CNN output. During optimization process, the CNN output and its shadow are guiding each other so as to achieve the optimal solution as much as possible. Several experiments on dataset CIFAR-10 show the satisfying performance of SRH.
小貼士
登錄享
相關主題
注冊地址： 北京市海淀區羊坊店路18號2幢3層301-191