2013
DOI: 10.1016/j.amc.2013.08.026
|View full text |Cite
|
Sign up to set email alerts
|

A structure-preserving algorithm for the quaternion Cholesky decomposition

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 14 publications
(3 citation statements)
references
References 22 publications
0
3
0
Order By: Relevance
“…(Note four "active" variables in the first integrand (37), and only two radial and no angular ones in the second (40).) The integration constraints (38) now simply reduced to r 2 13 + r 2 14 µ 2 < 1, with µ > 1.…”
Section: B Eleven-dimensional Convex Set Of Two-qubit Statesmentioning
confidence: 99%
See 1 more Smart Citation
“…(Note four "active" variables in the first integrand (37), and only two radial and no angular ones in the second (40).) The integration constraints (38) now simply reduced to r 2 13 + r 2 14 µ 2 < 1, with µ > 1.…”
Section: B Eleven-dimensional Convex Set Of Two-qubit Statesmentioning
confidence: 99%
“…We wanted to test the fit of these last two functions by the generation of random two-quaterbit matrices-but had not yet found an effective manner of doing so (cf. [38][39][40]). (The possible use of Ginibre ensembles, in the manner of [38], and the associated issues in doing so, has been addressed by C. F. Dunkl in App.…”
Section: Attempted Construction Of χ4 (ε)mentioning
confidence: 99%
“…In the next, we will reformulate the problem in (28), so that it can be solved by SOC programming based method.…”
Section: Quaternion-valued Worst-case Constrained Algorithmmentioning
confidence: 99%