2017 IEEE National Aerospace and Electronics Conference (NAECON) 2017
DOI: 10.1109/naecon.2017.8268762
|View full text |Cite
|
Sign up to set email alerts
|

An efficient FPGA-based direct linear solver

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 14 publications
(4 citation statements)
references
References 12 publications
0
4
0
Order By: Relevance
“…Each iteration includes one inversion of an m×m matrix, one multiplication of two m×m matrices, four multiplications of an m×m matrix with an m× 1 vector and four dot multiplication of an n ×1 vector. Totally, it requires about 10,000 clock cycles [25]. The used Xilinx Vertex 6 FPGA has a clock frequency of 200 MHz.…”
Section: Some Discussion About the Proposed Controlmentioning
confidence: 99%
“…Each iteration includes one inversion of an m×m matrix, one multiplication of two m×m matrices, four multiplications of an m×m matrix with an m× 1 vector and four dot multiplication of an n ×1 vector. Totally, it requires about 10,000 clock cycles [25]. The used Xilinx Vertex 6 FPGA has a clock frequency of 200 MHz.…”
Section: Some Discussion About the Proposed Controlmentioning
confidence: 99%
“…After the disturbance occurs, the voltage and phase angle data of each generator can be obtained from WAMS, also the same information for the converter station needs to be collected. Considering the communication delay which is <100 ms [32], the total time that spending on the establishment of the emergency control strategy is <140 ms, which is short enough for the emergency control. However, it is difficult to extend the proposed method to larger scare systems.…”
Section: Simulation Analysismentioning
confidence: 99%
“…Direct methods, such as LU (Lower-Upper triangular) factorization, Gaussian elimination, QR factorization, and Cholesky factorization, are typically employed for dense linear systems, that is, systems that have the majority of their elements as non-zero values. In contrast, iterative methods encompass techniques such as Jacobi, Gauss-Seidel, and relaxation iterations, which are effective for sparse linear systems [22]. This present work solves the system of equations using Gaussian elimination with partial pivoting, which is the method adopted by the VTM software.…”
Section: Introductionmentioning
confidence: 99%