نتایج جستجو برای: direct sequential simulation
تعداد نتایج: 1036847 فیلتر نتایج به سال:
This paper presents a parallel mixed direct/iterative method for solving linear systems Ax = b arising from circuit simulation. The systems are solved by a block LU factorization with an iterative method for the Schur complement. The Schur complement is a small and rather dense matrix. Direct LU decomposition of the Schur complement takes too much time in order to achieve reasonable speedup res...
Iterative decoding of Low Density Parity Check (LDPC) codes using the Parity Likelihood Ratio (PLR) algorithm have been proved to be more efficient compared to conventional Sum Product Algorithm (SPA). However, the nature of PLR algorithm tends to put numerious pieces of data to this decoder and perform computation intensive operations, which is a major challenge for building a practical real-t...
Most small-scale simulation applications are implemented by sequential simulation techniques. As the problem size increases, however, sequential techniques may be unable to manage the time complexity of the simulation applications adequately. It is natural to consider re-implementing the corresponding largescale simulations using parallel techniques, which have been reported to be successful in...
Software simulation of embedded systems is generally less expensive and offers more flexibility than direct testing on hardware. In embedded systems, it is necessary to consider the concurrency and timing properties of the target system that are not captured by the sequential execution of its code. To account for the timing properties of the target system, the simulator must be able to estimate...
The current work focuses on the development and application of an efficient algorithm for optimization of threedimensional turbulent flows, simulated using Direct Numerical Simulation (DNS) or large-eddy simulations, and further characterized by large-dimensional optimization-parameter spaces. The optimization algorithm is based on Sequential Quadratic Programming (SQP) in combination with a da...
The length of equal minimal and maximal blocks has eected on logarithm-scale logarithm against sequential function on variance and bias of de-trended uctuation analysis, by using Quasi Monte Carlo(QMC) simulation and Cholesky decompositions, minimal block couple and maximal are founded which are minimum the summation of mean error square in Horest power.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید