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

Binary-fluid flows can be modeled using the Navier-Stokes-Cahn-Hilliard equations, which represent the boundary between the fluid constituents by a diffuse interface. The diffuse-interface model allows for complex geometries and topological changes of the binary-fluid interface. In this work, we propose an immersed isogeometric analysis framework to solve the Navier-Stokes-Cahn-Hilliard equations on domains with geometrically complex external binary-fluid boundaries. The use of optimal-regularity B-splines results in a computationally efficient higher-order method. The key features of the proposed framework are a generalized Navier-slip boundary condition for the tangential velocity components, Nitsche's method for the convective impermeability boundary condition, and skeleton- and ghost-penalties to guarantee stability. A binary-fluid Taylor-Couette flow is considered for benchmarking. Porous medium simulations demonstrate the ability of the immersed isogeometric analysis framework to model complex binary-fluid flow phenomena such as break-up and coalescence in complex geometries.

Satellite altimetry, which measures water level with global coverage and high resolution, provides an unprecedented opportunity for a wide and refined understanding of the changing tides in the coastal area, but the sampling frequency is too low to satisfy the Nyquist frequency requirement and too few data points per year are available to recognize a sufficient number of tidal constituents to capture the trend of tidal changes on a yearly basis. To address these issues, a novel Regularized Least-Square approach is developed to relax the limitation to the range of satellite operating conditions. In this method, the prior information of the regional tidal amplitudes is used to support a least square analysis to obtain the amplitudes and phases of the tidal constituents for water elevation time series of different lengths and time intervals. Synthetic data experiments performed in Delaware Bay and Galveston Bay showed that the proposed method can determine the tidal amplitudes with high accuracy and the sampling interval can be extended to the application level of major altimetry satellites. The proposed algorithm was further validated using the data of the altimetry mission, Jason-3, to show its applicability to irregular and noisy data. The new method could help identify the changing tides with sea-level rise and anthropogenic activities in coastal areas, informing coastal flooding risk assessment and ecosystem health analysis.

Medical ultrasound imaging is the most widespread real-time non-invasive imaging system and its formulation comprises signal transmission, signal reception, and image formation. Ultrasound signal transmission modelling has been formalized over the years through different approaches by exploiting the physics of the associated wave problem. This work proposes a novel computational framework for modelling the ultrasound signal transmission step in the time-frequency domain for a linear-array probe. More specifically, from the impulse response theory defined in the time domain, we derived a parametric model in the corresponding frequency domain, with appropriate approximations for the narrowband case. To validate the model, we implemented a numerical simulator and tested it with synthetic data. Numerical experiments demonstrate that the proposed model is computationally feasible, efficient, and compatible with realistic measurements and existing state-of-the-art simulators. The formulated model can be employed for analyzing how the involved parameters affect the generated beam pattern, and ultimately for optimizing measurement settings in an automatic and systematic way.

Modeling correctly the transport of neutrinos is crucial in some astrophysical scenarios such as core-collapse supernovae and binary neutron star mergers. In this paper, we focus on the truncated-moment formalism, considering only the first two moments (M1 scheme) within the grey approximation, which reduces Boltzmann seven-dimensional equation to a system of $3+1$ equations closely resembling the hydrodynamic ones. Solving the M1 scheme is still mathematically challenging, since it is necessary to model the radiation-matter interaction in regimes where the evolution equations become stiff and behave as an advection-diffusion problem. Here, we present different global, high-order time integration schemes based on Implicit-Explicit Runge-Kutta (IMEX) methods designed to overcome the time-step restriction caused by such behavior while allowing us to use the explicit RK commonly employed for the MHD and Einstein equations. Finally, we analyze their performance in several numerical tests.

Deciding whether saddle points exist or are approximable for nonconvex-nonconcave problems is usually intractable. This paper takes a step towards understanding a broad class of nonconvex-nonconcave minimax problems that do remain tractable. Specifically, it studies minimax problems over geodesic metric spaces, which provide a vast generalization of the usual convex-concave saddle point problems. The first main result of the paper is a geodesic metric space version of Sion's minimax theorem; we believe our proof is novel and broadly accessible as it relies on the finite intersection property alone. The second main result is a specialization to geodesically complete Riemannian manifolds: here, we devise and analyze the complexity of first-order methods for smooth minimax problems.

State-of-the-art parallel sorting algorithms for distributed-memory architectures are based on computing a balanced partitioning via sampling and histogramming. By finding samples that partition the sorted keys into evenly-sized chunks, these algorithms minimize the number of communication rounds required. Histogramming (computing positions of samples) guides sampling, enabling a decrease in the overall number of samples collected. We derive lower and upper bounds on the number of sampling/histogramming rounds required to compute a balanced partitioning. We improve on prior results to demonstrate that when using $p$ processors, $O(\log^* p)$ rounds with $O(p/\log^* p)$ samples per round suffice. We match that with a lower bound that shows that any algorithm with $O(p)$ samples per round requires at least $\Omega(\log^* p)$ rounds. Additionally, we prove the $\Omega(p \log p)$ samples lower bound for one round, thus proving that existing one round algorithms: sample sort, AMS sort and HSS have optimal sample size complexity. To derive the lower bound, we propose a hard randomized input distribution and apply classical results from the distribution theory of runs.

In this paper, we present and analyze a linear fully discrete second order scheme with variable time steps for the phase field crystal equation. More precisely, we construct a linear adaptive time stepping scheme based on the second order backward differentiation formulation (BDF2) and use the Fourier spectral method for the spatial discretization. The scalar auxiliary variable approach is employed to deal with the nonlinear term, in which we only adopt a first order method to approximate the auxiliary variable. This treatment is extremely important in the derivation of the unconditional energy stability of the proposed adaptive BDF2 scheme. However, we find for the first time that this strategy will not affect the second order accuracy of the unknown phase function $\phi^{n}$ by setting the positive constant $C_{0}$ large enough such that $C_{0}\geq 1/\Dt.$ The energy stability of the adaptive BDF2 scheme is established with a mild constraint on the adjacent time step radio $\gamma_{n+1}:=\Dt_{n+1}/\Dt_{n}\leq 4.8645$. Furthermore, a rigorous error estimate of the second order accuracy of $\phi^{n}$ is derived for the proposed scheme on the nonuniform mesh by using the uniform $H^{2}$ bound of the numerical solutions. Finally, some numerical experiments are carried out to validate the theoretical results and demonstrate the efficiency of the fully discrete adaptive BDF2 scheme.

The Deferred Correction (DeC) is an iterative procedure, characterized by increasing accuracy at each iteration, which can be used to design numerical methods for systems of ODEs. The main advantage of such framework is the automatic way of getting arbitrarily high order methods, which can be put in Runge--Kutta (RK) form. The drawback is the larger computational cost with respect to the most used RK methods. To reduce such cost, in an explicit setting, we propose an efficient modification: we introduce interpolation processes between the DeC iterations, decreasing the computational cost associated to the low order ones. We provide the Butcher tableaux of the new modified methods and we study their stability, showing that in some cases the computational advantage does not affect the stability. The flexibility of the novel modification allows nontrivial applications to PDEs and construction of adaptive methods. The good performances of the introduced methods are broadly tested on several benchmarks both in ODE and PDE contexts.

Recent years have seen an increasing amount of research devoted to the development of so-called resonance-based methods for dispersive nonlinear partial differential equations. In many situations, this new class of methods allows for approximations in a much more general setting (e.g. for rough data) than, for instance, classical splitting or exponential integrator methods. However, they lack one important property: the preservation of geometric properties of the flow. This is particularly drastic in the case of the Korteweg--de Vries (KdV) equation and the nonlinear Schr\"odinger equation (NLSE) which are fundamental models in the broad field of dispersive infinite-dimensional Hamiltonian systems, possessing infinitely many conserved quantities, an important property which we wish to capture - at least up to some degree - also on the discrete level. Nowadays, a wide range of structure preserving integrators for Hamiltonian systems are available, however, typically these existing algorithms can only approximate highly regular solutions efficiently. State-of-the-art low-regularity integrators, on the other hand, poorly preserve the geometric structure of the underlying PDE. In this work we introduce a novel framework, so-called Runge-Kutta resonance-based methods, which are able to bridge the gap between low regularity and structure preservation in the KdV and NLSE case. In particular, we are able to characterise a large class of symplectic (in the Hamiltonian picture) resonance-based methods for both equations that allow for low-regularity approximations to the solution while preserving the underlying geometric structure of the continuous problem on the discrete level.

This paper proposes a recommender system to alleviate the cold-start problem that can estimate user preferences based on only a small number of items. To identify a user's preference in the cold state, existing recommender systems, such as Netflix, initially provide items to a user; we call those items evidence candidates. Recommendations are then made based on the items selected by the user. Previous recommendation studies have two limitations: (1) the users who consumed a few items have poor recommendations and (2) inadequate evidence candidates are used to identify user preferences. We propose a meta-learning-based recommender system called MeLU to overcome these two limitations. From meta-learning, which can rapidly adopt new task with a few examples, MeLU can estimate new user's preferences with a few consumed items. In addition, we provide an evidence candidate selection strategy that determines distinguishing items for customized preference estimation. We validate MeLU with two benchmark datasets, and the proposed model reduces at least 5.92% mean absolute error than two comparative models on the datasets. We also conduct a user study experiment to verify the evidence selection strategy.