Related papers: Smooth solutions of a class of iterative functiona…
In this paper, we propose a new method that combines the inexact Newton method with a procedure to obtain a feasible inexact projection for solving constrained smooth and nonsmooth equations. The local convergence theorems are established…
The Implicit and Inverse Function Theorems are special cases of a general Implicit/Inverse Function Theorem which can be easily derived from either theorem. The theorems can thus be easily deduced from each other via the generalized…
Let $C_1$ and $C_2$ be two Cantor sets with convex hull $[0,1]$. Newhouse proved if $\tau(C_1)\cdot \tau(C_2)\geq 1$, then the arithmetic sum $C_1+C_2$ is an interval, where $\tau(C_i), 1\leq i\leq 2$ denotes the thickness of $C_i$. In this…
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 the notion of the composita, we obtain a method of solving iterative functional equations of the form $A^{2^n}(x)=F(x)$, where $F(x)=\sum_{n>0} f(n)x^n$, $f(1)\neq 0$. We prove that if $F(x)=\sum_{n>0} f(n)x^n$ has integer…
The present author recently proposed and proved a relationship theorem between nonlinear polynomial equations and the corresponding Jacobian matrix. By using this theorem, this paper derives a Newton iterative formula without requiring the…
We prove a compact embedding theorem in a class of spaces of piecewise H1 functions subordinated to a class of shape regular, but not necessarily quasi-uniform triangulations of a polygonal domain. This result generalizes the…
We define a family of $C^1$ functions which we call "nowhere coexpanding functions" that is closed under composition and includes all $C^3$ functions with non-positive Schwarzian derivative. We establish results on the number and nature of…
Given the matrix equation ${\bf A X} + {\bf X B} + f({\bf X }) {\bf C} ={\bf D}$ in the unknown $n\times m$ matrix ${\bf X }$, we analyze existence and uniqueness conditions, together with computational solution strategies for $f \,:…
In this paper we consider a class of conjugate equations, which generalizes de Rham's functional equations. We give sufficient conditions for existence and uniqueness of solutions under two different series of assumptions. We consider…
Compositional simulation is challenging, because of highly nonlinear couplings between multi-component flow in porous media with thermodynamic phase behavior. The coupled nonlinear system is commonly solved by the fully-implicit scheme.…
In this paper, we consider the existence and uniqueness of weak solutions of a nonlinear elliptic equation with a variable exponent, a monotonic type operator and a convection term. With the topological degree theory, we prove the existence…
When given a class of functions and a finite collection of sets, one might be interested whether the class in question contains any function whose domain is a subset of the union of the sets of the given collection and whose restrictions to…
We present an extension to the $\mathtt{mathlib}$ library of the Lean theorem prover formalizing the foundations of computability theory. We use primitive recursive functions and partial recursive functions as the main objects of study, and…
Taylor's theorem (and its variants) is widely used in several areas of mathematical analysis, including numerical analysis, functional analysis, and partial differential equations. This article explains how Taylor's theorem in its most…
We show that if a Laurent series $f\in\mathbb{C}((t))$ satisfies a particular kind of linear iterative equation, then $f$ is either a rational function or it is differentially transcendental over $\mathbb{C}(t)$. This condition is more…
We prove two versions of a global implicit function theorem, which involve no loss of derivative, for Keller's $ C_c^1 $-mappings between arbitrary Fr\'{e}chet spaces. Subsequently, within this framework, we apply these theorems to…
New iterative methods for solving linear equations are presented that are easy to use, generalize good existing methods, and appear to be faster. The new algorithms mix two kinds of linear recurrence formulas. Older methods have either high…
Determination of linear combination of exponential functions with unknown rate constants from its sampled values is a problem of considerable interest. Here we present a constructive and explicit solution to this problem. Moments of such…
By using the degree theory and the $\tau-$topology of Kryszewski and Szulkin, we establish a version of the Fountain Theorem for strongly indefinite functionals. The abstract result will be applied for studying the existence of infinitely…