Related papers: More on Equivalent Formulation of Implicit Complem…
This article presents a class of new relaxation modulus-based iterative methods to process the large and sparse implicit complementarity problem (ICP). Using two positive diagonal matrices, we formulate a fixed-point equation and prove that…
A method is suggested for treating the well-known deficiency in the use of Pade approximants that are well suited for approximating rational functions, but confront problems in approximating irrational functions. We develop the approach of…
Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond ${\bf NP\neq co NP}$. These conjectures formally connect computational complexity with the difficulty of…
Although implicit-explicit (IMEX) methods for approximating solutions to semilinear parabolic equations are relatively standard, most recent works examine the case of a fully discretized model. We show that by discretizing time only, one…
In this paper, we propose a new Fully Composite Formulation of convex optimization problems. It includes, as a particular case, the problems with functional constraints, max-type minimization problems, and problems of Composite…
When a proposition has no proof in an inference system, it is sometimes useful to build a counter-proof explaining, step by step, the reason of this non-provability. In general, this counter-proof is a (possibly) infinite co-inductive proof…
This article introduces a pedagogical method for {\it solving combinatorial problems} that frequently involve structures that are unfamiliar or less familiar. Indeed, an indirect method has been proposed in order to evade any possible…
The paper aims to show the equivalency between nonlinear complementarity problem and the system of nonlinear equations. We propose a homotopy method with vector parameter $\lambda$ in finding the solution of nonlinear complementarity…
Equivalencies of many basic elementary inequalities are given
The expression problem describes a fundamental tradeoff between two types of extensibility: extending a type with new operations, such as by pattern matching on an algebraic data type in functional programming, and extending a type with new…
We estimate the number of integer solutions to decomposable form inequalities (both asymptotic estimates and upper bounds are provided) when the degree of the form and the number of variables are relatively prime. These estimates display…
In this study, a new form of quadratic spline is obtained, where the coefficients are determined explicitly by variational methods. Convergence is studied and parity conservation is demonstrated. Finally, the method is applied to solve…
Recently developed simple approach for the exact/approximate solution of Schrodinger equations with constant/position-dependent mass, in which the potential is considered as in the perturbation theory, is shown to be equivalent to the one…
We consider certain systems of three linked simultaneous diagonal equations in ten variables with total degree exceeding five. By means of a complification argument, we obtain an asymptotic formula for the number of integral solutions of…
The method of self-similar factor approximants is shown to be very convenient for solving different evolution equations and boundary-value problems typical of physical applications. The method is general and simple, being a straightforward…
In this paper, we present a new smoothing approach to solve general nonlinear complementarity problems. Under the $P_0$ condition on the original problems, we prove some existence and convergence results . We also present an error estimate…
The evaluation of a matrix exponential function is a classic problem of computational linear algebra. Many different methods have been employed for its numerical evaluation [Moler C and van Loan C 1978 SIAM Review 20 4], none of which…
We present a novel integral representation for the biharmonic Dirichlet problem. To obtain the representation, the Dirichlet problem is first converted into a related Stokes problem for which the Sherman-Lauricella integral representation…
We show that the intuitionistic first-order theory of equality has continuum many complete extensions. We also study the Vitali equivalence relation and show there are many intuitionistically precise versions of it.
The concept of representing a polytope that is associated with some combinatorial optimization problem as a linear projection of a higher-dimensional polyhedron has recently received increasing attention. In this paper (written for the…