相关论文: Even Order Explicit Symplectic Geometric Algorithm…

This work is related to PHG (Parallel Hierarchical Grid). PHG is a toolbox for developing parallel adaptive finite element programs, which is under active development at the State Key Laboratory of Scientific and Engineering Computing. The…

Nowadays, we have seen that dual quaternion algorithms are used in 3D coordinate transformation problems due to their advantages. 3D coordinate transformation problem is one of the important problems in geodesy. This transformation problem…

Straight-forward conformation generation models, which generate 3-D structures directly from input molecular graphs, play an important role in various molecular tasks with machine learning, such as 3D-QSAR and virtual screening in drug…

The article is devoted to the development of algorithmic methods ensuring efficient complexity bounds for strongly convex-concave saddle point problems in the case when one of the groups of variables is high-dimensional, and the other is…

High order algorithms have emerged in numerical astrophysics as a promising avenue to reduce truncation error (proportional to a power of the linear resolution $\Delta x$) with only a moderate increase to computational expense. Significant…

The finite element method (FEM) is a cornerstone numerical technique for solving partial differential equations (PDEs). Here, we present $\textbf{Qu-FEM}$, a fault-tolerant era quantum algorithm for the finite element method. In contrast to…

This chapter provides an overview of state-of-the-art adaptive finite element methods (AFEMs) for the numerical solution of second-order elliptic partial differential equations (PDEs), where the primary focus is on the optimal interplay of…

This paper focuses on explicit approximations for nonlinear stochastic delay differential equations (SDDEs). Under the weakly local Lipschitz and some suitable conditions, a generic truncated Euler-Maruyama (TEM) scheme for SDDEs is…

We present a novel framework for PDE-constrained $r$-adaptivity of high-order meshes. The proposed method formulates mesh movement as an optimization problem, with an objective function defined as a convex combination of a mesh quality…

To numerically solve a generic elliptic equation on two-dimensional domains with rectangular Cartesian grids, we propose a cut-cell geometric multigrid method that features (1) general algorithmic steps that apply to two-dimensional…

In this work we propose and analyze a weighted proper orthogonal decomposition method to solve elliptic partial differential equations depending on random input data, for stochastic problems that can be transformed into parametric systems.…

We discuss Pad\'e-improvement of known four-loop order results based upon an asymptotic three-parameter error formula for Pad\'e-approximants. We derive an explicit formula estimating the next-order coefficient $R_4$ from the previous…

We present a paradigm for developing arbitrarily high order, linear, unconditionally energy stable numerical algorithms for gradient flow models. We apply the energy quadratization (EQ) technique to reformulate the general gradient flow…

In the lattice approach to Loop Quantum Gravity on a fixed graph computations tend to be involved and are rarely analytically manageable. But, when interested in the expectation values of coherent states on the lattice which are sharply…

We propose a fast fourth-order cut cell method for solving constant-coefficient elliptic equations in two-dimensional irregular domains. In our methodology, the key to dealing with irregular domains is the poised lattice generation (PLG)…

Generalized Additive Runge-Kutta schemes have shown to be a suitable tool for solving ordinary differential equations with additively partitioned right-hand sides. This work develops symplectic GARK schemes for additively partitioned…

The dual configuration of the original one is proposed for the orbit design of Taiji spacecrafts. In terms of these two configurations of Taiji, an algorithm is devised to expand the unperturbed Keplerian orbits of spacecrafts to infinite…

We propose a geometric numerical analysis of SDEs admitting Lie symmetries which allows us to individuate a symmetry adapted coordinates system where the given SDE has notable invariant properties. An approximation scheme preserving the…

Many important geometric estimation problems take the form of synchronization over the special Euclidean group: estimate the values of a set of poses given a set of relative measurements between them. This problem is typically formulated as…

Symmetry in mathematical programming may lead to a multiplicity of solutions. In nonconvex optimisation, it can negatively affect the performance of the branch-and-bound algorithm. Symmetry may induce large search trees with multiple…