|
|
|
Publications in Math-Net.Ru |
Citations |
|
2020 |
| 1. |
N. S. Nedozhogin, S. P. Kopysov, A. K. Novikov, “Parallel solving of linear equations systems on hybrid architecture CPU + GPU”, Vestn. YuUrGU. Ser. Vych. Matem. Inform., 9:2 (2020), 40–54  |
|
2018 |
| 2. |
S. P. Kopysov, I. M. Kuz'min, N. S. Nedozhogin, A. K. Novikov, L. E. Tonkov, “Radial basis function for parallel mesh-to-mesh interpolation in solving fluid-structure interaction problem”, Izv. IMI UdGU, 51 (2018), 42–51   |
1
|
|
2015 |
| 3. |
S. P. Kopysov, I. M. Kuzmin, N. S. Nedozhogin, A. K. Novikov, V. N. Rychkov, L. E. Tonkov, “Quasi-newton method for implicit coupling in FSI problem”, CPM, 17:4 (2015), 523–530 |
| 4. |
A. K. Novikov, I. M. Kuz'min, N. S. Nedozhogin, “Several features of the finite element technologies for hybrid computational architecture”, Izv. IMI UdGU, 2015, no. 2(46), 127–131 |
| 5. |
N. S. Nedozhogin, S. P. Kopysov, A. K. Novikov, “Parallel decomposition version in the AISM preconditioner”, Izv. IMI UdGU, 2015, no. 2(46), 120–126 |
| 6. |
N. S. Nedozhogin, S. P. Kopysov, A. K. Novikov, “Parallel forming of preconditioners based on the approximation of the Sherman-Morrison inversion formula”, Num. Meth. Prog., 16:1 (2015), 86–93 |
1
|
|
2014 |
| 7. |
S. P. Kopysov, I. M. Kuz'min, N. S. Nedozhogin, A. K. Novikov, V. N. Rychkov, Yu. A. Sagdeeva, L. E. Tonkov, “Parallel implementation of a finite-element algorithms on a graphics accelerator in the software package FEStudio”, Computer Research and Modeling, 6:1 (2014), 79–97 |
9
|
|
2012 |
| 8. |
S. P. Kopysov, I. M. Kuzmin, N. S. Nedozhogin, A. K. Novikov, “Parallel Algorithms for Constructing and Solving the Schur Complement on Graphics Accelerators”, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 154:3 (2012), 202–215 |
4
|
|
|
|
2014 |
| 9. |
N. S. Nedozhogin, A. S. Sarmakeeva, S. P. Kopysov, “Sherman - Morrison high-performance algorithm for inverse matrix on GPU”, Vestn. YuUrGU. Ser. Vych. Matem. Inform., 3:2 (2014), 101–108 |
| |
|
|
Contact us: