OPTIMUM TIME STEP FOR DYNAMIC RELAXATION METHOD

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

ALAMATIAN J.; KADKHODAIAN M.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: AMIRKABIR Year:2007 | Volume:17 | Issue:65-C Page(s): 43-51

Download Full-Text

Persian Verion

View:

746

Download:

Cites:

Information Journal Paper

Title

OPTIMUM TIME STEP FOR DYNAMIC RELAXATION METHOD

Author(s)

ALAMATIAN J. | KADKHODAIAN M. | Issue Writer Certificate

Keywords

DYNAMIC RELAXATIONQ2

TIME STEPQ3

RESIDUAL FORCEQ3

LINEAR AND GEOMETRICAL NON LINEAR ANALYSISQ3

Abstract

DYNAMIC RELAXATION is an iterative technique, which is used as an equation solver. In this paper, a new TIME STEP will be formulated for DYNAMIC RELAXATION method. The suggested technique is based on the minimization of RESIDUAL FORCE in each iteration. Mathematical theories and numerical examples are used to verify efficiency of the formulation. By using optimum TIME STEP, mathematical convergence rank of DR algorithm will be infinite and two in linear and nonlinear analyses, respectively. To investigate the capability of the proposed formulation, isotropic plates and frame structure by linear and geometrical nonlinear behaviors are analyzed. This study shows that optimum TIME STEP reduces number of convergence iterations.Therefore, the cost and the computational time will be reduced. As a result, the suggested formulation for optimum TIME STEP has higher mathematical and numerical efficiency than other common methods, such as constant TIME STEP. Therefore, the convergence rate of DR iterations will considerably improve.

Cites

No record.

References

No record.

Cite

APA: Copy

ALAMATIAN, J., & KADKHODAIAN, M.. (2007). OPTIMUM TIME STEP FOR DYNAMIC RELAXATION METHOD. AMIRKABIR, 17(65-C), 43-51. SID. https://sid.ir/paper/992/en

Vancouver: Copy

ALAMATIAN J., KADKHODAIAN M.. OPTIMUM TIME STEP FOR DYNAMIC RELAXATION METHOD. AMIRKABIR[Internet]. 2007;17(65-C):43-51. Available from: https://sid.ir/paper/992/en

IEEE: Copy

J. ALAMATIAN, and M. KADKHODAIAN, “OPTIMUM TIME STEP FOR DYNAMIC RELAXATION METHOD,” AMIRKABIR, vol. 17, no. 65-C, pp. 43–51, 2007, [Online]. Available: https://sid.ir/paper/992/en

Related Journal Papers