Results 61 to 70 of about 12,305 (165)
Numerical Linear Algebra with Applications, Volume 31, Issue 1, January 2024.Abstract Fully implicit Runge–Kutta methods offer the possibility to use high order accurate time discretization to match space discretization accuracy, an issue of significant importance for many large scale problems of current interest, where we may have fine space resolution with many millions of spatial degrees of freedom and long time intervals ...
Owe Axelsson +2 more
wiley +1 more source
Network Coding for Multi-Resolution Multicast
, 2009 Multi-resolution codes enable multicast at different rates to different receivers, a setup that is often desirable for graphics or video streaming. We propose a simple, distributed, two-stage message passing algorithm to generate network codes for single-
Kim, MinJi +4 more
core +4 more sources
Advances in Mathematical Physics, Volume 2024, Issue 1, 2024.The current research introduces a novel approach to address the computational challenges associated with solving the Lane–Emden‐type equations by transforming them from their conventional differential form to the corresponding integro‐differential form.
Ratesh Kumar +3 more
wiley +1 more source
Advances in Civil Engineering, Volume 2024, Issue 1, 2024.In the context of the advancing construction engineering field in China, there has been a significant increase in the adoption of building information modeling (BIM) technology within engineering–procurement–construction (EPC) projects. This emerging technology is expected to significantly influence the decision‐making practices of professionals in the
Yujie Wu +4 more
wiley +1 more source
On the equivalence of Gaussian elimination and Gauss-Jordan reduction in solving linear equations [PDF]
A novel general approach to round-off error analysis using the error complexity concepts is described. This is applied to the analysis of the Gaussian Elimination and Gauss-Jordan scheme for solving linear equations.
Tsao, Nai-Kuan
core +1 more source
An Explicit Construction of Gauss-Jordan Elimination Matrix
, 2009 A constructive approach to get the reduced row echelon form of a given matrix $A$ is presented. It has been shown that after the $k$th step of the Gauss-Jordan procedure, each entry $a^k_{ij}(i<>j; j > k)$ in the new matrix $A^k$ can always be expressed as a ratio of two determinants whose entries are from the original matrix $A$.
openaire +2 more sources
The Potential of Synergistic Static, Dynamic and Speculative Loop Nest Optimizations for Automatic Parallelization [PDF]
, 2010 Research in automatic parallelization of loop-centric programs started with static analysis, then broadened its arsenal to include dynamic inspection-execution and speculative execution, the best results involving hybrid static-dynamic schemes.
Baghdadi, Riyadh +4 more
core +4 more sources
Algebraic structures for transitive closure [PDF]
Closed semi-rings and the closure of matrices oven closed semirings are defined and studied. Closed semirings are structures weaker than the structunes studied by Conway [3] and Aho, Hopcnoft and Ullman [1].
Lehmann, Daniel
core
Implementation of Complex Matrix Inversion using Gauss-Jordan Elimination Method in Verilog
International Journal of Computer Applications, 2015 It gives the architecture of an optimized complex matrix inversion using GAUSS-JORDAN (GJ) elimination in Verilog with single precision floating-point representation. The GJ-elimination algorithm uses a single precision floating point arithmetic components and control unit for performing necessary arithmetic operations.
K.R.K.Sastry K.R.K.Sastry, P. VenkataRao
openaire +1 more source
Memory-friendly fixed-point iteration method for nonlinear surface mode oscillations of acoustically driven bubbles: from the perspective of high-performance GPU programming. [PDF]
Ultrason Sonochem, 2023 Kalmár P +4 more
europepmc +1 more source