相关论文: Novel mass-based multigrid relaxation schemes for …
A linearly implicit conservative difference scheme is applied to discretize the attractive coupled nonlinear Schr\"odinger equations with fractional Laplacian. Complex symmetric linear systems can be obtained, and the system matrices are…
This paper proposes tight semidefinite relaxations for polynomial optimization. The optimality conditions are investigated. We show that generally Lagrange multipliers can be expressed as polynomial functions in decision variables over the…
We develop a simple yet comprehensive nonlinear model to describe relaxation phenomena in amorphous glass-formers near the glass transition temperature. The model is based on the two-state, two-(time)scale (TS2) framework, and describes the…
We consider the numerical solution of time-dependent space tempered fractional diffusion equations. The use of Crank-Nicolson in time and of second-order accurate tempered weighted and shifted Gr\"unwald difference in space leads to dense…
A family of mixed finite elements is proposed for solving the first order system of linear elasticity equations in any space dimension, where the stress field is approximated by symmetric finite element tensors. This family of elements has…
This paper investigates the problem on the minimum ellipsoid containing the intersection of multiple ellipsoids, which has been extensively applied to information science, target tracking and data fusion etc. There are three major…
The effectiveness of the hyperbolic relaxation method for solving the Einstein constraint equations numerically is studied here on a variety of compact orientable three-manifolds. Convergent numerical solutions are found using this method…
We present a novel, general, and unifying point of view on sparse approaches to polynomial optimization. Solving polynomial optimization problems to global optimality is a ubiquitous challenge in many areas of science and engineering.…
The relaxion mechanism is a novel solution to the hierarchy problem. In this first statistical analysis of the relaxion mechanism, we quantify the relative plausibility of a QCD and a non-QCD relaxion model versus the Standard Model with…
Iterative methods based on matrix splittings are useful in solving large sparse linear systems. In this direction, proper splittings and its several extensions are used to deal with singular and rectangular linear systems. In this article,…
In the present paper we concentrate on an important issue in constructing a good multigrid solver: the choice of an efficient smoother. We will introduce all-at-once multigrid solvers for optimal control problems which show robust…
We investigate several robust preconditioners for solving the saddle-point linear systems that arise from spatial discretization of unsteady and steady variable-coefficient Stokes equations on a uniform staggered grid. Building on the…
Motivated by the task of clustering either $d$ variables or $d$ points into $K$ groups, we investigate efficient algorithms to solve the Peng-Wei (P-W) $K$-means semi-definite programming (SDP) relaxation. The P-W SDP has been shown in the…
In this paper, we propose a mass- and modified energy-conservative relaxation Crank-Nicolson finite element method for the Schr\"{o}dinger-Poisson equation. Utilizing only a single auxiliary variable, we simultaneously reformulate the…
The construction of multigrid operators for disordered linear lattice operators, in particular the fermion matrix in lattice gauge theories, by means of algebraic multigrid and block LU decomposition is discussed. In this formalism, the…
Space-time finite-element discretizations are well-developed in many areas of science and engineering, but much work remains within the development of specialized solvers for the resulting linear and nonlinear systems. In this work, we…
We propose a novel scheme to numerically solve scalar conservation laws on networks without the necessity to solve Riemann problems at the junction. The scheme is derived using the relaxation system introduced in [Jin and Xin, Comm. Pure…
Quadratic Unconstrained Binary Optimization (QUBO) problems are prevalent in various applications and are known to be NP-hard. The seminal work of Goemans and Williamson introduced a semidefinite programming (SDP) relaxation for such…
We develop an algebraic multigrid method for solving the non-Hermitian Wilson discretization of the 2-dimensional Dirac equation. The proposed approach uses a bootstrap setup algorithm based on a multigrid eigensolver. It computes test…
We analyze and optimize two-level methods applied to a symmetric interior penalty discontinuous Galerkin finite element discretization of a singularly perturbed reaction-diffusion equation. Previous analyses of such methods have been…