×

Steepest descent method for system of fuzzy linear equations. (English) Zbl 1088.65026

Summary: The steepest descent method, for solving systems of fuzzy linear equations is considered. The method is discussed in detail and followed by a convergence theorem and illustrated by solving some numerical examples.

MSC:

65F10 Iterative numerical methods for linear systems
08A72 Fuzzy algebraic structures
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Allahviranloo, T., Numerical methods for fuzzy system of linear equations, Appl. Math. Comput., 155, 493-502 (2004) · Zbl 1067.65040
[2] Allahviranloo, T., Successive over relaxation iterative method for fuzzy system of linear equations, Appl. Math. Comput., 162, 189-196 (2005) · Zbl 1062.65037
[3] Allahviranloo, T., The Adomian decomposition method for fuzzy system of linear equations, Appl. Math. Comput., 163, 553-563 (2005) · Zbl 1069.65025
[4] Datta, B. N., Numerical Linear Algebra and Applications (1995), ITP Press: ITP Press New York
[5] Dubois, D.; Prade, H., Fuzzy Sets and Systems: Theory and Application (1980), Academic Press: Academic Press New York
[6] Friedman, M.; Ming, M.; Kandel, A., Fuzzy linear systems, Fuzzy Sets and Systems, 96, 201-209 (1998) · Zbl 0929.15004
[7] Friedman, M.; Ming, M.; Kandel, A., Duality in fuzzy linear systems, Fuzzy Sets and Systems, 109, 55-58 (2000) · Zbl 0945.15002
[8] Goetschell, R.; Voxman, W., Elementary calculus, Fuzzy Sets and Systems, 18, 31-43 (1986)
[9] Ma, M.; Friedman, M.; Kandel, A., A new fuzzy arithmetic, Fuzzy Sets and Systems, 108, 83-90 (1999) · Zbl 0937.03059
[10] Wang, X.; Zhong, Z.; Ha, M., Iteration algorithms for solving a system of fuzzy linear equations, Fuzzy Sets and Systems, 119, 121-128 (2001) · Zbl 0974.65035
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.