메뉴 건너뛰기




Volumn 215, Issue 1, 2009, Pages 405-413

LP narrowing: A new strategy for finding all solutions of nonlinear equations

Author keywords

Dual simplex method; Finding all solutions; Interval analysis; Linear programming; Nonlinear equation

Indexed keywords

COMPUTATION TIME; DUAL SIMPLEX METHOD; EFFICIENT ALGORITHM; FINDING ALL SOLUTIONS; INTERVAL ANALYSIS; LINEAR PROGRAMMING TECHNIQUES; NEW STRATEGY; NUMERICAL EXAMPLE;

EID: 67949094308     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2009.05.017     Document Type: Article
Times cited : (18)

References (25)
  • 2
    • 0005474680 scopus 로고
    • A new class of interval methods with higher order of convergence
    • Alefeld G., and Potra F. A new class of interval methods with higher order of convergence. Computing 42 (1989) 69-80
    • (1989) Computing , vol.42 , pp. 69-80
    • Alefeld, G.1    Potra, F.2
  • 3
    • 0002949522 scopus 로고
    • Simplicial and continuation methods for approximating fixed points and solutions to systems of equations
    • Allgower E., and Georg K. Simplicial and continuation methods for approximating fixed points and solutions to systems of equations. SIAM Rev. 22 (1980) 28-85
    • (1980) SIAM Rev. , vol.22 , pp. 28-85
    • Allgower, E.1    Georg, K.2
  • 4
    • 0037337714 scopus 로고    scopus 로고
    • A new exclusion test
    • Georg K. A new exclusion test. J. Comput. Appl. Math. 152 (2003) 147-160
    • (2003) J. Comput. Appl. Math. , vol.152 , pp. 147-160
    • Georg, K.1
  • 5
    • 33745226980 scopus 로고    scopus 로고
    • RealPaver: an interval solver using constraint satisfaction techniques
    • Granvilliers L., and Benhamou F. RealPaver: an interval solver using constraint satisfaction techniques. ACM Trans. Math. Softw. 32 (2006) 138-156
    • (2006) ACM Trans. Math. Softw. , vol.32 , pp. 138-156
    • Granvilliers, L.1    Benhamou, F.2
  • 6
    • 0019690663 scopus 로고
    • Bounding solutions of systems of equations using interval analysis
    • Hansen E.R., and Sengupta S. Bounding solutions of systems of equations using interval analysis. BIT 21 (1981) 203-211
    • (1981) BIT , vol.21 , pp. 203-211
    • Hansen, E.R.1    Sengupta, S.2
  • 8
    • 0000916423 scopus 로고
    • Interval arithmetic techniques in the computational solution of nonlinear systems of equations: introduction, examples, and comparisons
    • Computational Solution of Nonlinear Systems of Equations. Allgower E.L., and Georg K. (Eds), American Mathematical Society, Providence, RI
    • Kearfott R.B. Interval arithmetic techniques in the computational solution of nonlinear systems of equations: introduction, examples, and comparisons. In: Allgower E.L., and Georg K. (Eds). Computational Solution of Nonlinear Systems of Equations. Lectures in Applied Mathematics vol. 26 (1990), American Mathematical Society, Providence, RI 337-357
    • (1990) Lectures in Applied Mathematics , vol.26 , pp. 337-357
    • Kearfott, R.B.1
  • 9
    • 0004217246 scopus 로고    scopus 로고
    • Kearfott R.B., and Kreinovich V. (Eds), Kluwer Academic Publishers, Dordrecht
    • In: Kearfott R.B., and Kreinovich V. (Eds). Applications of Interval Computations (1996), Kluwer Academic Publishers, Dordrecht
    • (1996) Applications of Interval Computations
  • 10
    • 0000446186 scopus 로고
    • Newton-algorithmen zur bestimmung von nullstellen mit fehlerschranken
    • Krawczyk R. Newton-algorithmen zur bestimmung von nullstellen mit fehlerschranken. Computing 4 (1969) 187-201
    • (1969) Computing , vol.4 , pp. 187-201
    • Krawczyk, R.1
  • 11
    • 14644426280 scopus 로고    scopus 로고
    • Efficient and safe global constraints for handling numerical constraint systems
    • Lebbah Y., Michel C., Rueher M., Daney D., and Merlet J.-P. Efficient and safe global constraints for handling numerical constraint systems. SIAM J. Numer. Anal. 42 (2005) 2076-2097
    • (2005) SIAM J. Numer. Anal. , vol.42 , pp. 2076-2097
    • Lebbah, Y.1    Michel, C.2    Rueher, M.3    Daney, D.4    Merlet, J.-P.5
  • 12
    • 33749662194 scopus 로고    scopus 로고
    • Existence test for solution of nonlinear systems applying affine arithmetic
    • Miyajima S., and Kashiwagi M. Existence test for solution of nonlinear systems applying affine arithmetic. J. Comput. Appl. Math. 199 (2007) 304-309
    • (2007) J. Comput. Appl. Math. , vol.199 , pp. 304-309
    • Miyajima, S.1    Kashiwagi, M.2
  • 14
    • 0003258504 scopus 로고
    • A collection of nonlinear model problems
    • Computational Solution of Nonlinear Systems of Equations. Allgower E.L., and Georg K. (Eds), American Mathematical Society, Providence, RI
    • Moré J.J. A collection of nonlinear model problems. In: Allgower E.L., and Georg K. (Eds). Computational Solution of Nonlinear Systems of Equations. Lectures in Applied Mathematics vol. 26 (1990), American Mathematical Society, Providence, RI 723-762
    • (1990) Lectures in Applied Mathematics , vol.26 , pp. 723-762
    • Moré, J.J.1
  • 16
    • 27144468319 scopus 로고    scopus 로고
    • Nonlinear optimization exclusion tests for finding all solutions of nonlinear equations
    • Syam M.I. Nonlinear optimization exclusion tests for finding all solutions of nonlinear equations. Appl. Math. Comput. 170 (2005) 1104-1116
    • (2005) Appl. Math. Comput. , vol.170 , pp. 1104-1116
    • Syam, M.I.1
  • 17
    • 0005600743 scopus 로고
    • A modification of Krawczyk's algorithm
    • Wolfe M.A. A modification of Krawczyk's algorithm. SIAM J. Numer. Anal. 17 (1980) 376-379
    • (1980) SIAM J. Numer. Anal. , vol.17 , pp. 376-379
    • Wolfe, M.A.1
  • 18
    • 0035370486 scopus 로고    scopus 로고
    • On bounding solutions of underdetermined systems
    • Wolfe M.A. On bounding solutions of underdetermined systems. Reliab. Comput. 7 (2001) 195-207
    • (2001) Reliab. Comput. , vol.7 , pp. 195-207
    • Wolfe, M.A.1
  • 19
    • 0000588791 scopus 로고    scopus 로고
    • A cell exclusion algorithm for determining all the solutions of a nonlinear system of equations
    • Xu Z.-B., Zhang J.S., and Wang W. A cell exclusion algorithm for determining all the solutions of a nonlinear system of equations. Appl. Math. Comput. 80 (1996) 181-208
    • (1996) Appl. Math. Comput. , vol.80 , pp. 181-208
    • Xu, Z.-B.1    Zhang, J.S.2    Wang, W.3
  • 20
    • 0030130215 scopus 로고    scopus 로고
    • An algorithm for representing functions of many variables by superpositions of functions of one variable and addition
    • Yamamura K. An algorithm for representing functions of many variables by superpositions of functions of one variable and addition. IEEE Trans. Circuits Syst. I 43 (1996) 338-340
    • (1996) IEEE Trans. Circuits Syst. I , vol.43 , pp. 338-340
    • Yamamura, K.1
  • 21
    • 0000900077 scopus 로고    scopus 로고
    • Finding all solutions of nonlinear equations using linear combinations of functions
    • Yamamura K. Finding all solutions of nonlinear equations using linear combinations of functions. Reliab. Comput. 6 (2000) 105-113
    • (2000) Reliab. Comput. , vol.6 , pp. 105-113
    • Yamamura, K.1
  • 22
    • 0001601527 scopus 로고    scopus 로고
    • Interval solution of nonlinear equations using linear programming
    • Yamamura K., Kawata H., and Tokue A. Interval solution of nonlinear equations using linear programming. BIT 38 (1998) 186-199
    • (1998) BIT , vol.38 , pp. 186-199
    • Yamamura, K.1    Kawata, H.2    Tokue, A.3
  • 23
    • 0012216756 scopus 로고    scopus 로고
    • Finding all solutions of systems of nonlinear equations using the dual simplex method
    • Yamamura K., and Tanaka S. Finding all solutions of systems of nonlinear equations using the dual simplex method. BIT 42 (2002) 214-230
    • (2002) BIT , vol.42 , pp. 214-230
    • Yamamura, K.1    Tanaka, S.2
  • 24
    • 0037337567 scopus 로고    scopus 로고
    • Finding all solutions of nonlinear equations using the dual simplex method
    • Yamamura K., and Fujioka T. Finding all solutions of nonlinear equations using the dual simplex method. J. Comput. Appl. Math. 152 (2003) 587-595
    • (2003) J. Comput. Appl. Math. , vol.152 , pp. 587-595
    • Yamamura, K.1    Fujioka, T.2
  • 25
    • 0004139889 scopus 로고
    • W.H. Freeman Company, New York p. 158
    • Chvátal V. Linear Programming (1983), W.H. Freeman Company, New York p. 158
    • (1983) Linear Programming
    • Chvátal, V.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.