Related papers: New Procedure to Generate Multipliers in Complex N…
Kohn introduced in 1979 the algorithm of multipliers to study the subelliptc estimate of the $\bar\partial$-Neumann problem for a smooth weakly pseudoconvex domain in a complex Euclidean space which satisfies D'Angelo's finite type…
A solution to the effectiveness problem in Kohn's algorithm for generating subelliptic multipliers is provided for domains that include those given by sums of squares of holomorphic functions (also including infinite sums). These domains…
This article gives a rapid introduction to the complex Neumann problem and Kohn's algorithm for generating subelliptic estimate.
Splitting methods for the numerical integration of differential equations of order greater than two involve necessarily negative coefficients. This order barrier can be overcome by considering complex coefficients with positive real part.…
A very simple and accurate numerical method which is applicable to systems of differentio-integral equations with quite general boundary conditions has been devised. Although the basic idea of this method stems from the Keller Box method,…
A generalization of recent group-theoretic matrix multiplication algorithms to an analogue of the theory of partial matrix multiplication is presented. We demonstrate that the added flexibility of this approach can in some cases improve…
The purpose of this paper is to prove optimal estimates for solutions of the Kohn-Laplacian for certain classes of model domains in several complex variables. This will be achieved by applying a type of singular integral operator whose…
We provide a solution to the effectiveness problem in Kohn's algorithm for generating holomorphic subelliptic multipliers for $(0,q)$ forms for arbitrary $q$. As an application, we obtain subelliptic estimates for $(0,q)$ forms with…
This article discusses the geometric application of the method of multiplier ideal sheaves. It first briefly describes its application to effective problems in algebraic geometry and then presents and explains its application to the…
Matrix multiplication is a fundamental computation in many scientific disciplines. In this paper, we show that novel fast matrix multiplication algorithms can significantly outperform vendor implementations of the classical algorithm and…
In this note we present an algorithm to generate new Schr\" odinger type equations explicitly solvable in terms of orthogonal polynomials or associated special functions.
By any account, the 1998 proof of the Kepler conjecture is complex. The thesis underlying this article is that the proof is complex because it is highly under-automated. Throughout that proof, manual procedures are used where automated ones…
In this work a rationalized algorithm for calculating the quotient of two complex numbers is presented which reduces the number of underlying real multiplications. The performing of a complex number division using the naive method takes 4…
This paper studies the estimation of ranked-list discrete choice models with single and multiple purchases. In this setting, each consumer type is characterized by a ranking over a subset of products and a desired number of purchases, and…
In this paper, new schemes for a squarer, multiplier and divider of complex numbers are proposed. Traditional structural solutions for each of these operations require the presence some number of general-purpose binary multipliers. The…
The existing doubling algorithms have been proven efficient for several important nonlinear matrix equations arising from real-world engineering applications. In a nutshell, the algorithms iteratively compute a basis matrix, in one of the…
The Riemann problem for first-order hyperbolic systems of partial differential equations is of fundamental importance for both theoretical and numerical purposes. Many approximate solvers have been developed for such systems; exact solution…
In this paper we present an extension of standard iterative splitting schemes to multiple splitting schemes for solving higher order differential equations. We are motivated by dynamical systems, which occur in dynamics of the electrons in…
Efficient resource allocation and optical switching promise high key rates, network adaptability, and cost reduction in repeaterless quantum communication networks. However, identifying optimal switching configurations remains a significant…
This article presents a strongly polynomial-time algorithm for the general linear programming problem. This algorithm is an implicit reduction procedure that works as follows. Primal and dual problems are combined into a special system of…