搜索结果: 1-15 共查到“数学 k-way cut”相关记录15条 . 查询时间(0.093 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Arbitrarily high-order cut-off methods to preserve maximum bound principle for Allen-Cahn equations
Allen-Cahn equations 最大界限原理 任意高阶 截止方法
2023/4/14
A new class of high-order maximum principle preserving numerical methods is proposed for solving the semilinear Allen-Cahn equation. We start with the method consists of a $k$th-order multistep expone...
SEPARATION CUT-OFFS FOR BIRTH AND DEATH CHAINS。
This paper investigates the impact and potential
use of the cut-cell vertical discretisation for forecasts covering five days and climate simulations.
Some integrals and series involving the Gegenbauer polynomials and the Legendre functions on the cut (-1,1)
Special functions Legendre functions Gegenbauer polynomials Fourier expansions
2011/9/6
Abstract: We use the recent findings of Cohl [arXiv:1105.2735] and evaluate the principal and the residual values of the integral $\int_{-1}^{1}\mathrm{d}t\:(1-t^{2})^{\lambda-1/2}(x-t)^{-\kappa-1/2}C...
Asymptotic expansion of beta matrix models in the one-cut regime
Asymptotic expansion beta matrix models the one-cut regime Probability
2011/8/26
Abstract: We prove the existence of a 1/N expansion to all orders in beta matrix models with a confining, off-critical potential corresponding to an equilibrium measure with a connected support. Thus,...
Max-Flow Min-Cut Theorems for Communication Networks Based on Equational Logic
Max-Flow Min-Cut Theorems Communication Networks Equational Logic
2011/2/25
Traditionally, communication networks are modeled and analyzed in terms of information flows in
graphs. In this paper, we introduce a new symbolic approach to communication networks, where the topolo...
The sphere and the cut locus at a tangency point in two-dimensional almost-Riemannian geometry
almost-Riemannian geometry conjugate and cut loci
2010/12/6
We study the tangential case in 2-dimensional almost-Riemannian geometry. We analyse the connection with the Martinet case in sub-Rieman-nian geometry. We compute estimations of the exponential map wh...
Graphons, cut norm and distance, couplings and rearrangements
Graphons cut norm distance couplings rearrangements
2010/12/6
We give a survey of basic results on the cut norm and cut metric for graphons (and sometimes more general kernels), with emphasis on the equivalence problem. The main results are not new, but we add v...
Cut-and-Join operator representation for Kontsewich-Witten tau-function
Cut-and-Join operator representation Kontsewich-Witten tau-function
2010/12/16
In this short note we construct a simple cut-and-join operator representation for Kontsevich-Witten tau-function that is the partition function of the two-dimensional topological gravity. Our derivati...
Quasi-randomness of graph balanced cut properties
Quasi-randomness graph balanced cut properties
2010/12/6
Quasi-random graphs can be informally described as graphs whose edge distribution closely
resembles that of a truly random graph of the same edge density. Recently, Shapira and Yuster
proved the fol...
We develop a unitarity method to compute one-loop amplitudes with massless propagators in d = 4 − 2 dimensions. We compute double cuts of the loop amplitudes via a decomposition into a four-dim...
AN EFFECTIVE CONTINUOUS ALGORITHM FOR APPROXIMATE SOLUTIONS OF LARGESCALE MAX-CUT PROBLEMS
Max-cut problems Algorithm Feasible direction method Laplacian matrix Eigenvectors
2007/12/11
An effective continuous algorithm is proposed to find approximate
solutions of NP-hard max-cut problems. The algorithm relaxes the
max-cut problem into a continuous nonlinear programming problem by
...
A Continuation Algorithm for Max-Cut Problem 连续化方法求解最大割问题
最大割 NCP 函数 凸函数 增广Lagrange 乘子罚函数方法
2007/12/11
本文给出一种求最大割问题最优解的新方法--连续化方法, 方法完全不同于目前使用的松弛算法, 方法通过对最大割问题利用互补(NCP)函数进行连续化, 给出了最大割问题等价的连续模型, 连续化方法不仅不增加问题的维数，而且还是等价变换. 论文给出了连续模型的增广拉格朗日乘子罚函数以便用乘子罚函数法求解, 不同于一般最优化问题的增广拉格朗日乘子函数只在最优解的一个邻域内在罚因子充分大时是凸的, 本文提出...
Spectral methods for the non cut-off Boltzmann equation and numerical grazing collision limit
Spectral methods Boltzmann equation cut-off assumption Fokker-Planck-Landau equation
2010/12/14
In this paper we study the numerical passage from the spatially homogeneous Boltzmann equation without cut-off to the Fokker-Planck-Landau equation in the socalled grazing collision limit.
An Application of the Whitehouse Module to Riffle Shuffles Followed by a Cut
Whitehouse Module Riffle Shuffles Followed by a Cut
2010/11/1
Using representation theoretic work on the Whitehouse module, a formula is obtained for the cycle structure of a riffle shuffle followed by a cut. This result will be merged with the paper [F6].