Minimum norm solutions of single stiff linear analytic differential equations
نویسندگان
چکیده
منابع مشابه
On the Order of Solutions of Analytic Linear Differential Equations
(1) d/dxX(z) = A{z)X{z), where X(z) is an n x 1 column vector and A(z) is an n x n matrix of singlevalued meromorphic functions in a neighbourhood of the (isolated) singular point 0. Sometimes we write A instead of A(z) but we always consider a matrix of functions with such a notation unless explicitly stated otherwise. Each fundamental solution matrix for (1) can be represented near zero as (2...
متن کاملExact and numerical solutions of linear and non-linear systems of fractional partial differential equations
The present study introduces a new technique of homotopy perturbation method for the solution of systems of fractional partial differential equations. The proposed scheme is based on Laplace transform and new homotopy perturbation methods. The fractional derivatives are considered in Caputo sense. To illustrate the ability and reliability of the method some examples are provided. The results ob...
متن کاملAnalytic Solutions for Iterative Functional Differential Equations
Because of its technical difficulties the existence of analytic solutions to the iterative differential equation x′(z) = x(az + bx(z) + cx′(z)) is a source of open problems. In this article we obtain analytic solutions, using Schauder’s fixed point theorem. Also we present a unique solution which is a nonconstant polynomial in the complex field.
متن کاملThe geometry of basic, approximate, and minimum norm solutions of linear equations
The basic solutions of the linear equation Ax = b , are the solutions of subsystems corresponding to maximal nonsingular submatrices of A. The convex hull of the basic solutions is denoted by C = C(A,b). The residual r(x) of a vector x is r := Ax − b. Given 1 ≤ p ≤ ∞, the lp-approximate solutions of Ax = b, denoted x , are minimizers of ‖r(x)‖p. Given M ∈ Dm, the set of positive diagonal m×m ma...
متن کاملGuaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the literature of a diverse set of fields including system identification and control, Euclidean embedding, and collaborative filtering. Although specific instances can often be solved with specialized algorithms, the gene...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1975
ISSN: 0022-247X
DOI: 10.1016/0022-247x(75)90104-3