Triad method
solution to the spacecraft attitude determination problem

The TRIAD method is the earliest published algorithm for determining spacecraft attitude, which was first introduced by Harold Black in 1964. Given the knowledge of two vectors in the reference and body coordinates of a satellite, the TRIAD algorithm obtains the direction cosine matrix relating to both frames. Harold Black played a key role in the development of the guidance, navigation, and control of the U.S. Navy's Transit satellite system at Johns Hopkins Applied Physics Laboratories. TRIAD represented the state of practice in spacecraft attitude determination before the advent of Wahba's problem and its several optimal solutions. Covariance analysis for Black's solution was subsequently provided by Markley.
Summary
Firstly, one considers the linearly independent reference vectors
R
→
1
{\displaystyle {\vec {R}}_{1}}
and
R
→
2
{\displaystyle {\vec {R}}_{2}}
. Let
r
→
1
,
r
→
2
{\displaystyle {\vec {r}}_{1},{\vec {r}}_{2}}
be the corresponding measured directions of the reference unit vectors as resolved in a body fixed frame of reference. Following that, they are then related by the equations,
for
i
=
1
,
2
{\displaystyle i=1,2}
, where
A
{\displaystyle A}
is a rotation matrix (sometimes also known as a proper orthogonal matrix, i.e.,
A
T
A
=
I
,
d
e
t
(
A
)
=
+
1
{\displaystyle A^{T}A=I,det(A)=+1}
).
A
{\displaystyle A}
transforms vectors in the body fixed frame into the frame of the reference vectors. Among other properties, rotational matrices preserve the length of the vector they operate on.
The public source identifies “Triad method” as solution to the spacecraft attitude determination problem. This brief keeps that definition visible, then builds a research path around Triad, method and solution.
Why this record matters
A short description can identify a subject without explaining its stakes. For “Triad method”, the useful work is to connect “solution to the spacecraft attitude determination problem” to the records capable of establishing context and consequence.
Named sources, stable identifiers and responsible institutions provide the strongest route from overview to verifiable evidence. The source revision retrieved here is dated Sep 16, 2025. The linked authority identifier is Q7839896. None of the 0 selected statements returned an explicit reference. The first chronological checks are 1964.
Overview language is designed for orientation and should not be treated as a substitute for the evidence cited beneath it. The lead is largely declarative, so disagreement and counter-evidence require a deliberate search beyond the opening account. Authority statements aid reconciliation but still require their own references, qualifiers and ranks to be checked.
How to read it
Use the entry as an orientation point, then follow its citations and revision history. Names, dates and institutional relationships should be checked against the original record.
- Subject orientation
- Search vocabulary
- Locating named sources
The closest primary source, responsible institution and strongest cited specialist reference.
Three-step research path
- Establish the record: confirm the title “Triad method”, its source revision and the description used here.
- Expand the search: follow Triad method primary sources, Triad method archive and Triad research across catalogues and specialist indexes.
- Test the account: compare the strongest cited source with the responsible institution’s current record and note any disagreement.
Questions for further research
- Which source most directly establishes the central claim about “Triad method”?
- What terminology or title could unlock a more precise catalogue search?
- Which institution is responsible for the underlying evidence?
Search terms from this dossier
This entry incorporates text from “Triad method” on English Wikipedia. Contributors are listed in the page history. Text is available under the Creative Commons Attribution-ShareAlike 4.0 License. Selected authority identifiers and statements are retrieved from Wikidata under CC0; their references and qualifiers remain part of the verification path.