Výsledky vyhledávání - "complexity of numerical algorithms"
-
1
Symbolic algorithm for solving SLAEs with multi-diagonal coefficient matrices
ISSN: 2658-4670, 2658-7149Vydáno: Peoples’ Friendship University of Russia (RUDN University) 15.06.2025Vydáno v Discrete and continuous models and applied computational science (15.06.2025)“…Systems of linear algebraic equations with multi-diagonal coefficient matrices may arise after many different scientific and engineering problems, as well as…”
Získat plný text
Journal Article -
2
Direct Numerical Simulation of particulate flow with heat transfer
ISSN: 0142-727X, 1879-2278Vydáno: New York, NY Elsevier Inc 01.12.2010Vydáno v The International journal of heat and fluid flow (01.12.2010)“… The complexity of numerical algorithms coupling the heat and mass transfer and the considerable computational resources required limit the number of such direct simulations that can be reasonably performed…”
Získat plný text
Journal Article Konferenční příspěvek -
3
Yielding oscillator subjected to simple pulse waveforms: numerical analysis & closed-form solutions
ISSN: 0098-8847, 1096-9845Vydáno: Chichester, UK John Wiley & Sons, Ltd 01.12.2006Vydáno v Earthquake engineering & structural dynamics (01.12.2006)“…Numerical and analytical solutions are presented for the elastic and inelastic response of single‐degree‐of‐freedom yielding oscillators to idealized ground…”
Získat plný text
Journal Article -
4
GENERALIZED ATOMIC WAVELETS
ISSN: 1814-4225, 2663-2012Vydáno: National Aerospace University «Kharkiv Aviation Institute 23.02.2018Vydáno v RADIOELECTRONIC AND COMPUTER SYSTEMS (23.02.2018)“… (for example, color photos). Also, these functions have a local support, which allows to decrease complexity of numerical algorithms…”
Získat plný text
Journal Article -
5
Zastosowanie przetwarzania równoległego w analizie skupień
ISSN: 1899-3192, 2392-0041Vydáno: Wydawnictwo Uniwersytetu Ekonomicznego we Wrocławiu 2015Vydáno v Prace Naukowe Uniwersytetu Ekonomicznego we Wrocławiu (2015)“… The second, is the complexity of numerical algorithms, which are used in cluster analysis. The aim of this paper is to demonstrate the applicability of parallel computing in cluster analysis…”
Získat plný text
Journal Article -
6
On exact computational complexity of triangular factorization algorithms for general banded matrices
ISSN: 2837-1739, 2837-1739Vydáno: 01.06.2024Vydáno v Advances in Computational Science and Engineering (01.06.2024)“…Matrix triangular factorizations, as an intermediate step of some algorithms, are widely employed to solve scientific and engineering problems. However, there…”
Získat plný text
Journal Article -
7
Learning Power Allocation for Cell-free Massive MIMO System with Graph Neural Networks
ISSN: 2576-6813Vydáno: IEEE 08.12.2024Vydáno v IEEE Global Communications Conference (Online) (08.12.2024)“… To reduce the high computational complexity of numerical algorithms for solving optimization problems, deep neural networks (DNNs…”
Získat plný text
Konferenční příspěvek