Search results for "Linear system"
showing 10 items of 1558 documents
The fixed point property for mappings admitting a center
2007
Abstract We introduce a class of nonlinear continuous mappings in Banach spaces which allow us to characterize the Banach spaces without noncompact flat parts in their spheres as those that have the fixed point property for this type of mapping. Later on, we give an application to the existence of zeroes for certain kinds of accretive operators.
Weighted-Power p Nonlinear Subdivision Schemes
2012
In this paper we present and analyze a generalization of the Powerp subdivision schemes proposed in [3,12]. The Weighted-Powerp schemes are based on a harmonic weighted version of the Power<emp average considered in [12], and their development is motivated by the desire to generalize the nonlinear analysis in [3,5] to interpolatory subdivision schemes with higher than second order accuracy.
A non-linear version of Hunt-Lion's theorem from the point of view of T-accretivity
1992
In the classical topological context, Dellacherie [10] has given a non-linear version of Hunt's theorem characterizing the proper kernels verifying the complete maximum principle as those closing a submarkovian resolvent. In this paper we study the relation between this non-linear version of Hunt's theorem and T-accretivity.
Nonlinear systems solver in floating-point arithmetic using LP reduction
2009
This paper presents a new solver for systems of nonlinear equations. Such systems occur in Geometric Constraint Solving, e.g., when dimensioning parts in CAD-CAM, or when computing the topology of sets defined by nonlinear inequalities. The paper does not consider the problem of decomposing the system and assembling solutions of subsystems. It focuses on the numerical resolution of well-constrained systems. Instead of computing an exponential number of coefficients in the tensorial Bernstein basis, we resort to linear programming for computing range bounds of system equations or domain reductions of system variables. Linear programming is performed on a so called Bernstein polytope: though,…
Nonlinear embeddings: Applications to analysis, fractals and polynomial root finding
2016
We introduce $\mathcal{B}_{\kappa}$-embeddings, nonlinear mathematical structures that connect, through smooth paths parameterized by $\kappa$, a finite or denumerable set of objects at $\kappa=0$ (e.g. numbers, functions, vectors, coefficients of a generating function...) to their ordinary sum at $\kappa \to \infty$. We show that $\mathcal{B}_{\kappa}$-embeddings can be used to design nonlinear irreversible processes through this connection. A number of examples of increasing complexity are worked out to illustrate the possibilities uncovered by this concept. These include not only smooth functions but also fractals on the real line and on the complex plane. As an application, we use $\mat…
Fixed-Point Theorems in Complete Gauge Spaces and Applications to Second-Order Nonlinear Initial-Value Problems
2013
We establish fixed-point results for mappings and cyclic mappings satisfying a generalized contractive condition in a complete gauge space. Our theorems generalize and extend some fixed-point results in the literature. We apply our obtained results to the study of existence and uniqueness of solution to a second-order nonlinear initial-value problem.
On a normal form of symmetric maps of [0, 1]
1980
A class of continuous symmetric mappings of [0, 1] into itself is considered leaving invariant a measure absolutely continuous with respect to the Lebesgue measure.
Farkas-Minkowski systems in semi-infinite programming
1981
The Farkas-Minkowski systems are characterized through a convex cone associated to the system, and some sufficient conditions are given that guarantee the mentioned property. The role of such systems in semi-infinite programming is studied in the linear case by means of the duality, and, in the nonlinear case, in connection with optimality conditions. In the last case the property appears as a constraint qualification.
New Results on Identifiability of Nonlinear Systems
2004
Abstract In this paper, we recall definition of identifiability of nonlinear systems. We prove equivalence between identifiability and smooth identifiability. This new result justifies our definition of identifiability. In a previous paper (Busvelle and Gauthier, 2003), we have established that • If the number of observations is three or more, then, systems are generically identifiable. • If the number of observations is 1 or 2, then the situation is reversed. Identifiability is not at all generic. Also, we have completely classified infinitesimally identifiable systems in the second case, and in particular, we gave normal forms for identifiable systems. Here, we will give similar results i…
Elementary (-1)-curves of P-3
2006
In this note we deal with rational curves in P^3 which are images of a line by means of a finite sequence of cubo-cubic Cremona transformations. We prove that these curves can always be obtained applying to the line a sequence of such transformations increasing at each step the degree of the curve. As a corollary we get a result about curves that can give speciality for linear systems of P^3.