Cauchy problem for overdetermined systems

Sunto Si caratterizzano le nozioni di direzioni caratteristiche, formalmente caratteristiche, di iperbolicità e di evoluzione in una, direzione per sistemi a coefficienti costanti, connesse allo studio delle soluzioni del problema di Cauchy in un semispazio.     

Transformation of high order linear differential-algebraic systems to first order

We study general nonsquare linear systems of differential-algebraic systems of arbitrary order. We analyze the classical procedure of turning the system into a first order system and demonstrate that this approach may lead to different solvability results and smoothness requirements. We present several examples that demonstrate this phenomenon and then derive existence and uniqueness results for differential-algebraic systems of arbitrary order and index. We use these results to identify exactly those variables for which the order reduction to first order does not lead to extra smoothness requirements and demonstrate the effects of this new formulation with a numerical example.Dedicated to Richard S. Varga on the occasion of his 77th birthday.     

Chebyshev solution of overdetermined systems of linear equations

A simplex algorithm for the Chebyshev solution of overdetermined systems of linear equations is described. In this algorithm, an initial basic feasible solution is available with no artificial variables needed. Also minimum storage is required and no conditions are imposed on the coefficient matrix. The algorithm is a simple and fast one. Numerical results are given.     

Maximal subspaces for solutions of the second order abstract cauchy problem

For a continuous, increasing function ω: R → R \{0} of finite exponential type, this paper introduces the set Z(A, ω) of all x in a Banach space X for which the second order abstract differential equation (2) has a mild solution such that [ω(t)]-1u(t,x) is uniformly continues on R , and show that Z(A, ω) is a maximal Banach subspace continuously embedded in X, where A ∈ B(X) is closed. Moreover, A|z(A,ω) generates an O(ω(t))strongly continuous cosine operator function family.     

An overdetermined problem in nonlinear elliptic equations of second order

We define some functionals involvingu(x) andx'u _i , whereu(x) is a classical solution of the equation (q ^p-2 u _i ) _i +k(u)q ^p =0,p > 1, and prove that such functionals satisfy a second order elliptic differential equation. By a suitable choice of such functionals we investigate an overdetermined problem.Partially supported by Regione Autonoma della Sardegna.     

Sturm comparison and separation theorems for linear,second order,self-adjoint,ordinary, differential equations and for first order systems

Sturm comparison and separation theorems, for first order linear combinations of solutions of linear, second order, self-adjoint, ordinary, differential equations, are obtained as consequences of Sturm comparison and separation theorems for linear combinations of components of solutions of linear, first order systems of ordinary, differential equations.     

Formulae of partial reduction for linear systems of first order operator equations

This paper deals with the reduction of non-homogeneous linear systems of first order operator equations with constant coefficients. An equivalent reduced system, consisting of higher order linear operator equations having only one variable and first order linear operator equations in two variables, is obtained by using the rational canonical form.     

A projection method for least-squares solutions to overdetermined systems of linear inequalities

An algorithm previously introduced by the author for finding a feasible point of a system of linear inequalities is further investigated. For inconsistent systems, it is shown to generate a sequence converging at a linear rate to the set of least-squares solutions. The algorithm is a projection-type method, and is a manifestation of the proximal-point algorithm.     

A penalty continuation method for the ∓∞ solution of overdetermined linear systems

A new algorithm for the ∓_∞ solution of overdetermined linear systems is given. The algorithm is based on the application of quadratic penalty functions to a primal linear programming formulation of the ∓_∞ problem. The minimizers of the quadratic penalty function generate piecewise-linear non-interior paths to the set of ∓_∞ solutions. It is shown that the entire set of ∓_∞ solutions is obtained from the paths for sufficiently small values of a scalar parameter. This leads to a finite penalty/continuation algorithm for ∓_∞ problems. The algorithm is implemented and extensively tested using random and function approximation problems. Comparisons with the Barrodale-Phillips simplex based algorithm and the more recent predictor-corrector primal-dual interior point algorithm are given. The results indicate that the new algorithm shows a promising performance on random (non-function approximation) problems.     

Asymptotic solution of the cauchy problem for a singularly perturbed linear system

We construct the asymptotics of the solution of the Cauchy problem for a degenerate singularly perturbed linear system in the case of multiple spectrum of the principal operator. Nezhin Pedagogic University, Nezhin. Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 51, No. 8, pp. 1126–1128, August, 1999,