Related papers: An intrinsic homotopy for intersecting algebraic v…
We provide formulas and algorithms for computing the excess numbers of certain ideals. The solution for monomial ideals is given by the mixed volumes of certain polytopes. These results enable us to design specific homotopies for numerical…
The optimal transport problem has many applications in machine learning, physics, biology, economics, etc. Although its goal is very clear and mathematically well-defined, finding its optimal solution can be challenging for large datasets…
The concept of path homotopy has received widely attention in the field of path planning in recent years. In this article, a homotopy invariant based on convex dissection for a two-dimensional bounded Euclidean space is developed, which can…
We introduce a new variational method for the numerical homogenization of divergence form elliptic, parabolic and hyperbolic equations with arbitrary rough ($L^\infty$) coefficients. Our method does not rely on concepts of ergodicity or…
We present a simplification of the recursive algorithm for the evaluation of intersection numbers for differential $n$-forms, by combining the advantages emerging from the choice of delta-forms as generators of relative twisted cohomology…
We consider numerical solution of elliptic problems with heterogeneous diffusion coefficients containing thin highly conductive structures. Such problems arise e.g. in fractured porous media, reinforced materials, and electric circuits. The…
We present certain techniques to find completely positive maps between matrix algebras that take prescribed values on given data. To this aim we describe a semidefinite programming approach and another convex minimization method supported…
Homotopy perturbation method is used for solving the multi-point boundary value problems. The approximate solution is found in the form of a rapidly convergent series. Several numerical examples have been considered to illustrate the…
We present an algorithm for evaluating a linear ``intersection transform'' of a function defined on the lattice of subsets of an $n$-element set. In particular, the algorithm constructs an arithmetic circuit for evaluating the transform in…
In this article, we consider nonlinear complementarity problem. We introduce a new homotopy function for finding the solution of nonlinear complementarity problem through the trajectory . We show that the homotopy path approaching the…
Existing structural analysis methods may fail to find all hidden constraints for a system of differential-algebraic equations with parameters if the system is structurally unamenable for certain values of the parameters. In this paper, for…
Intrinsic isometric shape matching has become the standard approach for pose invariant correspondence estimation among deformable shapes. Most existing approaches assume global consistency, i.e., the metric structure of the whole manifold…
This article is concerned with numerical methods to approximate effective coefficients in stochastic homogenization of discrete linear elliptic equations, and their numerical analysis --- which has been made possible by recent contributions…
In this paper, a novel parallel hybrid iterative method is proposed for finding a common element of the set of solutions of a system of equilibrium problems, the set of solutions of variational inequalities for inverse strongly monotone…
The manuscript addresses the problem of finding all solutions of power flow equations or other similar nonlinear system of algebraic equations. This problem arises naturally in a number of power systems contexts, most importantly in the…
Our purpose is to use a Darboux homogenous derivative to understand the harmonic maps with values in homogeneous space. We present a characterization of these harmonic maps from the geometry of homogeneous space. Furthermore, our work…
Algebraic operads provide a powerful tool to understand the homotopy theory of the types of (co)algebras they encode. So far, the principal results and methods that this theory provides were only available in characteristic zero. The reason…
There is presented an algorithm for computing the topological degree for a large class of polynomial mappings. As an application there is given an effective algebraic formula for the intersection number of a polynomial immersion M --> R^2m,…
A simplicial complex is a set equipped with a down-closed family of distinguished finite subsets. This structure, usually viewed as codifying a triangulated space, is used here directly, to describe "spaces" whose geometric realisation can…
The theory of eigenvalues and eigenvectors is one of the fundamental and essential components in tensor analysis. Computing the dominant eigenpair of an essentially nonnegative tensor is an important topic in tensor computation because of…