Related papers: Numerical Polynomial Homotopy Continuation Method …
We exhibit a probabilistic symbolic algorithm for solving zero-dimensional sparse systems. Our algorithm combines a symbolic homotopy procedure, based on a flat deformation of a certain morphism of affine varieties, with the polyhedral…
Full-physics modeling of multiphase flow in porous media, e.g., for carbon storage and groundwater management, requires the nonlinear coupling of various physical processes. Industry standard nonlinear solvers, typically of Newton-type, are…
In this paper, we propose an efficient continuation method for locating multiple power flow solutions. We adopt the holomorphic embedding technique to represent solution curves as holomorphic functions in the complex plane. The…
We consider a Hamiltonian decomposition problem of partitioning a regular graph into edge-disjoint Hamiltonian cycles. It is known that verifying vertex non-adjacency in the 1-skeleton of the symmetric and asymmetric traveling salesperson…
In this paper, we study the Crank-Nicolson method for temporal dimension and the piecewise quadratic polynomial collocation method for spatial dimensions of time-dependent nonlocal problems. The new theoretical results of such…
Electromagnetic waves interacting with three--dimensional periodic structures occur in many applications of great scientific and engineering interest. These three dimensional interactions are extremely complicated and subtle, so it is…
We present efficient algorithms to reduce the size of nondeterministic B\"uchi word automata (NBA) and nondeterministic finite word automata (NFA), while retaining their languages. Additionally, we describe methods to solve PSPACE-complete…
The computation of the $L_\infty $-norm is an important issue in $H_{\infty}$ control, particularly for analyzing system stability and robustness. This paper focuses on symbolic computation methods for determining the $L_{\infty} $-norm of…
We present a fast and efficient method for studying vacuum stability constraints in multi-scalar theories beyond the Standard Model. This method is designed for a reliable use in large scale parameter scans. The minimization of the scalar…
The notion of graph covers (also referred to as locally bijective homomorphisms) plays an important role in topological graph theory and has found its computer science applications in models of local computation. For a fixed target graph…
In this paper we propose a new approach for developing a proof that P=NP. We propose to use a polynomial-time reduction of a NP-complete problem to Linear Programming. Earlier such attempts used polynomial-time transformation which is a…
In this paper, attempt is made to solve a few problems using the Polynomial Point Collocation Method (PPCM), the Radial Point Collocation Method (RPCM), Smoothed Particle Hydrodynamics (SPH), and the Finite Point Method (FPM). A few…
We propose a consistent polynomial-time method for the unseeded node matching problem for networks with smooth underlying structures. Despite widely conjectured by the research community that the structured graph matching problem to be…
This paper addresses the challenging numerical simulation of nonlinear hybrid stochastic functional differential equations with infinite delays. We first propose an explicit scheme using space and time truncation, requiring only finite…
Given graphs $H$ and $G$, possibly with vertex-colors, a homomorphism is a function $f:V(H)\to V(G)$ that preserves colors and edges. Many interesting counting problems (e.g., subgraph and induced subgraph counts) are finite linear…
Insufficient reference data is ubiquitous in data-driven computational fluid dynamics, as it is usually too expensive to compute or impossible to observe over long enough times needed for data-driven methods. The lack of data can…
In this paper, we consider different constrained partition problems for weighted trees and cactus graphs. We focus on the (l,u)-partition problem, which is the problem of partitioning a weighted graph into connected clusters such that each…
We review several topics of interest in the study of 4d N=1 supersymmetric compactifications of the heterotic string. After a brief introduction to the construction of such models, our focus is on the novel physics which occurs at…
Abstract notions of convexity over the vertices of a graph, and corresponding notions of halfspaces, have recently gained attention from the machine learning community. In this work we study monophonic halfspaces, a notion of graph…
In this paper we present a formally fourth-order accurate hybrid-variable method for the Euler equations in the context of method of lines. The hybrid-variable (HV) method seeks numerical approximations to both cell-averages and nodal…