Related papers: A simple proof for Kazmi et al.'s iterative scheme

Results about existence and uniqueness of solutions of initial value problem for certain types of partial differential equations are recalled as well as iterative scheme and an error estimate for approximate solutions obtained using this…

In this paper, a simple proof is presented for the convergence of the algorithms for the class of relaxed $(u, v)$-cocoercive mappings and $\alpha$-inverse strongly monotone mappings. Based on $\alpha$-expansive maps, for example, a simple…

We investigate the use of piecewise linear systems, whose coefficient matrix is a piecewise constant function of the solution itself. Such systems arise, for example, from the numerical solution of linear complementarity problems and in the…

Using recent development in motivic infinite loop space theory, we offer short and conceptual reproofs of some conjectures of Voevodsky's on the slice filtration using the birational geometry of Hilbert schemes. The original proofs were due…

This paper studies the proof of Collatz conjecture for some set of sequence of odd numbers with infinite number of elements. These set generalized to the set which contains all positive odd integers. This extension assumed to be the proof…

Piontkowski proved the existence of affine cell decompositions of Jacobian factors of plane curve singularities with a single Puiseux pair. He also provided a combinatorial description of the Euler numbers and Betti numbers of these…

This paper presents a general coding method where data in a Hilbert space are represented by finite dimensional coding vectors. The method is based on empirical risk minimization within a certain class of linear operators, which map the set…

We generalize the Bialynicki-Birula decomposition to singular schemes and apply it to the Hilbert scheme of points on an affine space. We find an infinite family of small, elementary and generically smooth components of the Hilbert scheme…

Gotzmann's persistence theorem provides a method for determining the Hilbert polynomial of a subscheme of projective space by evaluating the Hilbert function at only two points, irrespective of the dimension of the ambient space. In…

We show that iterative scheme due to Karahan and \"Ozdemir (2013) can be used to approximate fixed point of contraction mappings. Furthermore, we prove that CR iterative scheme converges faster than the iterative scheme due to Karahan and…

We derive an algorithm to produce explicit formulas for certain generating functions of double Hurwitz numbers. These formulas generalize a formula of Goulden, Jackson and Vakil for one part double Hurwitz numbers. Immediate consequences…

We consider the iterative solution of anisotropic radiative transfer problems using residual minimization over suitable subspaces. We show convergence of the resulting iteration using Hilbert space norms, which allows us to obtain…

In their recent SIAM J. Control Optim. paper from 2009, J. Eckstein and B.F. Svaiter proposed a very general and flexible splitting framework for finding a zero of the sum of finitely many maximal monotone operators. In this short note, we…

We comment on two formal proofs of Fermat's sum of two squares theorem, written using the Mathematical Components libraries of the Coq proof assistant. The first one follows Zagier's celebrated one-sentence proof; the second follows David…

For solving the continuous Sylvester equation, a class of the multiplicative splitting iteration method is presented. We consider two symmetric positive definite splittings for each coefficient matrix of the continuous Sylvester equations…

In this paper we provide a new method to certify that a nearby polynomial system has a singular isolated root with a prescribed multiplicity structure. More precisely, given a polynomial system f $=(f\_1, \ldots, f\_N)\in C[x\_1, \ldots,…

Linear-time computational techniques have been developed for combining evidence which is available on a number of contending hypotheses. They offer a means of making the computation-intensive calculations involved more efficient in certain…

We present a set of new, efficient high-order symplectic methods designed for Hamiltonian systems with cubic or quartic potentials. By demonstrating that polynomial potentials require fewer order conditions, we develop schemes that…

We consider a new splitting based on the Sherman-Morrison-Woodbury formula, which is particularly effective with iterative methods for the numerical solution of large linear systems. These systems involve matrices that are perturbations of…

The criterion for an affine primary algebra over the field to be integral, is proven. Using this criterion we give a simple proof that Hilbert scheme of 0-dimensional subschemes of length $l$ of nonsingular $d$-dimensional algebraic variety…