Related papers: Complex Neumann Problem and Kohn's Algorithm
When applying optimization method to a real-world problem, the possession of prior knowledge and preliminary analysis on the landscape of a global optimization problem can give us an insight into the complexity of the problem. This…
We present an efficient algorithm for calculating multiloop Feynman integrals perturbatively.
We announce some new results regarding the classification problem for separable von Neumann algebras. Our results are obtained by applying the notion of Borel reducibility and Hjorth's theory of turbulence to the isomorphism relation for…
In this paper we first write a proof of the perceptron convergence algorithm for the complex multivalued neural networks (CMVNNs). Our primary goal is to formulate and prove the perceptron convergence algorithm for the bicomplex multivalued…
We give examples of pseudoconvex domains of finite type in $\mathbb{C}^2$ where the Kohn algorithm for subelliptic estimates fails to yield an effective lower bound for the order of subellipticity in terms of the type. We show how to modify…
Solving the Toeplitz systems, which is to find the vector $x$ such that $T_nx = b$ given an $n\times n$ Toeplitz matrix $T_n$ and a vector $b$, has a variety of applications in mathematics and engineering. In this paper, we present a…
With the development of low order scaling methods for performing Kohn-Sham Density Functional Theory, it is now possible to perform fully quantum mechanical calculations of systems containing tens of thousands of atoms. However, with an…
We review the postulates of quantum mechanics that are needed to discuss the von Neumann's entropy. We introduce it as a generalization of Shannon's entropy and propose a simple game that makes easier understanding its physical meaning.
The task of reconstructing a matrix given a sample of observedentries is known as the matrix completion problem. It arises ina wide range of problems, including recommender systems, collaborativefiltering, dimensionality reduction, image…
We study the problem of complexity estimation in the context of parallelizing an advanced Branch and Bound-type algorithm over graphical models. The algorithm's pruning power makes load balancing, one crucial element of every distributed…
It is known that point searching in basic semialgebraic sets and the search for globally minimal points in polynomial optimization tasks can be carried out using $(s\,d)^{O(n)}$ arithmetic operations, where $n$ and $s$ are the numbers of…
A novel approach to complex problems has been previously applied to graph classification and the graph equivalence problem. Here we consider its applications to a wide set of NP complete problems, namely, those of finding a subgraph g…
We describe an algorithm for fast multiplication of skew polynomials. It is based on fast modular multiplication of such skew polynomials, for which we give an algorithm relying on evaluation and interpolation on normal bases. Our…
In this paper, we study an adaptive finite element method for multiple eigenvalue problems of a class of second order elliptic equations. By using some eigenspace approximation technology and its crucial property which is also presented in…
This article focuses on the optimization of a complex system which is composed of several subsystems. On the one hand, these subsystems are subject to multiple objectives, local constraints as well as local variables, and they are…
We propose a Hermite spectral method for the inelastic Boltzmann equation, which makes two-dimensional periodic problem computation affordable by the hardware nowadays. The new algorithm is based on a Hermite expansion, where the expansion…
We introduce a new integral representation formula in the d-bar Neumann Theory on weakly pseudoconvex domains which satisfies certain estimates analogous to the basic L^2 estimate. It is expected that more complete estimates can be obtained…
We prove that the $\bar\partial$-Neumann solution operator is locally regular in a domain which has compactness estimates, is of finite type outside a curve transversal to the CR directions and for which the holomorphic tangential…
Discrepancy between periodic orbit theory and numerical calculation of a modified Kepler problem is cleared by a quantum mechanical calculation. The diagonal approximation already gives a good fit for the numerical calculation. A better…
We prove non-subelliptic estimates for the tangential Cauchy-Riemann system over a weakly "$q$-pseudoconvex" higher codimensional submanifold $M$ of $\C^n$. Let us point out that our hypotheses do not suffice to guarantee subelliptic…