Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "iterative algorithm" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-8 z 8
    Tytuł:
    A parallel algorithm of icsym forcomplexsymmetric linear systems in quantum chemistry
    Autorzy:
    Zhang, Y.
    Lv, Q.
    Xiao, M.
    Xie, G.
    Breitkopf, P.
    Powiązania:
    https://bibliotekanauki.pl/articles/305677.pdf
    Data publikacji:
    2018
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    complex symmetric linear systems
    parallel computing
    improved conjugate gradient-type iterative algorithm (ICSYM)
    Opis:
    Computational effort is a common issue for solving large-scale complex symmetric linear systems, particularly in quantum chemistry applications. In order to alleviate this problem, we propose a parallel algorithm of improved conjugate gradient-type iterative (ICSYM). Using three-term recurrence relation and or- thogonal properties of residual vectors to replace the tridiagonalization process of classical CSYM, which allows to decrease the degree of the reduce-operator from two to one communication at each iteration and to reduce the amount of vector updates and vector multiplications. Several numerical examples are implemented to show that high performance of proposed improved version is obtained both in convergent rate and in parallel efficiency.
    Źródło:
    Computer Science; 2018, 19 (4); 385-401
    1508-2806
    2300-7036
    Pojawia się w:
    Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    An iterative algorithm for random upper bound kinematical analysis
    Autorzy:
    Chwała, Marcin
    Powiązania:
    https://bibliotekanauki.pl/articles/2073758.pdf
    Data publikacji:
    2022
    Wydawca:
    Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
    Tematy:
    random bearing capacity
    shallow foundation
    scale of fluctuation
    iterative algorithm
    upper bound
    spatial variability
    Opis:
    A new approach for stochastic upper bound kinematical analyses is described. The study proposes an iterative algorithm that uses the Vanmarcke spatial averaging and kinematical failure mechanisms. The iterative procedure ensures the consistency between failure geometry and covariance matrix, which influences the quality of the results. The proposed algorithm can be applied to bearing capacity evaluation or slope stability problems. The iterative algorithm is used in the study to analyse the three-dimensional undrained bearing capacity of shallow foundations and the bearing capacity of the foundation for two-layered soil, in both cases, the soil strength spatial variability is included. Moreover, the obtained results are compared with those provided by the algorithm, based on the constant covariance matrix. The study shows that both approaches provide similar results for a variety of foundation shapes and scale of fluctuation values. Therefore, the simplified algorithm can be used for purposes that require high computational efficiency and for practical applications. The achieved efficiency using a constant covariance matrix for one realisation of a three-dimensional bearing capacity problem that includes the soil strength spatial variability results in about 0.5 seconds for a standard notebook. The numerical example presented in the study indicates the importance of the iterative algorithm for further development of the failure mechanism application in probabilistic analyses. Moreover, because the iterative algorithm is based on the upper bound theorem, it could be utilised as a reference for other methods for spatially variable soil.
    Źródło:
    Studia Geotechnica et Mechanica; 2022, 44, 1; 13--25
    0137-6365
    2083-831X
    Pojawia się w:
    Studia Geotechnica et Mechanica
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Strong convergence theorem of a hybrid projection algorithm for a family of quasi-φ-asymptotically nonexpansive mappings
    Autorzy:
    Tang, J. F.
    Chang, S. S.
    Liu, M.
    Liu, J. A.
    Powiązania:
    https://bibliotekanauki.pl/articles/255543.pdf
    Data publikacji:
    2010
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    quasi-phi-asymptotically nonexpansive mapping
    asymptotically regular mapping
    hybrid projection iterative algorithm
    strong convergence theorem
    Opis:
    The main purpose of this paper is by using a new hybrid projection iterative algorithm to prove some strong convergence theorems for a family of quasi-φ-asymptotically nonexpansive mappings. The results presented in the paper improve and extend the corresponding results announced by some authors.
    Źródło:
    Opuscula Mathematica; 2010, 30, 3; 341-348
    1232-9274
    2300-6919
    Pojawia się w:
    Opuscula Mathematica
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A new method of decision making in multi-objective optimal placement and sizing of distributed generators in the smart grid
    Autorzy:
    Khoshayand, Hossein Ali
    Wattanapongsakorn, Naruemon
    Mahdavian, Mehdi
    Ganji, Ehsan
    Powiązania:
    https://bibliotekanauki.pl/articles/2202555.pdf
    Data publikacji:
    2023
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    backward-forward load distribution
    fuzzy logic
    iterative search algorithm
    multi-objective optimization
    shortest distance from the origin
    weighted sum
    Opis:
    One of the most important aims of the sizing and allocation of distributed generators (DGs) in power systems is to achieve the highest feasible efficiency and performance by using the least number of DGs. Considering the use of two DGs in comparison to a single DG significantly increases the degree of freedom in designing the power system. In this paper, the optimal placement and sizing of two DGs in the standard IEEE 33-bus network have been investigated with three objective functions which are the reduction of network losses, the improvement of voltage profiles, and cost reduction. In this way, by using the backward-forward load distribution, the load distribution is performed on the 33-bus network with the power summation method to obtain the total system losses and the average bus voltage. Then, using the iterative search algorithm and considering problem constraints, placement and sizing are done for two DGs to obtain all the possible answers and next, among these answers three answers are extracted as the best answers through three methods of fuzzy logic, the weighted sum, and the shortest distance from the origin. Also, using the multi-objective non-dominated sorting genetic algorithm II (NSGA-II) and setting the algorithm parameters, thirty-six Pareto fronts are obtained and from each Pareto front, with the help of three methods of fuzzy logic, weighted sum, and the shortest distance from the origin, three answers are extracted as the best answers. Finally, the answer which shows the least difference among the responses of the iterative search algorithm is selected as the best answer. The simulation results verify the performance and efficiency of the proposed method.
    Źródło:
    Archives of Electrical Engineering; 2023, 72, 1; 253--271
    1427-4221
    2300-2506
    Pojawia się w:
    Archives of Electrical Engineering
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Research on optimization of unrelated parallel machine scheduling based on IG-TS algorithm
    Autorzy:
    Chi, Xinfu
    Liu, Shijing
    Li, Ce
    Powiązania:
    https://bibliotekanauki.pl/articles/2173693.pdf
    Data publikacji:
    2022
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    warp knitting machine
    parallel machine scheduling
    iterative greedy algorithm
    tabu search
    osnowarka
    planowanie maszyn równoległych
    algorytm zachłanny iteracyjny
    przeszukiwanie tabu
    Opis:
    This issue is a typical NP-hard problem for an unrelated parallel machine scheduling problem with makespan minimization as the goal and no sequence-related preparation time. Based on the idea of tabu search (TS), this paper improves the iterative greedy algorithm (IG) and proposes an IG-TS algorithm with deconstruction, reconstruction, and neighborhood search operations as the main optimization process. This algorithm has the characteristics of the strong capability of global search and fast speed of convergence. The warp knitting workshop scheduling problem in the textile industry, which has the complex characteristics of a large scale, nonlinearity, uncertainty, and strong coupling, is a typical unrelated parallel machine scheduling problem. The IG-TS algorithm is applied to solve it, and three commonly used scheduling algorithms are set as a comparison, namely the GA-TS algorithm, ABC-TS algorithm, and PSO-TS algorithm. The outcome shows that the scheduling results of the IG-TS algorithm have the shortest manufacturing time and good robustness. In addition, the production comparison between the IG-TS algorithm scheduling scheme and the artificial experience scheduling scheme for the small-scale example problem shows that the IG-TS algorithm scheduling is slightly superior to the artificial experience scheduling in both planning and actual production. Experiments show that the IG-TS algorithm is feasible in warp knitting workshop scheduling problems, effectively realizing the reduction of energy and the increase in efficiency of a digital workshop in the textile industry.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2022, 70, 4; art. no. e141724
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A practical statistical approach to the reconstruction problem using a single slice rebinning method
    Autorzy:
    Cierniak, Robert
    Pluta, Piotr
    Kaźmierczak, Andrzej
    Powiązania:
    https://bibliotekanauki.pl/articles/1837534.pdf
    Data publikacji:
    2020
    Wydawca:
    Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
    Tematy:
    reconstruction algorithm
    statistical iterative method
    computed tomography
    Opis:
    The paper presented here describes a new practical approach to the reconstruction problem applied to 3D spiral x-ray tomography. The concept we propose is based on a continuous-to-continuous data model, and the reconstruction problem is formulated as a shift invariant system. This original reconstruction method is formulated taking into consideration the statistical properties of signals obtained by the 3D geometry of a CT scanner. It belongs to the class of nutating reconstruction methods and is based on the advanced single slice rebinning (ASSR) methodology. The concept shown here significantly improves the quality of the images obtained after reconstruction and decreases the complexity of the reconstruction problem in comparison with other approaches. Computer simulations have been performed, which prove that the reconstruction algorithm described here does indeed significantly outperforms conventional analytical methods in the quality of the images obtained.
    Źródło:
    Journal of Artificial Intelligence and Soft Computing Research; 2020, 10, 2; 137-149
    2083-2567
    2449-6499
    Pojawia się w:
    Journal of Artificial Intelligence and Soft Computing Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On rational functions related to algorithms for a computation of roots. I
    Autorzy:
    Baran, Mirosław
    Powiązania:
    https://bibliotekanauki.pl/articles/93090.pdf
    Data publikacji:
    2019
    Wydawca:
    Państwowa Wyższa Szkoła Zawodowa w Tarnowie
    Tematy:
    algorithm
    iterative method
    polynomial
    recurrence relation
    algorytm
    metoda iteracyjna
    wielomian
    relacja powtarzalności
    Opis:
    We discuss a less known but surprising fact: a very old algorithm for computing square root known as the Bhaskara-Brouncker algorithm contains another and faster algorithms. A similar approach was obtained earlier by A.K. Yeyios [8] in 1992. By the way, we shall present a few useful facts as an essential completion of [8]. In particular, we present a direct proof that k – th Yeyios iterative algorithm is of order k. We also observe that Chebyshev polynomials Tn and Un are a special case of a more general construction. The most valuable idea followed this paper is contained in applications of a simple rational function Φ(w; z) = z-w/z+w.
    Źródło:
    Science, Technology and Innovation; 2019, 7, 4; 17-25
    2544-9125
    Pojawia się w:
    Science, Technology and Innovation
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Numerical Implementation of the Fictitious Domain Method for Elliptic Equations
    Autorzy:
    Temirbekov, A. N.
    Wójcik, W.
    Powiązania:
    https://bibliotekanauki.pl/articles/226820.pdf
    Data publikacji:
    2014
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    elliptic equation
    Dirichlet problem
    equation with rapidly varying coefficients
    computational algorithm
    iterative process
    fictitious domain method
    boundary conditions
    Opis:
    In this paper, we consider an elliptic equation with strongly varying coefficients. Interest in the study of these equations is connected with the fact that this type of equation is obtained when using the fictitious domain method. In this paper, we propose a special method for the numerical solution of elliptic equations with strongly varying coefficients. A theorem is proved for the rate of convergence of the iterative process developed. A computational algorithm and numerical calculations are developed to illustrate the effectiveness of the proposed method.
    Źródło:
    International Journal of Electronics and Telecommunications; 2014, 60, 3; 219-223
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-8 z 8

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies