Temat: Conjugate - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Operator-splitting and Lagrange multiplier domain decomposition methods for numerical simulation of two coupled Navier-Stokes fluids
Autorzy:: Bresch, D.
Koko, J.
Powiązania:: https://bibliotekanauki.pl/articles/908383.pdf
Data publikacji:: 2006
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: dwoistość
gradient sprzężony
przepływ Naviera-Stokesa
domain decomposition
duality
conjugate gradient
Navier-Stokes flows
Opis:: We present a numerical simulation of two coupled Navier-Stokes flows, using operator-splitting and optimization-based nonoverlapping domain decomposition methods. The model problem consists of two Navier-Stokes fluids coupled, through a common interface, by a nonlinear transmission condition. Numerical experiments are carried out with two coupled fluids; one with an initial linear profile and the other in rest. As expected, the transmission condition generates a recirculation within the fluid in rest.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2006, 16, 4; 419-429
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: Newtons iteration with a conjugate gradient based decomposition method for an elliptic PDE with a nonlinear boundary condition
Autorzy:: Koko, J.
Powiązania:: https://bibliotekanauki.pl/articles/907312.pdf
Data publikacji:: 2004
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: metoda Newtona
metoda gradientu sprzężonego
warunek brzegowy nieliniowy
Newton's method
conjugate gradient method
nonlinear PDE
Opis:: Newton's iteration is studied for the numerical solution of an elliptic PDE with nonlinear boundary conditions. At each iteration of Newton's method, a conjugate gradient based decomposition method is applied to the matrix of the linearized system. The decomposition is such that all the remaining linear systems have the same constant matrix. Numerical results confirm the savings with respect to the computational cost, compared with the classical Newton method with factorization at each step.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2004, 14, 1; 13-18
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 3.

Tytuł:: On the Choice of Subspace for Iterative Methods for Linear Discrete Ill-Posed Problems
Autorzy:: Calvetti, D.
Lewis, B.
Reichel, L.
Powiązania:: https://bibliotekanauki.pl/articles/908057.pdf
Data publikacji:: 2001
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: metoda sprzężonych gradientów
problem niewłaściwie postawiony
minimal residual method
conjugate gradient method
ill-posed problems
Opis:: Many iterative methods for the solution of linear discrete ill-posed problems with a large matrix require the computed approximate solutions to be orthogonal to the null space of the matrix. We show that when the desired solution is not smooth, it may be possible to determine meaningful approximate solutions with less computational work by not imposing this orthogonality condition.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2001, 11, 5; 1069-1092
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 4.

Tytuł:: Two implementations of the preconditioned conjugate gradient method on heterogeneous computing grids
Autorzy:: Collignon, T. P.
Van Gijzen, M. B.
Powiązania:: https://bibliotekanauki.pl/articles/907778.pdf
Data publikacji:: 2010
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: przetwarzanie siatkowe
system liniowy
metoda iteracyjna
gradient sprzężony
przepływ pęcherzykowy
grid computing
large sparse linear systems
iterative methods
conjugate gradient method
Chronopoulos/Gear CG
GridSolve middleware
bubbly flows
Opis:: Efficient iterative solution of large linear systems on grid computers is a complex problem. The induced heterogeneity and volatile nature of the aggregated computational resources present numerous algorithmic challenges. This paper describes a case study regarding iterative solution of large sparse linear systems on grid computers within the software constraints of the grid middleware GridSolve and within the algorithmic constraints of preconditioned Conjugate Gradient (CG) type methods. We identify the various bottlenecks induced by the middleware and the iterative algorithm. We consider the standard CG algorithm of Hestenes and Stiefel, and as an alternative the Chronopoulos/Gear variant, a formulation that is potentially better suited for grid computing since it requires only one synchronisation point per iteration, instead of two for standard CG. In addition, we improve the computation-to-communication ratio by maximising the work in the preconditioner. In addition to these algorithmic improvements, we also try to minimise the communication overhead within the communication model currently used by the GridSolve middleware. We present numerical experiments on 3D bubbly flow problems using heterogeneous computing hardware that show lower computing times and better speed-up for the Chronopoulos/Gear variant of conjugate gradients. Finally, we suggest extensions to both the iterative algorithm and the middleware for improving granularity.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2010, 20, 1; 109-121
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "Conjugate" wg kryterium: Temat

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język