亚洲男人的天堂2018av,欧美草比,久久久久久免费视频精选,国色天香在线看免费,久久久久亚洲av成人片仓井空

We aim to establish Bowen's equations for upper capacity invariance pressure and Pesin-Pitskel invariance pressure of discrete-time control systems. We first introduce a new invariance pressure called induced invariance pressure on partitions that specializes the upper capacity invariance pressure on partitions, and then show that the two types of invariance pressures are related by a Bowen's equation. Besides, to establish Bowen's equation for Pesin-Pitskel invariance pressure on partitions we also introduce a new notion called BS invariance dimension on subsets. Moreover, a variational principle for BS invariance dimension on subsets is established.

Private synthetic data sharing is preferred as it keeps the distribution and nuances of original data compared to summary statistics. The state-of-the-art methods adopt a select-measure-generate paradigm, but measuring large domain marginals still results in much error and allocating privacy budget iteratively is still difficult. To address these issues, our method employs a partition-based approach that effectively reduces errors and improves the quality of synthetic data, even with a limited privacy budget. Results from our experiments demonstrate the superiority of our method over existing approaches. The synthetic data produced using our approach exhibits improved quality and utility, making it a preferable choice for private synthetic data sharing.

We consider rather general structural equation models (SEMs) between a target and its covariates in several shifted environments. Given $k\in\N$ shifts we consider the set of shifts that are at most $\gamma$-times as strong as a given weighted linear combination of these $k$ shifts and the worst (quadratic) risk over this entire space. This worst risk has a nice decomposition which we refer to as the "worst risk decomposition". Then we find an explicit arg-min solution that minimizes the worst risk and consider its corresponding plug-in estimator which is the main object of this paper. This plug-in estimator is (almost surely) consistent and we first prove a concentration in measure result for it. The solution to the worst risk minimizer is rather reminiscent of the corresponding ordinary least squares solution in that it is product of a vector and an inverse of a Grammian matrix. Due to this, the central moments of the plug-in estimator is not well-defined in general, but we instead consider these moments conditioned on the Grammian inverse being bounded by some given constant. We also study conditional variance of the estimator with respect to a natural filtration for the incoming data. Similarly we consider the conditional covariance matrix with respect to this filtration and prove a bound for the determinant of this matrix. This SEM model generalizes the linear models that have been studied previously for instance in the setting of casual inference or anchor regression but the concentration in measure result and the moment bounds are new even in the linear setting.

An abstract property (H) is the key to a complete a priori error analysis in the (discrete) energy norm for several nonstandard finite element methods in the recent work [Lowest-order equivalent nonstandard finite element methods for biharmonic plates, Carstensen and Nataraj, M2AN, 2022]. This paper investigates the impact of (H) to the a posteriori error analysis and establishes known and novel explicit residual-based a posteriori error estimates. The abstract framework applies to Morley, two versions of discontinuous Galerkin, $C^0$ interior penalty, as well as weakly over-penalized symmetric interior penalty schemes for the biharmonic equation with a general source term in $H^{-2}(\Omega)$.

We couple the L1 discretization of the Caputo fractional derivative in time with the Galerkin scheme to devise a linear numerical method for the semilinear subdiffusion equation. Two important points that we make are: nonsmooth initial data and time-dependent diffusion coefficient. We prove the stability and convergence of the method under weak assumptions concerning regularity of the diffusivity. We find optimal pointwise in space and global in time errors, which are verified with several numerical experiments.

A spatial second-order scheme for the nonlinear radiative transfer equations is introduced in this paper. The discretization scheme is based on the filtered spherical harmonics ($FP_N$) method for the angular variable and the unified gas kinetic scheme (UGKS) framework for the spatial and temporal variables respectively. In order to keep the scheme positive and second-order accuracy, firstly, we use the implicit Monte Carlo linearization method [6] in the construction of the UGKS numerical boundary fluxes. Then, by carefully analyzing the constructed second-order fluxes involved in the macro-micro decomposition, which is induced by the $FP_N$ angular discretization, we establish the sufficient conditions that guarantee the positivity of the radiative energy density and material temperature. Finally, we employ linear scaling limiters for the angular variable in the $P_N$ reconstruction and for the spatial variable in the piecewise linear slopes reconstruction respectively, which are shown to be realizable and reasonable to enforce the sufficient conditions holding. Thus, the desired scheme, called the $PPFP_N$-based UGKS, is obtained. Furthermore, in the regime $\epsilon\ll 1$ and the regime $\epsilon=O(1)$, a simplified spatial second-order scheme, called the $PPFP_N$-based SUGKS, is presented, which possesses all the properties of the non-simplified one. Inheriting the merit of UGKS, the proposed schemes are asymptotic preserving. By employing the $FP_N$ method for the angular variable, the proposed schemes are almost free of ray effects. To our best knowledge, this is the first time that spatial second-order, positive, asymptotic preserving and almost free of ray effects schemes are constructed for the nonlinear radiative transfer equations without operator splitting. Various numerical experiments are included to validate the properties of the proposed schemes.

This paper presents a novel boundary integral equation (BIE) formulation for the two-dimensional time-harmonic water-waves problem. It utilizes a complex-scaled Laplace's free-space Green's function, resulting in a BIE posed on the infinite boundaries of the domain. The perfectly matched layer (PML) coordinate stretching that is used to render propagating waves exponentially decaying, allows for the effective truncation and discretization of the BIE unbounded domain. We show through a variety of numerical examples that, despite the logarithmic growth of the complex-scaled Laplace's free-space Green's function, the truncation errors are exponentially small with respect to the truncation length. Our formulation uses only simple function evaluations (e.g. complex logarithms and square roots), hence avoiding the need to compute the involved water-wave Green's function. Finally, we show that the proposed approach can also be used to find complex resonances through a \emph{linear} eigenvalue problem since the Green's function is frequency-independent.

We propose a finite element discretization for the steady, generalized Navier-Stokes equations for fluids with shear-dependent viscosity, completed with inhomogeneous Dirichlet boundary conditions and an inhomogeneous divergence constraint. We establish (weak) convergence of discrete solutions as well as a priori error estimates for the velocity vector field and the scalar kinematic pressure. Numerical experiments complement the theoretical findings.

We present a multigrid algorithm to solve efficiently the large saddle-point systems of equations that typically arise in PDE-constrained optimization under uncertainty. The algorithm is based on a collective smoother that at each iteration sweeps over the nodes of the computational mesh, and solves a reduced saddle-point system whose size depends on the number $N$ of samples used to discretized the probability space. We show that this reduced system can be solved with optimal $O(N)$ complexity. We test the multigrid method on three problems: a linear-quadratic problem, possibly with a local or a boundary control, for which the multigrid method is used to solve directly the linear optimality system; a nonsmooth problem with box constraints and $L^1$-norm penalization on the control, in which the multigrid scheme is used within a semismooth Newton iteration; a risk-adverse problem with the smoothed CVaR risk measure where the multigrid method is called within a preconditioned Newton iteration. In all cases, the multigrid algorithm exhibits excellent performances and robustness with respect to the parameters of interest.

The spectral clustering algorithm is often used as a binary clustering method for unclassified data by applying the principal component analysis. To study theoretical properties of the algorithm, the assumption of conditional homoscedasticity is often supposed in existing studies. However, this assumption is restrictive and often unrealistic in practice. Therefore, in this paper, we consider the allometric extension model, that is, the directions of the first eigenvectors of two covariance matrices and the direction of the difference of two mean vectors coincide, and we provide a non-asymptotic bound of the error probability of the spectral clustering algorithm for the allometric extension model. As a byproduct of the result, we obtain the consistency of the clustering method in high-dimensional settings.