A modified least squares FE-method for ideal fluid flow problems
Neittaanmäki, P., Saranen, J. (1982). A modified least squares FE-method for ideal fluid flow problems. Journal of Computational and Applied Mathematics, 8 (3), 165-170. doi:10.1016/0771-050X(82)90038-9
Published in
Journal of Computational and Applied MathematicsDate
1982Copyright
© Elsevier
A modified least squares FE-method suitable e.g. for calculating the ideal fluid flow is presented. It turns out to be essentially more efficient than the conventional least squares method.
Publisher
ElsevierISSN Search the Publication Forum
0377-0427Metadata
Show full item recordCollections
License
Related items
Showing items with similar title or keywords.
-
A Quantitative Method for Localizing User Interface Problems : The D-Teo Method
Lamminen, Juha; Leppänen, Mauri; Heikkinen, Risto; Kämäräinen, Anna; Jokisuu, Elina (University of Jyväskylä, Agora Center, 2009)A large array of evaluation methods have been proposed to identify Website usability problems. In log-based evaluation, information about the performance of users is collected and stored into log files, and used to find ... -
Mathematical programming methods for an optimal shape design problem
Neittaanmäki, Pekka; Tiihonen, Timo (Wiley, 1984) -
A Steepest Descent Method for the Approximation of the Boundary Control in Two-Phase Stefan Problem
Neittaanmäki, Pekka; Tiba, D. (Cluj-Napoca : Éditions de l'Académie Roumaine, 1987) -
Overlapping doman decomposition methods for the obstacle problem
Kuznetsov, Yuri A.; Neittaanmäki, Pekka; Tarvainen, Pasi (American Mathematical Society, 1994)In this paper overlapping domain decomposition methods are applied to the numerical solution of nonlinear grid variational problems arising from the approximation of the obstacle problem by the piecewise linear finite ... -
Parallel finite element splitting-up method for parabolic problems
Tai, Xue-Cheng; Neittaanmäki, Pekka (Wiley, 1991)An efficient method for solving parabolic systems is presented. The proposed method is based on the splitting‐up principle in which the problem is reduced to a series of independent 1D problems. This enables it to be used ...