diff --git a/src/Mathematics.NET/AutoDiff/Node.cs b/src/Mathematics.NET/AutoDiff/GradientNode.cs
similarity index 89%
rename from src/Mathematics.NET/AutoDiff/Node.cs
rename to src/Mathematics.NET/AutoDiff/GradientNode.cs
index 76e6dc44..38bb92b5 100644
--- a/src/Mathematics.NET/AutoDiff/Node.cs
+++ b/src/Mathematics.NET/AutoDiff/GradientNode.cs
@@ -1,4 +1,4 @@
-// <copyright file="Node.cs" company="Mathematics.NET">
+// <copyright file="GradientNode.cs" company="Mathematics.NET">
 // Mathematics.NET
 // https://github.com/HamletTanyavong/Mathematics.NET
 //
@@ -32,7 +32,7 @@ namespace Mathematics.NET.AutoDiff;
 /// <summary>Represents a node on a gradient tape</summary>
 /// <typeparam name="T">A type that implements <see cref="IComplex{T}"/></typeparam>
 [StructLayout(LayoutKind.Sequential)]
-internal readonly record struct Node<T>
+internal readonly record struct GradientNode<T>
     where T : IComplex<T>
 {
     /// <summary>The derivative of the left component of the binary operation</summary>
@@ -45,7 +45,7 @@ internal readonly record struct Node<T>
     /// <summary>The parent index of the right node</summary>
     public readonly int PY;
 
-    public Node(int index)
+    public GradientNode(int index)
     {
         DX = T.Zero;
         DY = T.Zero;
@@ -54,7 +54,7 @@ public Node(int index)
         PY = index;
     }
 
-    public Node(T dx, int px, int py)
+    public GradientNode(T dx, int px, int py)
     {
         DX = dx;
         DY = T.Zero;
@@ -63,7 +63,7 @@ public Node(T dx, int px, int py)
         PY = py;
     }
 
-    public Node(T dx, T dy, int px, int py)
+    public GradientNode(T dx, T dy, int px, int py)
     {
         DX = dx;
         DY = dy;
diff --git a/src/Mathematics.NET/AutoDiff/GradientTape.cs b/src/Mathematics.NET/AutoDiff/GradientTape.cs
index 4fb25865..1499e93a 100644
--- a/src/Mathematics.NET/AutoDiff/GradientTape.cs
+++ b/src/Mathematics.NET/AutoDiff/GradientTape.cs
@@ -70,7 +70,7 @@ public record class GradientTape<T> : ITape<T>
 {
     // TODO: Measure performance with Stack<Node<T>> instead of List<Node<T>>
     // TODO: Consider using array pools or something similar
-    private List<Node<T>> _nodes;
+    private List<GradientNode<T>> _nodes;
     private int _variableCount;
 
     public GradientTape()
@@ -97,8 +97,8 @@ public void PrintNodes(CancellationToken cancellationToken, int limit = 100)
     {
         const string tab = "    ";
 
-        ReadOnlySpan<Node<T>> nodeSpan = CollectionsMarshal.AsSpan(_nodes);
-        Node<T> node;
+        ReadOnlySpan<GradientNode<T>> nodeSpan = CollectionsMarshal.AsSpan(_nodes);
+        GradientNode<T> node;
 
         int i = 0;
         while (i < Math.Min(_variableCount, limit))
@@ -146,7 +146,7 @@ public void ReverseAccumulation(out ReadOnlySpan<T> gradient, T seed)
             throw new Exception("Gradient tape contains no root nodes");
         }
 
-        ReadOnlySpan<Node<T>> nodes = CollectionsMarshal.AsSpan(_nodes);
+        ReadOnlySpan<GradientNode<T>> nodes = CollectionsMarshal.AsSpan(_nodes);
         ref var start = ref MemoryMarshal.GetReference(nodes);
 
         var length = nodes.Length;