论文信息 - On Bounding Solutions of Underdetermined Systems

On Bounding Solutions of Underdetermined Systems

Sufficient conditions for the existence and uniqueness of a solution x* ∈ D ⫃ (Rn) of Y⫃(x) = 0 where ⫃ : Rn → Rm (m ≤ n) with ⫃ ∈ C2(D) where D ⫃ Rn is an open convex set and Y = ⫃′(x)+ are given, and are compared with similar results due to Zhang, Li and Shen (Reliable Computing5(1) (1999)). An algorithm for bounding zeros of f (·) is described, and numerical results for several examples are given.

Michael A. Wolfe

[2] James T. Smith. Iterative Solution of Systems of Equations , 1999 .

[3] L. Qi. A Note on the Moore Test for Nonlinear Systems , 1982 .

[4] G. Alefeld,et al. Introduction to Interval Computation , 1983 .

[5] T. Greville. The Pseudoinverse of a Rectangular or Singular Matrix and Its Application to the Solution of Systems of Linear Equations , 1959 .

[6] Kiyotaka Yamamura,et al. An algorithm for representing functions of many variables by superpositions of functions of one variable and addition , 1996 .

[7] R. Penrose. A Generalized inverse for matrices , 1955 .

[8] K. Yamamura,et al. Interval solution of nonlinear equations using linear programming , 1998 .

[9] A. Neumaier. Interval methods for systems of equations , 1990 .

[10] Adi Ben-Israel,et al. Generalized inverses: theory and applications , 1974 .

[11] C. D. Meyer,et al. Generalized inverses of linear transformations , 1979 .

[12] T. Greville,et al. Some Applications of the Pseudoinverse of a Matrix , 1960 .

[13] H. Walker,et al. Least-change secant update methods for undetermined systems , 1990 .