1992
DOI: 10.1049/ip-j.1992.0056
|View full text |Cite
|
Sign up to set email alerts
|

Performance of modified Faddeev algorithm on optical processors

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2006
2006
2010
2010

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 1 publication
0
1
0
Order By: Relevance
“…where A, B, C, and D are matrices with size of (n × n), (n × l), (m × n), and (m × l), respectively, the Schur complement, D + CA −1 B, can be calculated provided that matrix A is nonsingular [4]. First, a row operation is performed to multiply the top row by another matrix W and then to add the result to the bottom row:…”
Section: Schur Complement In the Faddeev Algorithmmentioning
confidence: 99%
“…where A, B, C, and D are matrices with size of (n × n), (n × l), (m × n), and (m × l), respectively, the Schur complement, D + CA −1 B, can be calculated provided that matrix A is nonsingular [4]. First, a row operation is performed to multiply the top row by another matrix W and then to add the result to the bottom row:…”
Section: Schur Complement In the Faddeev Algorithmmentioning
confidence: 99%