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ę "numerical algorithm" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-3 z 3
    Tytuł:
    Balancing of a linear elastic rotor-bearing system with arbitrarily distributed unbalance using the Numerical Assembly Technique
    Autorzy:
    Quinz, Georg
    Prem, Marcel S.
    Klanner, Michael
    Ellermann, Katrin
    Powiązania:
    https://bibliotekanauki.pl/articles/2086883.pdf
    Data publikacji:
    2021
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    Numerical Assembly Technique
    rotor dynamics
    modal balancing
    recursive eigenvalue search algorithm
    dynamika wirnika
    wyważanie modalne
    Opis:
    In this paper, a new application of the Numerical Assembly Technique is presented for the balancing of linear elastic rotor-bearing systems with a stepped shaft and arbitrarily distributed mass unbalance. The method improves existing balancing techniques by combining the advantages of modal balancing with the fast calculation of an efficient numerical method. The rotating stepped circular shaft is modelled according to the Rayleigh beam theory. The Numerical Assembly Technique is used to calculate the steady-state harmonic response, eigenvalues and the associated mode shapes of the rotor. The displacements of a simulation are compared to measured displacements of the rotor-bearing system to calculate the generalized unbalance for each eigenvalue. The generalized unbalances are modified according to modal theory to calculate orthogonal correction masses. In this manner, a rotor-bearing system is balanced using a single measurement of the displacement at one position on the rotor for every critical speed. Three numerical examples are used to show the accuracy and the balancing success of the proposed method.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2021, 69, 6; e138237, 1--7
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Matrix black box algorithms - a survey
    Autorzy:
    Respondek, Jerzy
    Powiązania:
    https://bibliotekanauki.pl/articles/2173638.pdf
    Data publikacji:
    2022
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    matrix algebra
    matrix multiplication algorithm
    numerical recipes
    recursion
    algebra macierzowa
    algorytm mnożenia macierzy
    receptury numeryczne
    rekurencja
    Opis:
    The implementations of matrix multiplication on contemporary, vector-oriented, and multicore-oriented computer hardware are very carefully designed and optimized with respect to their efficiency, due to the essential significance of that operation in other science and engineering domains. Consequently, the available implementations are very fast and it is a natural desire to take advantage of the efficiency of those implementations in other problems, both matrix and nonmatrix. Such an approach is often called a black box matrix computation paradigm in the literature on the subject. In this article, we gathered a broad series of algorithms taking advantage of the efficiency of fast matrix multiplication algorithms in other mathematical and computer science operations.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2022, 70, 2; art. no. e140535
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    FPGA implementation of logarithmic versions of Baum-Welch and Viterbi algorithms for reduced precision hidden Markov models
    Autorzy:
    Pietras, M.
    Klęsk, P.
    Powiązania:
    https://bibliotekanauki.pl/articles/201874.pdf
    Data publikacji:
    2017
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    hidden Markov models
    numerical stability
    Viterbi algorithm
    parallel architecture
    field-programmable gate array
    ukryte modele Markowa
    stabilność numeryczna
    Algorytm Viterbiego
    architektura równoległa
    Opis:
    This paper presents a programmable system-on-chip implementation to be used for acceleration of computations within hidden Markov models. The high level synthesis (HLS) and “divide-and-conquer” approaches are presented for parallelization of Baum-Welch and Viterbi algorithms. To avoid arithmetic underflows, all computations are performed within the logarithmic space. Additionally, in order to carry out computations efficiently – i.e. directly in an FPGA system or a processor cache – we postulate to reduce the floating-point representations of HMMs. We state and prove a lemma about the length of numerically unsafe sequences for such reduced precision models. Finally, special attention is devoted to the design of a multiple logarithm and exponent approximation unit (MLEAU). Using associative mapping, this unit allows for simultaneous conversions of multiple values and thereby compensates for computational efforts of logarithmic-space operations. Design evaluation reveals absolute stall delay occurring by multiple hardware conversions to logarithms and to exponents, and furthermore the experiments evaluation reveals HMMs computation boundaries related to their probabilities and floating-point representation. The performance differences at each stage of computation are summarized in performance comparison between hardware acceleration using MLEAU and typical software implementation on an ARM or Intel processor.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2017, 65, 6; 935-946
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-3 z 3

      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