A Galerkin approximation method including space dimensional reduction - applied for solution of a heat conduction equation

• Autorzy: Nakonieczny K.
• Języki publikacji: EN

Abstrakty

EN

A multivariate data fitting procedure, based on the Galerkin minimization method, is studied in this paper. The main idea of the developed approach consists in projecting the set of data points from the original, higher-dimensional space, onto a line section. Then, the approximation problem is solved in the resulting one-dimensional space. The elaborated recipe can be designed so that it is computationally more efficient than the schemes based on the least squares minimization. The performance of the method is studied by comparison with the least squares and the moving least squares procedures in a number of examples, including the solution of the heat diffusion equation.

Słowa kluczowe

EN

Galerkin approximation; dimensional reduction; heat conduction

• Wydawca: Polskie Towarzystwo Promocji Wiedzy ; Lublin University of Technology
• Czasopismo: Applied Computer Science
• Rocznik: 2012
• Tom: Vol. 8, no 2
• Strony: 48--58
• Opis fizyczny: Bibliogr. 11 poz., fig., tab.

Twórcy

autor

Nakonieczny K.

• Wydział Mechaniczny, Politechnika Lubelska, 20-618 Lublin, ul. Nadbystrzycka 36

Bibliografia

• [1] Mitchell A.R., Wait R. (Eds.): The finite element method in partial differential equations. Wiley, Chichester, 1977.
• [2] Zienkiewicz O.C., Taylor R.L., Zhu J.Z. (Eds.): Finite Element Method – Its Basics and Fundamentals, KNovel Library, Elsevier, 2005.
• [3] Belytschko T., Krongauz Y., Organ D., Fleming M., Krysl P.: Meshless methods: an overview and recent developments. Comput. Methods Appl. Mech. Engrg., 139, 1996, 3-47.
• [4] Liu G.R.: Mesh Free Methods: Moving Beyond the Finite Element Method. CRC Press, 2002.
• [5] Lancaster P., Salkauskas K.: Surfaces generated by Moving Least Squares Methods. Math. Comp., 37, 1981, 141-158.
• [6] Wendland H.: Local polynomial reproduction and moving least squares approximation. IMA J. Num. Anal., 21, 2001, 285-300.
• [7] Breitkopf P., Rassineux A., Touzot G., Villon P.: Explicit form and efficient computation of MLS shape functions and their derivatives. Int. J. Numer. Meth. Engng, 48, 2000, 451-466.
• [8] Fasshauer G.E.: Matrix-free multilevel moving least squares methods, in: C.K. Chui, L.L. Schumaker, J. Stőckler (Eds.), Approximation Theory X: Wavelets, Splines and Applications. Vanderbilt University Press, 2002, 271-281.
• [9] Fasshauer G.E.: Towards approximate moving least squares approximation with irregularly spaced centers. Comput. Methods Appl. Mech. Engrg, 194, 2004,1231-1243.
• [10] Fasshauer G.E., Zhang J.G.: Iterated approximate moving least squares approximation, in: V.M.A. Leitao, C. Alves and C.A. Duarte (Eds.), Advances in Meshfree Techniques. Springer, Netherlands, 2007.
• [11] Mount D.M., Arya S.: ANN: a library for approximate nearest neighbor searching. available from <http://www.cs.umd.edu/~mount/ANN>.