SelfAdjointEig
Stay organized with collections
Save and categorize content based on your preferences.
Computes the eigen decomposition of a batch of self-adjoint matrices
(Note: Only real inputs are supported).
Computes the eigenvalues and eigenvectors of the innermost N-by-N matrices in
tensor such that tensor[...,:,:] * v[..., :,i] = e[..., i] * v[...,:,i], for
i=0...N-1.
Constants
String |
OP_NAME |
The name of this op, as known by TensorFlow core engine |
Public Methods
static
<T extends TType>
SelfAdjointEig<T>
|
create( Scope scope, Operand<T> a, Boolean lower, Long maxIter, Float epsilon)
Factory method to create a class wrapping a new SelfAdjointEig operation.
|
Output<T>
|
v()
The column v[..., :, i] is the normalized eigenvector corresponding to the
eigenvalue w[..., i].
|
Output<T>
|
w()
The eigenvalues in ascending order, each repeated according to its
multiplicity.
|
Inherited Methods
From class
java.lang.Object
boolean
|
equals(Object arg0)
|
final
Class<?>
|
getClass()
|
int
|
hashCode()
|
final
void
|
notify()
|
final
void
|
notifyAll()
|
String
|
toString()
|
final
void
|
wait(long arg0, int arg1)
|
final
void
|
wait(long arg0)
|
final
void
|
wait()
|
Constants
public
static
final
String
OP_NAME
The name of this op, as known by TensorFlow core engine
Constant Value:
"XlaSelfAdjointEig"
Public Methods
public
static
SelfAdjointEig<T>
create
(Scope scope, Operand<T> a, Boolean lower, Long maxIter, Float epsilon)
Factory method to create a class wrapping a new SelfAdjointEig operation.
Parameters
scope |
current scope |
a |
the input tensor. |
lower |
a boolean specifies whether the calculation is done with the lower
triangular part or the upper triangular part. |
maxIter |
maximum number of sweep update, i.e., the whole lower triangular
part or upper triangular part based on parameter lower. Heuristically, it has
been argued that approximately logN sweeps are needed in practice (Ref: Golub &
van Loan "Matrix Computation"). |
epsilon |
the tolerance ratio. |
Returns
- a new instance of SelfAdjointEig
public
Output<T>
v
()
The column v[..., :, i] is the normalized eigenvector corresponding to the
eigenvalue w[..., i].
public
Output<T>
w
()
The eigenvalues in ascending order, each repeated according to its
multiplicity.
Except as otherwise noted, the content of this page is licensed under the Creative Commons Attribution 4.0 License, and code samples are licensed under the Apache 2.0 License. For details, see the Google Developers Site Policies. Java is a registered trademark of Oracle and/or its affiliates.
Last updated 2021-11-29 UTC.
[{
"type": "thumb-down",
"id": "missingTheInformationINeed",
"label":"Missing the information I need"
},{
"type": "thumb-down",
"id": "tooComplicatedTooManySteps",
"label":"Too complicated / too many steps"
},{
"type": "thumb-down",
"id": "outOfDate",
"label":"Out of date"
},{
"type": "thumb-down",
"id": "samplesCodeIssue",
"label":"Samples / code issue"
},{
"type": "thumb-down",
"id": "otherDown",
"label":"Other"
}]
[{
"type": "thumb-up",
"id": "easyToUnderstand",
"label":"Easy to understand"
},{
"type": "thumb-up",
"id": "solvedMyProblem",
"label":"Solved my problem"
},{
"type": "thumb-up",
"id": "otherUp",
"label":"Other"
}]
{"lastModified": "Last updated 2021-11-29 UTC."}
[[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Missing the information I need","missingTheInformationINeed","thumb-down"],["Too complicated / too many steps","tooComplicatedTooManySteps","thumb-down"],["Out of date","outOfDate","thumb-down"],["Samples / code issue","samplesCodeIssue","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2021-11-29 UTC."]]